On Inferences of Full First-Order Hierarchical Decompositions

Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-order hierarchical decompositions constitute a large class of database constraints that can provide assistance to the database designer in identifying a suitable database schema. We establish finite axiomatisations of full first-order hierarchical decompositions that mimic best database design practice. That is, an inference engine derives all the independent collections of the universal schema during database normalization, and the designer determines during database denormalization which re-combinations of these independent collections manifest the final database schema. We also show that well-known correspondences between multivalued dependencies, degenerated multivalued dependencies, and a fragment of Boolean propositional logic do not extend beyond binary full first-order hierarchical decompositions. This research is supported by the Marsden fund council from Government funding, administered by the Royal Society of New Zealand

[1]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[2]  A BernsteinPhilip,et al.  Computational problems related to the design of normal form relational schemas , 1979 .

[3]  Wei Li,et al.  On logic of paradox , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[4]  Sven Hartmann,et al.  Efficient reasoning about a robust XML key fragment , 2009, TODS.

[5]  János Demetrovics,et al.  On the Representation of Dependencies by Propositional Logic , 1991, MFDBS.

[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]  Sven Hartmann,et al.  Numerical Constraints for XML , 2007, WoLLIC.

[8]  Sebastian Link.  On Multivalued Dependencies in Fixed and Undetermined Universes , 2006, FoIKS.

[9]  Sven Hartmann,et al.  On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations , 2010, WoLLIC.

[10]  Catriel Beeri,et al.  On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.

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

[12]  Sven Hartmann,et al.  Full hierarchical dependencies in fixed and undetermined universes , 2007, Annals of Mathematics and Artificial Intelligence.

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

[14]  Sven Hartmann,et al.  On a problem of Fagin concerning multivalued dependencies in relational databases , 2006, Theor. Comput. Sci..

[15]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[16]  Alberto O. Mendelzon.  On Axiomatizing Multivalued Dependencies in Relational Databases , 1979, JACM.

[17]  Zahir Tari,et al.  Object normal forms and dependency constraints for object-oriented schemata , 1997, TODS.

[18]  Klaus-Dieter Schewe,et al.  Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets , 2006, Theor. Comput. Sci..

[19]  Laks V. S. Lakshmanan,et al.  An Algebraic Theory of Functional and Multivalued Dependencies in Relational Databases , 1987, Theor. Comput. Sci..

[20]  Sven Hartmann,et al.  Expressive, yet tractable XML keys , 2009, EDBT '09.

[21]  Sebastian Link.  Consistency Enforcement in Databases , 2001, Semantics in Databases.

[22]  Sven Hartmann,et al.  Solving the Implication Problem for XML Functional Dependencies with Properties , 2010, WoLLIC.

[23]  Kamran Parsaye-Ghomi,et al.  Inferences involving embedded multivalued dependencies and transitive dependencies , 1980, SIGMOD '80.

[24]  Bernhard Thalheim,et al.  Entity-relationship modeling - foundations of database technology , 2010 .

[25]  Marco Schaerf,et al.  Tractable Reasoning via Approximation , 1995, Artif. Intell..

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

[27]  Tadao Kasami,et al.  Membership Problems for Data Dependencies in Relational Expressions , 1984, Theor. Comput. Sci..

[28]  Jef Wijsen,et al.  Temporal FDs on complex objects , 1999, TODS.

[29]  Ronald Fagin,et al.  The theory of data dependencies - a survey , 1984 .

[30]  Sven Hartmann.  On Inferences of Weak Multivalued Dependencies , 2009 .

[31]  Jing Wang,et al.  On the Notion of an XML Key , 2008, SDKB.

[32]  Yehoshua Sagiv.  An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic , 1980, JACM.

[33]  Claude Delobel,et al.  Normalization and hierarchical dependencies in the relational data model , 1978, TODS.

[34]  Patrick C. Fischer,et al.  Interactions between Dependencies and Nested Relational Structures , 1985, J. Comput. Syst. Sci..

[35]  Sven Hartmann,et al.  When data dependencies over SQL tables meet the logics of paradox and S-3 , 2010, PODS '10.

[36]  Ronald Fagin,et al.  The Theory of Data Dependencies - An Overview , 1984, ICALP.

[37]  Sven Hartmann,et al.  Numerical constraints on XML data , 2010, Inf. Comput..

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

[39]  Millist W. Vincent,et al.  Semantic foundations of 4NF in relational database design , 1999, Acta Informatica.

[40]  Sebastian Link.  Charting the completeness frontier of inference systems for multivalued dependencies , 2008, Acta Informatica.

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

[42]  Sebastian Link,et al.  Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes , 2008, FoIKS.

[43]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[44]  Richard Statman,et al.  On the Structure of Armstrong Relations for Functional Dependencies , 1984, JACM.

[45]  G. Grätzer.  General Lattice Theory , 1978 .

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

[47]  Sven Hartmann,et al.  More Functional Dependencies for XML , 2003, ADBIS.

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

[49]  Sebastian Link.  On the Implication of Multivalued Dependencies in Partial Database Relations , 2008, Int. J. Found. Comput. Sci..

[50]  Sebastian Link,et al.  Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies , 2010, Inf. Syst..

[51]  Claude Delobel,et al.  Decompositions and functional dependencies in relations , 1980, TODS.

[52]  Cong Yu,et al.  XML schema refinement through redundancy detection and normalization , 2008, The VLDB Journal.

[53]  Heikki Mannila,et al.  Design by Example: An Application of Armstrong Relations , 1986, J. Comput. Syst. Sci..

[54]  Marc Gyssens,et al.  The Structure of the Relational Database Model , 1989, EATCS Monographs on Theoretical Computer Science.

[55]  Marcelo Arenas,et al.  A normal form for XML documents , 2002, PODS '02.

[56]  Klaus-Dieter Schewe,et al.  Functional and multivalued dependencies in nested databases generated by record and list constructor , 2006, Annals of Mathematics and Artificial Intelligence.

[57]  Chen Zhan-sheng,et al.  Strong functional dependencies and their application to normal forms in XML , 2005 .

[58]  Klaus-Dieter Schewe,et al.  Erratum to "Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets" , 2006, Theor. Comput. Sci..

[59]  Sven Hartmann,et al.  Characterising nested database dependencies by fragments of propositional logic , 2008, Ann. Pure Appl. Log..

[60]  Grant E. Weddell,et al.  Reasoning about functional dependencies generalized for semantic data models , 1992, TODS.

[61]  C. M. Sperberg-McQueen,et al.  Extensible Markup Language (XML) , 1997, World Wide Web J..

[62]  Bernhard Thalheim,et al.  Dependencies in relational databases , 1991, Teubner-Texte zur Mathematik.

[63]  Carmem S. Hara,et al.  Reasoning about nested functional dependencies , 1999, PODS '99.

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

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

[66]  Sven Hartmann,et al.  Unlocking Keys for XML Trees , 2007, ICDT.

[67]  Mark Levene,et al.  Axiomatisation of Functional Dependencies in Incomplete Relations , 1998, Theor. Comput. Sci..

[68]  Ronald Fagin,et al.  An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic , 1981, JACM.

[69]  Sven Hartmann,et al.  On Inferences ofWeak Multivalued Dependencies , 2009, Fundam. Informaticae.

[70]  Joachim Biskup.  On the complementation rule for multivalued dependencies in database relations , 2004, Acta Informatica.

[71]  Wenfei Fan,et al.  XML constraints: specification, analysis, and applications , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[72]  Wenfei Fan,et al.  Keys for XML , 2002, Comput. Networks.

[73]  Ronald Fagin,et al.  Functional Dependencies in a Relational Data Base and Propositional Logic , 1977, IBM J. Res. Dev..