Algorithms for Acyclic Database Schemes

Many real-world situations can be captured by a set of functional dependencies and a single join dependency of a particular form called acyclic [B..]. The join dependency corresponds to a natural decomposition into meaningfull objects (an acyclic database scheme). Our purpose in this paper is to describe efficient algorithms in this setting for various problems, such as computing projections, minimizing joins, inferring dependencies, and testing for dependency satisfaction.

[1]  David Maier,et al.  Testing implications of data dependencies , 1979, SIGMOD '79.

[2]  Y. Edmund Lien,et al.  On the Equivalence of Database Models , 1982, JACM.

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

[4]  Ronald Fagin,et al.  A simplied universal relation assumption and its properties , 1982, TODS.

[5]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[6]  Mihalis Yannakakis,et al.  On the Complexity of Testing Implications of Functional and Join Dependencies , 1981, JACM.

[7]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

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

[9]  Mihalis Yannakakis,et al.  Testing the Universal Instance Assumption , 1980, Inf. Process. Lett..

[10]  Philip A. Bernstein,et al.  Synthesizing third normal form relations from functional dependencies , 1976, TODS.

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

[12]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[13]  Catriel Beeri,et al.  On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.

[14]  Edward Sciore.  Real-world MVD's , 1981, SIGMOD '81.

[15]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[16]  Peter Honeyman,et al.  Testing satisfaction of functional dependencies , 1982, JACM.

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

[18]  Catriel Beeri,et al.  On the Properties of Join Dependencies , 1979, Advances in Data Base Theory.

[19]  Philip A. Bernstein,et al.  Computational problems related to the design of normal form relational schemas , 1979, TODS.

[20]  Catriel Beeri,et al.  Properties of acyclic database schemes , 1981, STOC '81.

[21]  Alfred V. Aho,et al.  Efficient optimization of a class of relational expressions , 1979, TODS.

[22]  Yehoshua Sagiv,et al.  Can we use the universal instance assumption without using nulls? , 1981, SIGMOD '81.