The U. R. strikes back

In this paper, we try to put to rest many of the objections to the universal relation concept that have appeared in the literature. First, we shall taxonomize the varieties of ideas that are sometimes called the "universal relation assumption." Then, we consider some of the arguments pro and con. In some cases, the arguments against were expressed prematurely, and solutions to the problems they expose have since been found. In other cases, the arguments against are simply fallacious. In still other cases, the problems pointed out are real, but simply serve to point out that the advantages of the universal relation are not gotten for free. We shall conclude the paper with a description of the algorithm used to interpret queries in System/U, and the reasoning behind it.

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

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

[3]  Paolo Atzeni,et al.  Properties of acyclic database schemes: an analysis , 1981, XP2 Workshop on Relational Database Theory.

[4]  Michael Stonebraker,et al.  The design and implementation of INGRES , 1976, TODS.

[5]  E. F. Codd,et al.  A Relational Model for Large Shared Data Banks , 1970 .

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

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

[8]  David Maier,et al.  Maximal objects and the semantics of universal relation databases , 1983, TODS.

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

[10]  Eugene Wong,et al.  Decomposition—a strategy for query processing , 1976, TODS.

[11]  P. Dell'Orco,et al.  Using Knowledge of a Data Base World in Interpreting Natural Language Queries , 1977, IFIP Congress.

[12]  Chew Lik Chang.  Finding missing joins for incomplete queries in relational data bases" ibm res , 1978 .

[13]  Jerry Waxman,et al.  A Study of Three Database Query Languages , 1978, JCDKB.

[14]  Sylvia L. Osborn.  Towards A Universal Relation Interface , 1979, Fifth International Conference on Very Large Data Bases, 1979..

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

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

[17]  Alberto O. Mendelzon.  Database states and their tableaux , 1984, TODS.

[18]  Henry F. Korth.  System/U: A Progress Report , 1981, XP2 Workshop on Relational Database Theory.

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

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

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

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

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

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

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

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

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

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

[29]  Alfred V. Aho,et al.  Efficient optimization of a class of relational expressions , 1978, SIGMOD Conference.

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

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

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