ACM Home Page
Please provide us with feedback. Feedback
Multivalued dependencies and a new normal form for relational databases
Full text PdfPdf (1.29 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 2 ,  Issue 3  (September 1977) table of contents
Pages: 262 - 278  
Year of Publication: 1977
ISSN:0362-5915
Author
Ronald Fagin  IBM Research Lab, San Jose, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 105,   Citation Count: 177
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/320557.320571
What is a DOI?

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).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ARMSTRONG, W.W. Dependency structures of database relationships. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 580-583.
2
3
4
 
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.
 
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.
 
7
CODD, E.F. Recent investigations in relational data base systems. Information Processing 74, North-Holland Pub. Co., Amsterdam, 1974, pp. 1017-1021.
 
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.
 
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.
 
10
FAGIN, R. Functional dependencies in a relational database and propositional logic. IBM J. Res. and Develop. 21, 6 (Nov. 1977).
 
11
RISSANEN, J.J. Independent components of relations. Res. Rep. RJ1899, IBM Res. Lab., San Jose, Calif., Jan. 1977.
12
 
13

CITED BY  177