Skip to main content

Normal Forms and Normalization

  • Reference work entry
  • First Online:

Definition

A normal form defines a condition over a set of data dependencies, or semantic constraints, that has been specified as part of a database schema. This condition is used to check whether the design of the database has some desirable properties (for example, the database does not store redundant information), and if this is not the case, then it can also be used to convert the poorly designed database into an equivalent well-designed one.

Historical Background

Information is one of the most - if not the most - valuable assets of a company. Therefore, organizations need tools to allow them to structure, query and analyze their data, and, in particular, they need tools providing simple and fast access to their information.

During the last 40 years, relational databases have become the most popular computer application for storing and analyzing information. The simplicity and elegance of the relational model, where information is stored just as tables, has largely contributed to...

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Abiteboul S, Hull R, Vianu V. Foundations of databases. Reading: Addison-Wesley; 1995.

    MATH  Google Scholar 

  2. Codd EF. Further normalization of the data base relational model. In: Data base systems. Englewood Cliffs: Prentice-Hall; 1972. p. 33–64.

    Google Scholar 

  3. Codd EF. Recent investigations in relational data base systems. In: Proceedings of the IFIP Congress, Information Processing 74; 1974. p. 1017–21.

    Google Scholar 

  4. Fagin R. Multivalued dependencies and a new normal form for relational databases. ACM Trans Database Syst. 1977;2(3):262–78.

    Article  MathSciNet  Google Scholar 

  5. Fagin R. Normal forms and relational database operators. In: Proceedings of the ACM SIGMOD International Conferences on Management of Data; 1979. p. 153–60.

    Google Scholar 

  6. Fagin R. A normal form for relational databases that is based on domians and keys. ACM Trans Database Syst. 1981;6(3):387–415.

    Article  MathSciNet  MATH  Google Scholar 

  7. Hull R. Relative information capacity of simple relational database schemata. SIAM J Comput. 1986;15(3):856–86.

    Article  MathSciNet  MATH  Google Scholar 

  8. Vincent M. A corrected 5NF definition for relational database design. Theor Comput Sci. 1997;185(2):379–91.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marcelo Arenas .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Arenas, M. (2018). Normal Forms and Normalization. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1237

Download citation

Publish with us

Policies and ethics