A normal form for preventing redundant tuples in relational databases

We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and join dependencies. ETNF lies strictly between fourth normal form and fifth normal form (5NF, also known as projection-join normal form). We show that ETNF, although strictly weaker than 5NF, is exactly as effective as 5NF in eliminating redundancy of tuples. Our definition of ETNF is semantic, in that it is defined in terms of tuple redundancy. We give a syntactic characterization of ETNF, which says that a relation schema is in ETNF if and only if it is in Boyce-Codd normal form and some component of every explicitly declared join dependency of the schema is a superkey.

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

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

[3]  Ronald Fagin,et al.  A normal form for relational databases that is based on domains and keys , 1981, TODS.

[4]  E. F. Codd,et al.  Interactive support for non-programmers: The relational and network approaches , 1975, SIGFIDET '74.

[5]  Millist W. Vincent.  A Corrected 5NF Definition for Relational Database Design , 1997, Theor. Comput. Sci..

[6]  Ragnar Normann.  Minimal Lossless Decompositions and Some Normal Forms Between 4NF and PJ/NF , 1998, Inf. Syst..

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

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

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

[10]  Mukesh K. Mohania,et al.  On the equivalence between FDs in XML and FDs in relations , 2007, Acta Informatica.

[11]  Millist W. Vincent,et al.  Redundancy Elimination and a New Normal Form for Relational Database Design , 1995, Semantics in Databases.

[12]  Ronald Fagin,et al.  Simple conditions for guaranteeing higher normal forms in relational databases , 1992, TODS.

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

[14]  Bernhard Thalheim.  Deductive normal forms of relations , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

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

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

[17]  Stéphane Bressan,et al.  Introduction to Database Systems , 2005 .

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