• Publications
  • Influence
On the Desirability of Acyclic Database Schemes
A class of database schemes, called acychc, was recently introduced. Expand
  • 762
  • 80
  • PDF
A Proof Procedure for Data Dependencies
Definition d'une classe de dependances, dependances generant l'equalite et les triples et generalisation du processus de poursuite pour traiter ces dependances. Expand
  • 399
  • 38
On the power of magic
This paper considers the efficient evaluation of recursive queries expressed using Horn Clauses by rewriting a program and evaluating the rewritten program bottom-up. Expand
  • 630
  • 33
  • PDF
A complete axiomatization for functional and multivalued dependencies in database relations
We investigate the inference rules that can be applied to functional and multivalued dependencies that exist in a database relation. Expand
  • 363
  • 30
  • PDF
On the Structure of Armstrong Relations for Functional Dependencies
An Armstrong relation for a set of functional dependencies (FDs) is a relation that satisfies each FD implied by the set but no FD that is not implied by it. Expand
  • 205
  • 20
  • PDF
On the menbership problem for functional and multivalued dependencies in relational databases
  • C. Beeri
  • Computer Science
  • TODS
  • 1 September 1980
The problem of whether a given dependency in a database relation can be derived from a given set of dependencies is investigated. Expand
  • 165
  • 18
Querying Business Processes with BP-QL
We present BP-QL, a new query language which allows for a GUI-based intuitive query formulation of business processes specifications, and query execution in a distributed environment. Expand
  • 131
  • 15
  • PDF
On the power of languages for manipulation of complex objects
Antimicrobial compositions are provided wherein there is obtained an enhancement of the activity of an antimicrobial agent exemplified by quaternary ammonium compounds, bisdiguanides, anti-fungalExpand
  • 241
  • 13
The theory of joins in relational data bases
This paper gives an efficient algorithm to determine whether the join of several relations is semantically meaningful (lossless) and a lossy join. Expand
  • 403
  • 12
  • PDF
Querying business processes
We present in this paper BP-QL, a novel query language for querying business processes. Expand
  • 175
  • 12
  • PDF