Inclusion dependencies and their interaction with functional dependencies

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.

[1]  John C. Mitchell.  Inference rules for functional and inclusion dependencies , 1983, PODS '83.

[2]  Edward Sciore.  Inclusion dependencies and the universal instance , 1983, PODS '83.

[3]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[4]  A BernsteinPhilip,et al.  Computational problems related to the design of normal form relational schemas , 1979 .

[5]  Ronald Fagin,et al.  Armstrong Databases for Functional and Inclusion Dependencies , 1983, Inf. Process. Lett..

[6]  J. Cherniavsky.  Review of "Unsolvable classes of quantificational formulas" by Harry R. Lewis. Addison-Wesley 1979. and "The decision problem: solvable classes of quantificational formulas" by Burton Dreben and Warren D. Goldfarb. Addison-Wesley 1979. , 1982, SIGA.

[7]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[8]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[9]  C. J. Date.  Referential Integrity , 1981, VLDB.

[10]  Ronald Fagin,et al.  A normal form for relational databases that is based on domains and keys , 1981, TODS.

[11]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[12]  Johann A. Makowsky,et al.  Embedded implicational dependencies and their inference problem , 1981, STOC '81.

[13]  David S. Johnson,et al.  Testing containment of conjunctive queries under functional and inclusion dependencies , 1982, J. Comput. Syst. Sci..

[14]  Yehoshua Sagiv,et al.  Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies , 1982, JACM.

[15]  E. Landau.  Handbuch der Lehre von der Verteilung der Primzahlen , 1974 .

[16]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[17]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[18]  Philip A. Bernstein,et al.  What does Boyce-Codd Normal Form Do? , 1980, VLDB.

[19]  Catriel Beeri,et al.  Formal Systems for Tuple and Equality Generating Dependencies , 1984, SIAM J. Comput..

[20]  Carlo Zaniolo,et al.  Design of relational views over network schemas , 1979, SIGMOD '79.

[21]  Jorma Rissanen.  Theory of Relations for Databases - A Tutorial Survey , 1978, MFCS.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Simon Hungtse Lin.  Existential dependencies in relational databases , 1981 .

[24]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[25]  Mihalis Yannakakis,et al.  Algebraic dependencies , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[26]  John C. Mitchell.  The Implication Problem for Functional and Inclusion Dependencies , 1984, Inf. Control..

[27]  Catriel Beeri,et al.  A complete axiomatization for functional and multivalued dependencies in database relations , 1977, SIGMOD '77.

[28]  Alfred V. Aho,et al.  The theory of joins in relational data bases , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[29]  William Kent.  Consequences of assuming a universal relation , 1981, TODS.

[30]  Ronald Fagin,et al.  Functional Dependencies in a Relational Data Base and Propositional Logic , 1977, IBM J. Res. Dev..

[31]  Jeffrey D. Ullman,et al.  The U. R. strikes back , 1982, PODS.

[32]  Catriel Beeri,et al.  Compatible attributes in a universal relation , 1982, PODS '82.

[33]  Moshe Y. Vardi,et al.  Unary inclusion dependencies have polynomial time inference problems , 1983, STOC '83.

[34]  FaginRonald.  Multivalued dependencies and a new normal form for relational databases , 1977 .

[35]  Ramez Elmasri,et al.  A structural model for database systems , 1979 .

[36]  B. Dreben,et al.  The decision problem: Solvable classes of quantificational formulas , 1979 .

[37]  Diane C. P. Smith,et al.  Database abstractions: aggregation , 1977, CACM.

[38]  Jeffrey D. Ullman,et al.  A complete axiomatization for a large class of dependencies in relational datatbases , 1980, STOC '80.

[39]  Anthony C. Klug.  Entity-Relationship Views over Uninterpreted Enterprise Schemas , 1979, ER.

[40]  Mihalis Yannakakis,et al.  Tools for Template Dependencies , 1983, SIAM J. Comput..

[41]  Laurian M. Chirica,et al.  The entity-relationship model: toward a unified view of data , 1975, SIGF.