Testing implications of data dependencies
Authors:
Open Access
- 1 December 1979
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 4 (4) , 455-469
Abstract
Presented is a computation method—the chase —for testing implication of data dependencies by a set of data dependencies. The chase operates on tableaux similar to those of Aho, Sagiv, and Ullman. The chase includes previous tableau computation methods as special cases. By interpreting tableaux alternately as mappings or as templates for relations, it is possible to test implication of join dependencies (including multivalued dependencies) and functional dependencies by a set of dependencies.Keywords
This publication has 12 references indexed in Scilit:
- Decision Problems for Multivalued Dependencies in Relational DatabasesSIAM Journal on Computing, 1979
- Equivalences among Relational ExpressionsSIAM Journal on Computing, 1979
- Equivalence of relational database schemes1979
- Normal forms and relational database operators1979
- Independent components of relationsACM Transactions on Database Systems, 1977
- Multivalued dependencies and a new normal form for relational databasesACM Transactions on Database Systems, 1977
- Optimal implementation of conjunctive queries in relational data bases1977
- A complete axiomatization for functional and multivalued dependencies in database relations1977
- Synthesizing third normal form relations from functional dependenciesACM Transactions on Database Systems, 1976
- A relational model of data for large shared data banksCommunications of the ACM, 1970