An introduction to database systems: vol. I (4th ed.)
An introduction to database systems: vol. I (4th ed.)
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks
Communications of the ACM
Query processing utilizing dependencies and horizontal decomposition
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Functional and inclusion dependencies a graph theoretic approach
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inclusion dependencies and the universal instance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inference rules for functional and inclusion dependencies
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Testing containment of conjunctive queries under functional and inclusion dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Inclusion dependencies and their interaction with functional dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Unary inclusion dependencies have polynomial time inference problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In this paper, we propose a graph theoretic approach to deal with the implication problem for inclusion dependencies. By analogy with functional dependencies, we define and present algorithms for computing the following concepts: the closure of a relation scheme R for X according to a set of inclusion dependencies and the minimal cover for inclusion dependencies.