A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
Database abstractions: aggregation
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Functional dependencies on cyclic database schemes
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Towards a sound view integration methodology
PODS '83 Proceedings of the 2nd 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
Equational theories and database constraints
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Tools and transformations—rigorous and otherwise—for practical database design
ACM Transactions on Database Systems (TODS)
The implication problem for inclusion dependencies: a graph approach
ACM SIGMOD Record
Implication and Referential Constraints: A New Formal Reasoning
IEEE Transactions on Knowledge and Data Engineering
Equivalence of queries combining set and bag-set semantics
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Schema versioning in data warehouses: enabling cross-version querying via schema augmentation
Data & Knowledge Engineering - Special issue: WIDM 2004
Extending inclusion dependencies with conditions
Theoretical Computer Science
| Hi-index | 0.00 |
We present a new graph theoretic approach to the implication problem for functional (FD) and inclusion (IND) dependencies. Using this methodology we prove decidability for the case of typed IND's and acyclic FD's. We provide new lower bounds for the implication of typed, acyclic IND's and FD's --- NP-hardness and PSPACE-hardness for bounded domains. Finally, we show that there is no k-ary complete axiomatization for implication of FD's, even when we have pairwise consistency, i.e., all possible typed IND's hold.