Scribd
Upload
4 views

Normalization

Uploaded by

aryanjadhav400
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
4 views

Normalization

Uploaded by

aryanjadhav400
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Normalization

CODD’s Rule
NORMALIZATION
• It is a database design technique that organizes tables in a manner that reduces redundancy and dependency of
data.
• Normalization divides larger tables into smaller tables and links them using relationships. The purpose of
Normalization is to eliminate redundant data and ensure data is stored logically.

Objective of Normalization:
“to create relations where every dependency is on the key, the whole key, and not the partial key”.

Types of Normal Forms:


1NF, 2NF, 3NF, and BCNF(Boyce-Codd)

Also,
any relation that is in BCNF, is in 3NF
any relation in 3NF is in 2NF
and any relation in 2NF is in 1NF
Functional Dependencies
We say an attribute, B, has a functional dependency on another attribute, A, if for any two records, which have
the same value for A, then the values for B in these two records must be the same. We illustrate this as:
AB
Example:
Suppose we keep track of employee email addresses, and we only track one email address for each employee.
Suppose each employee is identified by their unique employee number.
We say there is a functional dependency of email address on employee number:
employee number  email address
Transitive dependency

Transitive dependency Consider attributes A, B, and C, and where


A  B and B  C
Functional dependencies are transitive, which means that we also have the functional dependency
AC
We say that C is transitively dependent on A through B.
First Normal Form
• We say a relation is in 1NF if all values stored in the relation are single-valued and atomic.
1NF places restrictions on the structure of relations.
• Values must be simple.
Second Normal Form
• A relation is in 2NF if it is in 1NF, and every non-key attribute is fully dependent on each candidate key.
(That is, we don’t have any partial functional dependency.)
• 2NF involve the concepts of key and non-key attributes.
• A key attribute is any attribute that is part of a key; any attribute that is not a key attribute, is a non-key
attribute.
• A relation in 2NF will not have any partial dependencies
Third Normal Form
• A relation is in 3NF if the relation is in 1NF and all determinants of non-key attributes are candidate keys
That is, for any functional dependency:
XY
where Y is a non-key attribute (or a set of non-key attributes), X is a candidate key.

• A relation in 3NF will not have any transitive dependencies(X  Y, YZ so XZ) of non-key attribute on a
candidate key through another non-key attribute.

You might also like