Share This Author
On the Desirability of Acyclic Database Schemes
It is shown that this class of database schemes, called acychc, has a number of desirable properties that have been studied by other researchers and are shown to be eqmvalent to acydicity.
On the power of magic
A class of information passing strategies is considered which suffices to describe most query evaluation algorithms in the database literature, and it is shown that these strategies may always be implemented by rewriting a given program and evaluating the rewritten program bottom-up.
A complete axiomatization for functional and multivalued dependencies in database relations
The main result of the paper is that the rules presented are complete for the family of functional and multivalued dependencies.
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. On montre quelques cas pour lesquels…
On the power of languages for manipulation of complex objects
The compositions comprising an antimicrobial agent and a potentiating agent in a suitable carrier are useful for killing susceptible organisms on various surfaces and find special applications as surgical scrub solutions and for use in dressing topical wounds.
On the Structure of Armstrong Relations for Functional Dependencies
It is shown that the time complexity of finding an Armstrong relation, a relation that satisfies each FD implied by the set but no FD that is not implied by it, is precisely exponential in the number of attributes.
The theory of joins in relational data bases
- A. Aho, C. Beeri, J. Ullman
- Computer Science18th Annual Symposium on Foundations of Computer…
- 1 September 1979
An efficient algorithm to determine whether the join of several relations is semantically meaningful (lossless) and an efficient algorithmto determine whether a set of relations has a subset with a lossy join are given.
On the menbership problem for functional and multivalued dependencies in relational databases
- C. Beeri
- Computer Science, MathematicsTODS
- 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. We show that the problem can be decided in polynomial time when the…
Querying Business Processes with BP-QL