论文信息 - Inclusion and Equivalence between Relational Database Schemata

Inclusion and Equivalence between Relational Database Schemata

Abstract Conceptual relations among relational database schemata are investigated. Two different definitions of inclusion and a definition of equivalence between schemata are given. Several examples of practical situations adequately handled by our definitions are shown. Finally, necessary and sufficient conditions for inclusion and equivalence are proved for two classes of schemata, meaningful in the relational theory.

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

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

[3] Catriel Beeri,et al. A Sophisticate's Introduction to Database Normalization Theory , 1978, VLDB.

[4] Edward Sciore. Improving semantic specification in a relational database , 1979, SIGMOD '79.

[5] Ronald Fagin,et al. Normal forms and relational database operators , 1979, SIGMOD '79.

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

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

[8] Diane C. P. Smith,et al. Database abstractions: aggregation and generalization , 1977, TODS.

[9] Carlo Batini,et al. Conceptual Relations between Databases Transformed under Join and Projection , 1980, MFCS.

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