The implication problem for functional and inclusion dependencies
Information and Control
A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Principles of Database Systems
Principles of Database Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Functional dependencies on cyclic database schemes
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
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
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Unary inclusion dependencies have polynomial time inference problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the correctness of representing extended entity-relationship structures in the relational model
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM (JACM)
The undecidability of the semi-unification problem
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Identifying Extended Entity-Relationship Object Structures in Relational Schemas
IEEE Transactions on Software Engineering
On subsumption and semiunification in feature algebras
Journal of Symbolic Computation
Referential Integrity Revisited: An Object-Oriented Perspective
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Reasoning about Uniqueness Constraints in Object Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Database theory and cylindric lattices
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We present a novel way to formulate database dependencies as sentences of first-order logic, using equational statements instead of Horn clauses. Dependency implication is directly reduced to equational implication. Our approach is powerful enough to express functional and inclusion dependencies, which are the most common database constraints. We present a new proof procedure for these dependencies. We use our equational formulation to derive new upper and lower bounds for the complexity of their implication problems.