On the design of relational database schemata

The purpose of this paper is to present a new approach to the conceptual design of relational databases based on the complete relatability conditions (CRCs). It is shown that current database design methodology based upon the elimination of anomalies is not adequate. In contradistinction, the CRCs are shown to provide a powerful criticism for decomposition. A decomposition algorithm is presented which (1) permits decomposition of complex relations into simple, well-defined primitives, (2) preserves all the original information, and (3) minimizes redundancy. The paper gives a complete derivation of the CRCs, beginning with a unified treatment of functional and multivalued dependencies, and introduces the concept of elementary functional dependencies and multiple elementary multivalued dependencies. Admissibility of covers and validation of results are also discussed, and it is shown how these concepts may be used to improve the design of 3NF schemata. Finally, a convenient graphical representation is proposed, and several examples are described in detail to illustrate the method.

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

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

[3]  Philip A. Bernstein,et al.  Computational problems related to the design of normal form relational schemas , 1979, TODS.

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

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

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

[7]  Zvi Galil,et al.  An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database , 1982, JACM.

[8]  E. F. Codd,et al.  Further Normalization of the Data Base Relational Model , 1971, Research Report / RJ / IBM / San Jose, California.

[9]  Philip A. Bernstein,et al.  Comment on "Decomposition of a Data Base and the Theory of Boolean Switching Functions" , 1977, IBM J. Res. Dev..

[10]  ZanioloCarlo,et al.  On the design of relational database schemata , 1981 .

[11]  C. P. Wang,et al.  Segment Synthesis in Logical Data Base Design , 1975, IBM J. Res. Dev..

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

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

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

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

[16]  Ronald Fagin.  The Decomposition Versus Synthetic Approach to Relational Database Design , 1977, VLDB.

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

[18]  Carlo Zaniolo,et al.  A formal approach to the definition and the design of conceptual schemata for databased systems , 1982, TODS.

[19]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

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