Properties of acyclic database schemes

There is a class of database descriptions, involving one “acyclic” join dependency and a collection of functional dependencies, and nothing else, that appears powerful enough to describe most any real-world body of data in relational database terms. Further, this class has many desirable properties. Some properties make operations like updates and the selection of joins to implement a query over a universal relation especially easy. Other properties of interest were studied by other researchers who described the same class in radically different terms, and found desirable properties in their own contexts. It is the purpose of this paper to define the class formally, to give its important properties and the equivalences with the other classes mentioned, and to explain the importance of each property. This paper is intended to summarize the results that will appear in more detail in [FMU] and [BFMY].

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

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

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

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

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

[6]  Adrian Walker.  Time and Space in a Lattice of Universal Relations with Blank Entries , 1980, XP1 Workshop on Database Theory.

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

[8]  Catriel Beeri,et al.  On the Properties of Join Dependencies , 1979, Advances in Data Base Theory.

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

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

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

[12]  Carlo Zaniolo,et al.  Analysis and design of relational schemata for database systems. , 1976 .

[13]  Y. Edmund Lien.  Multivalued Dependencies With Null Values In Relational Data Bases , 1979, Fifth International Conference on Very Large Data Bases, 1979..

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

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

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

[17]  Edward Sciore,et al.  Some Observations on Real-World Data Dependencies , 1980, XP1 Workshop on Database Theory.

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

[19]  Yannis Vassiliou,et al.  Null values in data base management a denotational semantics approach , 1979, SIGMOD '79.

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

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

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

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

[24]  Y. Edmund Lien,et al.  On the Semantics of the Entity-Relationship Data Model , 1979, ER.

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

[26]  FaginRonald.  Multivalued dependencies and a new normal form for relational databases , 1977 .