A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Consequences of assuming a universal relation
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
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
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
Journal of the ACM (JACM)
Database abstractions: aggregation
Communications of the ACM
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
Elements of the Theory of Computation
Elements of the Theory of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Design of relational views over network schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
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
Entity-Relationship Views over Uninterpreted Enterprise Schemas
Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
A complete axiomatization for a large class of dependencies in relational datatbases
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Horn clauses and database dependencies (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A structural model for database systems
A structural model for database systems
Existential dependencies in relational databases
Existential dependencies in relational databases
A formal view integration method
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Mapping a semantic database model to the relational model
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A transaction-based approach to relational database specification
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
The implication problem for inclusion dependencies: a graph approach
ACM SIGMOD Record
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
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
Inference rules for functional and inclusion dependencies
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Sort sets in the relational model
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Algebraic aspects of relational database decomposition
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
An optimizing prolog front-end to a relational query system
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Exploring into Programs for the Recovery of Data Dependencies Designed
IEEE Transactions on Knowledge and Data Engineering
On the Properties of Extended Inclusion Dependencies
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
An Abstract Introduction to the Temporal-Hierarchic Data Model (THM)
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Unary inclusion dependencies have polynomial time inference problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Approximate matching of textual domain attributes for information source integration
Proceedings of the 2nd international workshop on Information quality in information systems
On multi-column foreign key discovery
Proceedings of the VLDB Endowment
Maximizing conjunctive views in deletion propagation
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Heuristic strategies for the discovery of inclusion dependencies and other patterns
Journal on Data Semantics V
Maximizing Conjunctive Views in Deletion Propagation
ACM Transactions on Database Systems (TODS)
Efficient derivation of numerical dependencies
Information Systems
Hi-index | 0.00 |
Inclusion dependencies, or INDs (which can say, for example, that every manager is an employee) are studied, including their interaction with functional dependencies, or FDs. A simple complete axiomatization for INDs is presented, and the decision problem for INDs is shown to be PSPACE-complete. (The decision problem for INDs is the problem of determining whether or not Σ logically implies σ, given a set Σ of INDs and a single IND σ). It is shown that finite implication (implication over databases with a finite number of tuples) is the same as unrestricted implications for INDs, although finite implication and unrestricted implication are distinct for FDs and INDs taken together. It is shown that, although there are simple complete axiomatizations for FDs alone and for INDs alone, there is no complete axiomatization for FDs and INDs taken together, in which every rule is k-ary for some fixed k (and in particular, there is no finite complete axiomatization.) This is true whether we consider finite implication or unrestricted implication, and is true even if no relation scheme has more than three attributes. The nonexistence of a k-ary complete axiomatization for FDs and INDs taken together is proven by giving a condition which is necessary and sufficient in general for the existence of a k-ary complete axiomatization.