论文信息 - Construction of Universal Instances for Loop-Free Network Databases Using a Join-Like Operation

Construction of Universal Instances for Loop-Free Network Databases Using a Join-Like Operation

In this paper, we give a polynomial-time method to construct effectively the unique universal instance, using as few nulls as possible, from any loop-free network database, via a "minimal information" extension of natural join. Our results can be seen as concretely and quickly implementing the universal relation view for databases which are not pairwise consistent.

Sushil Jajodia | Frederick N. Springsteel | S. Jajodia | F. Springsteel

[1] C. J. Date. The Outer Join , 1983, ICOD.

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

[3] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.

[4] Ronald Fagin,et al. Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.

[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[6] J. D. Uiiman. Principles of database systems , 1982 .

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

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

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

[10] Mihalis Yannakakis,et al. Algorithms for Acyclic Database Schemes , 1981, VLDB.

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

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

[13] Carlo Zaniolo. Database relations with null values , 1982, PODS '82.

[14] Yannis Vassiliou. Functional Dependencies and Incomplete Information , 1980, VLDB.

[15] A. Bonato,et al. Graphs and Hypergraphs , 2021, Clustering.

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