On the Desirability of Acyclic Database Schemes

A class of database schemes, called acychc, was recently introduced. It is shown that this class has a number of desirable properties. In particular, several desirable properties that have been studied by other researchers m very different terms are all shown to be eqmvalent to acydicity. In addition, several equivalent charactenzauons of the class m terms of graphs and hypergraphs are given, and a smaple algorithm for determining acychclty is presented. Also given are several eqmvalent characterizations of those sets M of multivalued dependencies such that M is the set of muRlvalued dependencies that are the consequences of a given join dependency. Several characterizations for a conflict-free (in the sense of Lien) set of muluvalued dependencies are provided.

[1]  Charles W. Bachman,et al.  Data structure diagrams , 1969, DATB.

[2]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

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

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

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

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

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

[8]  Jorma Rissanen.  Theory of Relations for Databases - A Tutorial Survey , 1978, MFCS.

[9]  Clement T. Yu,et al.  An algorithm for tree-query membership of a distributed query , 1979, COMPSAC.

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

[11]  David Maier,et al.  Generalized Mutual Dependencies And The Decomposition Of Database Relations , 1979, Fifth International Conference on Very Large Data Bases, 1979..

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

[13]  Tadao Kasami,et al.  Decision Problems for Multivalued Dependencies in Relational Databases , 1979, SIAM J. Comput..

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

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

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

[17]  Peter Honeyman,et al.  Functional dependencies and the universal instance property in the relational model of database systems , 1980 .

[18]  Joachim Biskup.  Inferences of Multivalued Dependencies in Fixed and Undetermined Universes , 1980, Theor. Comput. Sci..

[19]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

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

[21]  Edward Sciore,et al.  The universal instance and database design , 1980 .

[22]  Michael J. C. Gordon,et al.  The Denotational Semantics of Sequential Machines , 1980, Inf. Process. Lett..

[23]  Philip A. Bernstein,et al.  Power of Natural Semijoins , 1981, SIAM J. Comput..

[24]  Mihalis Yannakakis,et al.  On the Complexity of Testing Implications of Functional and Join Dependencies , 1981, JACM.

[25]  Y. Edmund Lien,et al.  Hierarchical schemata for relational databases , 1981, TODS.

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

[27]  Marina Moscarini,et al.  Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata , 1981, WG.

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

[29]  Catriel Beeri,et al.  Equivalence of Relational Database Schemes , 1981, SIAM J. Comput..

[30]  Philip A. Bernstein,et al.  Using Semi-Joins to Solve Relational Queries , 1981, JACM.

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

[32]  Nathan Goodman,et al.  Tree queries: a simple class of relational queries , 1982, TODS.

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

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

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

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

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