Normalization is a database design technique which

organizes tables in a manner That reduce redundancy

and dependency of data.

It divides large table into small tables and link them

using relations.

1 3
 Normalization
◦ Aims to reduce data redundancy
◦ Redundancy is expressed in terms of dependencies
◦ Normal forms are defined that do not have certain types
of dependency

1 4
 Redundancy causes several
anomalies: insert , delete and
update

1 5
Insert Anomaly:We are not able to insert “valid” value

Student

sNumber sName pNumber pName

s1 ali p1 aslam
s2 akram p1 akber

Note:We cannot insert a professor who has no students.

1 6
 .
Delete Anomaly: We are not able to perform a delete without losing
some
“valid” information.
Student

sNumber sName pNumber pName

s1 ali p1 aslam
s2 akram p1 akber

Note:We cannot delete a student that is the only student of a professor.

.

1 7
 Update Anomaly

Update Anomaly: To update a value, we have to update multiple

rows.
Student

sNumber sName pNumber pName

s1 ali p1 aslam
s2 akram p1 akber

Note:To update the name of professor , we have to update the

multiple tuples
.

1 8
Normalization works through a series of stages called
normal forms:
First normal form (1NF)
Second normal form (2NF)
Third normal form (3NF)
Boyce-Codd normal form(BCNF)
Fourth normal form (4NF)
Fifth normal form (5NF)

1 9
1 10
 Functional Dependencies

Functional dependency describes the relationship

between
attributes in a relation.
For example, if A and B are attributes of relation R, and B is
functionally dependent on A ( denoted A B), if each value of
A is associated with exactly one value of B. ( A and B may each
consist of one or more attributes.)
B is functionally
A B
dependent on A
Determinant
 First Normal Form

is a relation in which the intersection of each

row and column contains one and only one
value.

The term first normal form (1NF) describes the

tabular format in which:
All the key attributes are defined.
There are no repeating groups in the table.
All attributes are dependent on the primary
key.

1 12
 First Normal Form (1NF)
Unnormalized form (UNF)
A table that contains one or more repeating groups.

ClientN cNam propertyN rentStar rentFinis ren ownerN oNam

pAddress
o e o t h t o e
6 lawrence Tina
1-Jul-00 31-Aug-01 350 CO40 Murphy
PG4 St,Glasgow
John
CR76
kay Tony
PG16 5 Novar Dr, Shaw
1-Sep-02 1-Sep-02 450 CO93
Glasgow

6 lawrence Tina
PG4 1-Sep-99 10-Jun-00 350 CO40 Murphy
St,Glasgow

Tony
Aline 2 Manor Rd,
CR56 PG36 10-Oct-00 1-Dec-01 370 CO93 Shaw
Stewart Glasgow

Tony
5 Novar Dr, Shaw
PG16 1-Nov-02 1-Aug-03 450 CO93
Glasgow
 1NF ClientRental relation
we remove the repeating group by entering the appropriate
client data into each row.

ClientRental ( clientNo, propertyNo, cName, pAddress, rentStart, rentFinish

rent, ownerNo, oName)

ClientN propertyN pAddres rentStar rentFinis ren ownerN oNam

cName
o o s t h t o e
John 6 lawrence Tina
CR76 PG4 1-Jul-00 31-Aug-01 350 CO40
Kay St,Glasgow Murphy
John 5 Novar Dr, Tony
CR76 PG16 1-Sep-02 1-Sep-02 450 CO93
Kay Glasgow Shaw
Aline 6 lawrence Tina
CR56 PG4 1-Sep-99 10-Jun-00 350 CO40 Murphy
Stewart St,Glasgow
2 Manor Tony
Aline
CR56 PG36 Rd, 10-Oct-00 1-Dec-01 370 CO93 Shaw
Stewart
Glasgow
Tony
Aline 5 Novar Dr,
CR56 PG16 1-Nov-02 1-Aug-03 450 CO93 Shaw
Stewart Glasgow
Second Normal Form (2NF)

Second normal form (2NF) is a relation that is in first

normal form and every non-primary-key attribute is
fully functionally dependent on the primary key.

The normalization of 1NF relations to 2NF involves

the
removal of partial dependencies.
2NF ClientRental relation
After removing the partial dependencies , the creation of the three new
Relations called client ,Rental,and property owner

Client Rental
ClientNo propertyNo rentStart rentFinish
ClientNo cName CR76 PG4 1-Jul-00 31-Aug-01
CR76 John Kay
CR76 PG16 1-Sep-02 1-Sep-02
CR56 Aline Stewart
CR56 PG4 1-Sep-99 10-Jun-00
CR56 PG36 10-Oct-00 1-Dec-01
CR56 PG16 1-Nov-02 1-Aug-03
PropertyOwner

propertyNo pAddress rent ownerNo oName

PG4 6 lawrence St,Glasgow 350 CO40 Tina Murphy
PG16 5 Novar Dr, Glasgow 450 CO93 Tony Shaw

PG36 2 Manor Rd, Glasgow 370 CO93 Tony Shaw

Third Normal Form (3NF)

Transitive dependency
A condition where A, B, and C are attributes of a relation
such that if A  B and B  C, then C is transitively
dependent on A via B (provided that A is not functionally
dependent on B or C).
 .
Third normal form (3NF)
A relation that is in first and second normal form, and in which
no non-primary-key attribute is transitively dependent on the
primary key.
 3NF ClientRental relation

Rental
Client
ClientNo propertyNo rentStart rentFinish
CR76 PG4 1-Jul-00 31-Aug-01
ClientNo cName
CR76 PG16 1-Sep-02 1-Sep-02
CR76 John Kay
CR56 PG4 1-Sep-99 10-Jun-00
CR56 Aline Stewart
CR56 PG36 10-Oct-00 1-Dec-01
CR56 PG16 1-Nov-02 1-Aug-03

PropertyOwner Owner

propertyNo pAddress rent ownerNo ownerNo oName

PG4 6 lawrence St,Glasgow 350 CO40 CO40 Tina Murphy

PG16 5 Novar Dr, Glasgow 450 CO93 CO93 Tony Shaw

PG36 2 Manor Rd, Glasgow 370 CO93

 .
Boyce-Codd normal form (BCNF)
A relation is in BCNF, if and only if, every
determinant is a candidate key.

The difference between 3NF and BCNF is that for a functional

dependency A→B, 3NF allows this dependency in a relation if B is a
primary-key attribute and A is not a candidate key, whereas BCNF insists
that for this dependency to remain in a relation, A must be a candidate
key. Therefore, Boyce–Codd Normal Form is a stronger form of 3NF,
such that every relation in BCNF is also in 3NF. However, a relation in
3NF is not necessarily in BCNF.

1 20
Fourth Normal Form (4NF)
A relation that is in Boyce-Codd normal form
and contains no nontrivial multi-valued
dependencies.

Multi-valued dependency (MVD) represents a

dependency between attributes (for example, A,
B and C) in a relation, such that for each value
of A there is a set of values for B and a set of value
for C. However, the set of values for B and C are
independent of each other.
 .Fifth normal form (5NF)

A relation that has no join dependency

Join dependency
Describes a type of dependency. For example, for a
relation R with subsets of the attributes of R denoted as
A, B, …, Z, a
relation R satisfies a join dependency if, and only if,
every legal value of R is equal to the join of its
projections on A, B, …, Z.

1 22
1 24