Ronald Fagin
Abstract
A new type of dependency, which includes the well-known functional dependencies as a special case, is defined for relational databases. By using this concept, a new (“fourth”) normal form for relation schemata is defined. This fourth normal form is strictly stronger than Codd's “improved third normal form” (or “Boyce-Codd normal form”). It is shown that every relation schema can be decomposed into a family of relation schemata in fourth normal form without loss of information (that is, the original relation can be obtained from the new relations by taking joins).
- 1 ARMSTRONG, W.W. Dependency structures of database relationships. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 580-583.Google Scholar
- 2 BEERI, C., FA.GIN, R., AND I~OWARD, J.H. A complete axiomatization for functional and multivalued dependencies in database relations. Proc. ACM SIGMOD Conf., D.C.P. Smith, Ed., Toronto, Canada, August 1977, pp. 47-61. Google ScholarDigital Library
- 3 BERNSTEIN, P.A. Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1, 4 (Dec. 1976), 277-298. Google ScholarDigital Library
- 4 BERNSTEIN, P.A., SWENSON, J.R., AND TSICHRITZIS, D.C. A unified approach to functional dependencies and relatio'ns. Proc. ACM SIGMOD Conf., W.F. King, Ed., San Jose, Calif., May 1975, pp. 237-245. Google ScholarDigital Library
- 5 CADIOV, J.-M. On semantic issues in the relational model of data. Proc. Int. Symp. on Math. Foundations of Comptr. Sci., Gdafisk, Poland, Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, Sept. 1975.Google Scholar
- 6 CODD, E.F. Further normalization of the data base relational model. In Courant Computer Science Symposium 6: Data Base Systems, Prentice-Hall, Englewood Cliffs, N.J., May 1971, pp. 65-98.Google Scholar
- 7 CODD, E.F. Recent investigations in relational data base systems. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 1017-1021.Google Scholar
- 8 DELOBEL, C., AND CASEY, R.G. Decomposition of a data base and the theory of Boolean switching functions. IBM J. Res. and Develop. 17, 5 (Sept. 1973), 374-386.Google ScholarDigital Library
- 9 DELOBEL, C., AND L~ONARD, M. The decomposition process in a relational model. Proc. int. Workshop on Data Structure Models for Information Systems, Presses U. de Namur, Namur, Belgium, May 1974, pp. 57-80.Google Scholar
- 10 FAGIN, R. Functional dependencies in a relational database and propositional logic. IBM J. Res. and Develop. 21, 6 (Nov. 1977).Google ScholarDigital Library
- 11 RISSANEN, J.J. Independent components of relations. Res. Rep. RJ1899, IBM Res. Lab., San Jose, Calif., Jan. 1977.Google Scholar
- 12 SCHMID, H.A., AND SWENSON, J.l~. On the semantics of the relational data model. Proc. ACM SIGMOD Conf., W.F. King, Ed., San Jose, Calif., May 1975, pp. 211-223. Google ScholarDigital Library
- 13 ZANIOLO, C. Analysis and design of relational schemata for database systems. Ph.D. Diss., Tech. Rep. UCLA-ENG-7669, U. of California, Los Angeles, Calif., July 1976. Google ScholarDigital Library
Index Terms
- Multivalued dependencies and a new normal form for relational databases
Recommendations
Simple conditions for guaranteeing higher normal forms in relational databases
A key is simple if it consists of a single attribute. It is shown that if a relation schema is in third normal form and every key is simple, then it is in projection-join normal form (sometimes called fifth normal form), the ultimate normal form with ...
A normal form for relational databases that is based on domains and keys
A new normal form for relational databases, called domain-key normal form (DK/NF), is defined. Also, formal definitions of insertion anomaly and deletion anomaly are presented. It is shown that a schema is in DK/NF if and only if it has no insertion or ...
Synthesizing third normal form relations from functional dependencies
It has been proposed that the description of a relational database can be formulated as a set of functional relationships among database attributes. These functional relationships can then be used to synthesize algorithmically a relational scheme. It is ...
Comments