A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Compatible attributes in a universal relation
PODS '82 Proceedings of the 1st 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
Horn clauses and database dependencies (Extended Abstract)
STOC '80 Proceedings of the twelfth 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
The implication and finite implication problems for typed template dependencies
The implication and finite implication problems for typed template dependencies
Formal limits on the automatic generation and maintenance of integrity constraints
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational transducers for electronic commerce
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The implication problem for inclusion dependencies: a graph approach
ACM SIGMOD Record
Functional and inclusion dependencies a graph theoretic approach
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Implication and Referential Constraints: A New Formal Reasoning
IEEE Transactions on Knowledge and Data Engineering
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Approximate matching of textual domain attributes for information source integration
Proceedings of the 2nd international workshop on Information quality in information systems
Heuristic strategies for the discovery of inclusion dependencies and other patterns
Journal on Data Semantics V
| Hi-index | 0.00 |
A set Σ of functional dependencies and inclusion dependencies implies a single dependency σ if all databases (finite and infinite) which satisfy Σ also satisfy σ. This paper presents complete inference rules for deducing implications of inclusion and functional dependencies. The results of [5] suggest that the implication problem for functional and inclusion dependencies together has no simple axiomatization satisfying a natural set of conditions. Out of necessity, the inference rules presented here do not satisfy the conditions assumed in [5].