The Boyce-Codd-Heath Normal Form for SQL

In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd normal form, guarantees the elimination of data redundancy in terms of functional dependencies. For efficient means of data processing the industry standard SQL permits partial data and duplicate rows of data to occur in database systems. Consequently, the combined class of uniqueness constraints and functional dependencies is more expressive than the class of functional dependencies itself. Hence, the Boyce-Codd-Heath normal form is not suitable for SQL databases. We characterize the associated implication problem of the combined class in the presence of NOT NULL constraints axiomatically, algorithmically and logically. Based on these results we are able to establish a suitable normal form for SQL.

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

[2]  Carlo Zaniolo,et al.  Database relations with null values , 1982, J. Comput. Syst. Sci..

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

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

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

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

[7]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[8]  Sebastian Link,et al.  Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics , 2010, Inf. Process. Lett..

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

[10]  Paolo Atzeni,et al.  Functional Dependencies and Constraints on Null Values in Database Relations , 1986, Inf. Control..

[11]  E. V. Ravve,et al.  Dependency Preserving Refinements and the Fundamental Problem of Database Design , 1998, Data Knowl. Eng..

[12]  I. J. Heath.  Unacceptable file operations in a relational data base , 1971, SIGFIDET '71.

[13]  Henning Köhler,et al.  Finding Faithful Boyce-Codd Normal Form Decompositions , 2006, AAIM.

[14]  Marcelo Arenas,et al.  An information-theoretic approach to normal forms for relational and XML data , 2003, PODS.

[15]  Ernst-Rüdiger Olderog,et al.  Transformational design of real-time systems Part I: From requirements to program specifications , 1999, Acta Informatica.

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

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

[18]  Jim Diederich,et al.  New methods and fast algorithms for database normalization , 1988, TODS.

[19]  Chengfei Liu,et al.  Strong functional dependencies and their application to normal forms in XML , 2004, TODS.

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

[21]  C. J. Date.  A Guide to the SQL Standard , 1987 .

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

[23]  Costas S. Iliopoulos,et al.  A New Efficient Algorithm for Computing the Longest Common Subsequence , 2007, AAIM.

[24]  Joachim Biskup,et al.  Synthesizing independent database schemas , 1979, SIGMOD '79.

[25]  E. F. Codd,et al.  Recent Investigations in Relational Data Base Systems , 1974, ACM Pacific.