article

Free access

Multivalued dependencies and a new normal form for relational databases

Editor: David K. Hsiao Author:

Ronald FaginAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 2, Issue 3

Pages 262 - 278

https://doi.org/10.1145/320557.320571

Published: 01 September 1977 Publication History

PDF eReader

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

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

Digital Library

Google Scholar

[3]

BERNSTEIN, P.A. Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1, 4 (Dec. 1976), 277-298.

Digital Library

Google Scholar

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

Digital Library

Google Scholar

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

Digital Library

Google Scholar

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

Digital Library

Google Scholar

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

Digital Library

Google Scholar

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

Digital Library

Google Scholar

Cited By

View all

Polyakov O(2024)About One Linguistic ProblemDiscourse10.32603/2412-8562-2024-10-1-100-11310:1(100-113)Online publication date: 24-Feb-2024
https://doi.org/10.32603/2412-8562-2024-10-1-100-113
Bounhas MPrade H(2024)Revisiting analogical proportions and analogical inferenceInternational Journal of Approximate Reasoning10.1016/j.ijar.2024.109202171(109202)Online publication date: Aug-2024
https://doi.org/10.1016/j.ijar.2024.109202
Dutta SŚlęzak D(2024)Nature of decision valuations in elimination of redundant attributesInternational Journal of Approximate Reasoning10.1016/j.ijar.2023.109091165(109091)Online publication date: Feb-2024
https://doi.org/10.1016/j.ijar.2023.109091
Show More Cited By

Index Terms

Multivalued dependencies and a new normal form for relational databases
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Relational database model
    2. Query languages
      1. Relational database query languages

Recommendations

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

Comments

Information & Contributors

Information

Published In

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1977

Published in TODS Volume 2, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

641
Total Citations
View Citations
2,713
Total Downloads

Downloads (Last 12 months)252
Downloads (Last 6 weeks)32

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Polyakov O(2024)About One Linguistic ProblemDiscourse10.32603/2412-8562-2024-10-1-100-11310:1(100-113)Online publication date: 24-Feb-2024
https://doi.org/10.32603/2412-8562-2024-10-1-100-113
Bounhas MPrade H(2024)Revisiting analogical proportions and analogical inferenceInternational Journal of Approximate Reasoning10.1016/j.ijar.2024.109202171(109202)Online publication date: Aug-2024
https://doi.org/10.1016/j.ijar.2024.109202
Dutta SŚlęzak D(2024)Nature of decision valuations in elimination of redundant attributesInternational Journal of Approximate Reasoning10.1016/j.ijar.2023.109091165(109091)Online publication date: Feb-2024
https://doi.org/10.1016/j.ijar.2023.109091
(2024)BibliographyInformation Modeling and Relational Databases10.1016/B978-0-443-23790-4.09995-3(1029-1040)Online publication date: 2024
https://doi.org/10.1016/B978-0-443-23790-4.09995-3
Halpin TMorgan T(2024)Schema TransformationsInformation Modeling and Relational Databases10.1016/B978-0-443-23790-4.00018-9(681-771)Online publication date: 2024
https://doi.org/10.1016/B978-0-443-23790-4.00018-9
Aragón RMedina JRamírez-Poussa E(2024)Factorizing formal contexts from closures of necessity operatorsComputational and Applied Mathematics10.1007/s40314-024-02590-043:3Online publication date: 23-Mar-2024
https://doi.org/10.1007/s40314-024-02590-0
Skavantzos PLink S(2023)Normalizing Property GraphsProceedings of the VLDB Endowment10.14778/3611479.361150616:11(3031-3043)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611506
Zhang ZChen WLink S(2023)Composite Object Normal Forms: Parameterizing Boyce-Codd Normal Form by the Number of Minimal KeysProceedings of the ACM on Management of Data10.1145/35886931:1(1-25)Online publication date: 30-May-2023
https://dl.acm.org/doi/10.1145/3588693
Kenig BWeinberger NGeerts FNgo HSintos S(2023)Quantifying the Loss of Acyclic Join DependenciesProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588658(329-338)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3584372.3588658
Skavantzos PLeck UZhao KLink S(2023)Uniqueness Constraints for Object StoresJournal of Data and Information Quality10.1145/358175815:2(1-29)Online publication date: 19-Jan-2023
https://dl.acm.org/doi/10.1145/3581758
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

A normal form for relational databases that is based on domains and keys

Synthesizing third normal form relations from functional dependencies

Simple conditions for guaranteeing higher normal forms in relational databases

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations