Scribd
Upload
21 views4 pages

L10 - Normalization of Relations - 1NF - 2NF

The document discusses the normalization of relation schemas in database design, outlining the importance of normal forms to avoid certain problems. It details the progression of normal forms from first normal form (1NF) to Boyce-Codd normal form (BCNF), and introduces the concepts of functional dependencies, multivalued dependencies, and join dependencies. Additionally, it defines first normal form (1NF) and second normal form (2NF), emphasizing the conditions required for each.

Uploaded by

shinjanchaturvedi7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views4 pages

L10 - Normalization of Relations - 1NF - 2NF

The document discusses the normalization of relation schemas in database design, outlining the importance of normal forms to avoid certain problems. It details the progression of normal forms from first normal form (1NF) to Boyce-Codd normal form (BCNF), and introduces the concepts of functional dependencies, multivalued dependencies, and join dependencies. Additionally, it defines first normal form (1NF) and second normal form (2NF), emphasizing the conditions required for each.

Uploaded by

shinjanchaturvedi7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

1

Normalization of Relations
Given a relation schema, we need to decide whether it is a good design or whether we need to
decompose it into smaller relations. Such a decision must be guided by an understanding of what
problems, if any, arise from the current schema. To provide such guidance, several normal forms
have been proposed. If a relation schema is in one of these normal forms, we know that certain
kinds of problems cannot arise.

The normal forms based on FDs are first normal form (1NF), second normal form (2NF), third normal
form (3NF), and Boyce-Codd normal form (BCNF). These forms have increasingly restrictive
requirements: Every relation in BCNF is also in 3NF, every relation in 3NF is also in 2NF, and every
relation in 2NF is in 1NF.

All these normal forms (1NF, 2NF, 3NF, BCNF) are based on a single analytical tool: the functional
dependencies among the attributes of a relation. Later, a fourth normal form (4NF) and a fifth
normal form (5NF) were proposed, based on the concepts of multivalued dependencies and join
dependencies, respectively

Definition: The normal form of a relation refers to the highest normal form condition that it
meets, and hence indicates the degree to which it has been normalized.

Normal Forms Page 1


2

First Normal Form

A relation schema R is in first normal form (1NF) if the domains of all


attributes of R are atomic.

Normal Forms Page 1


3

Second normal form (2NF)


Prime attribute: an attribute that is part of any candidate key will be considered as prime.

Second normal form (2NF) is based on the concept of full functional dependency.

Definition: A relation schema R is in second normal form (2NF) if every nonprime


attribute A in R is not partially dependent on any candidate key of R.
This definition can be restated as follows: A relation schema R is in 2NF if every
nonprime attribute A in R is fully functionally dependent on every candidate key of R.

Normal Forms Page 1


Normal Forms Page 2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy