Reflections on Boyce-Codd Normal Form

1. Introduction

[1]  William Kent,et al.  Data and Reality , 1978 .

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

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

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

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

[6]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

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

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

[9]  Sylvia L. Osborn.  Testing for Existence of a Covering Boyce-Codd normal Form , 1979, Inf. Process. Lett..

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

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

[12]  Paolo Atzeni,et al.  Assumptions in relational database theory , 1982, PODS '82.

[13]  Douglas Stott Parker,et al.  Algorithmic Applications For A New Result On Multivalued Dependencies , 1979, Fifth International Conference on Very Large Data Bases, 1979..

[14]  Edward Sciore.  Improving database schemes by adding attributes , 1983, PODS '83.

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