Universal and Representative Instances Using Unmarked Nulls

Representative instances are important since in addition to the universal relation view they permit updates in the individual relations; if these updates are locally valid, then they do not violate global consistency. In this paper, we first give conditions under which we can construct a universal instance I which uses only one type of nulls (unmarked nulls) and whose total projections onto the relation schemes yield exactly the database relations. Then, we give a necessary and sufficient condition under which this I is actually a representative instance. Our conditions are simple and easily maintained.

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

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

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

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

[5]  David Maier,et al.  Discarding the Universal Instance Assumption: Preliminary Results , 1980, XP1 Workshop on Database Theory.

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

[7]  Jeffrey D. Ullman,et al.  SYSTEM/U: a database system based on the universal relation assumption , 1984, TODS.

[8]  Ronald Fagin.  The Decomposition Versus Synthetic Approach to Relational Database Design , 1977, VLDB.

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

[10]  Yehoshua Sagiv,et al.  A characterization of globally consistent databases and their correct access paths , 1983, TODS.

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

[12]  Paolo Atzeni,et al.  Assumptions in relational database theory , 1982, PODS '82.

[13]  Jorma Rissanen.  On equivalences of database schemes , 1982, PODS '82.

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

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

[16]  David Maier,et al.  The Theory of Relational Databases , 1983 .

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

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

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

[20]  Sushil Jajodia,et al.  On Universal and Representative Instances for Inconsistent Databases , 1983, ER.

[21]  E. F. Codd,et al.  Relational database: a practical foundation for productivity , 1982, CACM.

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

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

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

[25]  C. Robert Carlson,et al.  A generalized access path model and its application to a relational data base system , 1976, SIGMOD '76.