论文信息 - Extension Joins

Extension Joins

In proving that a set of relation schemes is a lossless decomposition of a set of attributes, it is sometimes possible to derive a sequence of extension joins whlich, upon execution, computes the join of the corresponding relations. Unlike natural join, any sequence of extension joins, which are really projections followed by joins, can be computed in polynomial time. The technique is effective in the important cases of decomposition into independent components and database schemes produced by Codd's third normal form algorithm.

Peter Honeyman

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

[2] Jorma Rissanen,et al. Independent components of relations , 1977, TODS.

[3] C. Robert Carlson,et al. The Information Preserving Properties of Relational Database Transformations , 1978, VLDB.

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

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

[6] Catriel Beeri,et al. Preserving Functional Dependencies , 1981, SIAM J. Comput..

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

[8] Catriel Beeri,et al. Equivalence of relational database schemes , 1979, SIAM J. Comput..

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

[10] David Maier,et al. Adequacy of Decompositions of Relational Databases , 1980, J. Comput. Syst. Sci..

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

[12] Joachim Biskup,et al. Synthesizing independent database schemas , 1979, SIGMOD '79.