University of Salahaddin

College of Engineering
Software & Informatics Engineering Department

NORMALIZATION
ND
2 STAGE

Lecturer:
Hanan Kamal
 2

Objectives
• How normalization can be used when designing a
relational database.
• How to identify functional dependencies for a given
relation.
• How to identify the most commonly used normal forms,
namely First Normal Form (1NF), Second Normal Form
(2NF), and Third Normal Form (3NF).
 3

Purpose of Normalization
• Normalization is a technique for producing a
set of suitable relations that support the data
requirements of an enterprise.

• The benefits of using a database that has a

suitable set of relations is that the database
will be:
• easier for the user to access and maintain the
data;
• take up minimal storage space on the computer.
 4

Data Redundancy and Update

Anomalies
• Major aim of relational database design is to
group attributes into relations to minimize data
redundancy.
 5

Data Redundancy and Update

Anomalies
• Problems associated with data redundancy are
illustrated by comparing the Staff and Branch
relations with the StaffBranch relation.
 6

Data Redundancy and Update

Anomalies
 7

Data Redundancy and Update

Anomalies
• Relations that contain redundant information may
potentially suffer from update anomalies.

• Types of update anomalies include

• Insertion
• Deletion
• Modification
 8

Functional Dependencies
• Important concept associated with normalization.

• Functional dependency describes relationship between

attributes.

• For example, if A and B are attributes of relation R, B is

functionally dependent on A (denoted A  B), if each
value of A in R is associated with exactly one value of B in
R.
 9

Characteristics of Functional
Dependencies
• Property of the meaning or semantics of the attributes
in a relation.

• Diagrammatic representation.

• The determinant of a functional dependency refers to

the attribute or group of attributes on the left-hand side
of the arrow.
 10

Example Functional Dependency that

holds for all Time
• Consider the values shown in staffNo and sName
attributes of the Staff relation (see Slide 6).

• Based on sample data, the following functional

dependencies appear to hold.

staffNo → sName
sName → staffNo
 11

Example Functional Dependency that

holds for all Time
• However, the only functional dependency that remains
true for all possible values for the staffNo and sName
attributes of the Staff relation is:

staffNo → sName
 12

Characteristics of Functional
Dependencies
• Determinants should have the minimal
number of attributes necessary to maintain
the functional dependency with the
attribute(s) on the right hand-side.

• This requirement is called full functional

dependency.
 13

Characteristics of Functional
Dependencies
• Full functional dependency indicates that if
A and B are attributes of a relation, B is
fully functionally dependent on A, if B is
functionally dependent on A, but not on any
proper subset of A.
 14

Example Full Functional Dependency

• Exists in the Staff relation (see Slide 6).

staffNo, sName → branchNo

• True - each value of (staffNo, sName) is associated with a

single value of branchNo.

• However, branchNo is also functionally dependent on a

subset of (staffNo, sName), namely staffNo. Example
above is a partial dependency.
 15

The Process of Normalization

• Formal technique for analyzing a relation based on its
primary key and the functional dependencies between the
attributes of that relation.

• Often executed as a series of steps. Each step

corresponds to a specific normal form, which has known
properties.
 16

Identifying Functional Dependencies

• Identifying all functional dependencies
between a set of attributes is relatively simple
if the meaning of each attribute and the
relationships between the attributes are well
understood.

• This information should be provided by the

enterprise (discussions , documentation)

• The database designer can use (common

sense , experience) to provide the missing
information.
 17

Example - Identifying a set of functional

dependencies for the StaffBranch relation

• Examine semantics of attributes in

StaffBranch relation (see Slide 6). Assume
that position held and branch determine a
member of staff’s salary.
 18

Example - Identifying a set of functional

dependencies for the StaffBranch relation
• With sufficient information available, identify the functional
dependencies for the StaffBranch relation as:

staffNo → sName, position, salary, branchNo,

bAddress
branchNo → bAddress
bAddress → branchNo
branchNo, position → salary
bAddress, position → salary
 19

Example - Using sample data to

identify functional dependencies.
• Consider the data for attributes denoted A, B, C, D, and E
in the Sample relation (see next Slide ).

• Important to establish that sample data values shown in

relation are representative of all possible values that can
be held by attributes A, B, C, D, and E. Assume true
despite the relatively small amount of data shown in this
relation.
 20

Example - Using sample data to

identify functional dependencies.
 21

Example - Using sample data to

identify functional dependencies.
• Function dependencies between attributes A to E in the
Sample relation.

AC (fd1)
CA (fd2)
B D (fd3)
A, B  E (fd4)
(A, B) is identified as the primary key for this relation.
 22

Identifying the Primary Key for a

Relation using Functional
Dependencies
• Main purpose of identifying a set of functional
dependencies for a relation is to specify the set of integrity
constraints that must hold on a relation.

• An important integrity constraint to consider first is the

identification of candidate keys, one of which is selected
to be the primary key for the relation.
 23

Example - Identify Primary Key for

StaffBranch Relation
• StaffBranch relation has five functional dependencies (see
Slide 18).

• The determinants are staffNo, branchNo, bAddress,

(branchNo, position), and (bAddress, position).

• To identify all candidate key(s), identify the attribute (or

group of attributes) that uniquely identifies each tuple in
this relation.
 24

Example - Identifying Primary Key for

StaffBranch Relation
• All attributes that are not part of a candidate key should
be functionally dependent on the key.

• The only candidate key and therefore primary key for

StaffBranch relation, is staffNo, as all other attributes of
the relation are functionally dependent on staffNo.
 25

The Process of Normalization

• As normalization proceeds, the relations become
progressively more restricted (stronger) in format and also
less vulnerable to update anomalies.
The Process of Normalization

26
 27

Unnormalized Form (UNF)

• A table that contains one or more repeating
groups.

• To create an un normalized table

• Transform the data from the information source (e.g.
form) into table format with columns and rows.
28
 29

First Normal Form (1NF)

• A relation in which the intersection of each
row and column contains one and only one
value.

• Nominate an attribute or group of attributes

to act as the key for the un normalized
table.
UNF to 1NF
• Remove the repeating group by
• Entering appropriate data into the empty columns of
rows containing the repeating data (‘flattening’ the
table).

• Or by
• Placing the repeating data along with a copy of the
original key attribute(s) into a separate relation.

30
 31

1NF
 32

Second Normal Form (2NF)

• Based on the concept of full functional dependency.

• Full functional dependency indicates that if

• A and B are attributes of a relation,
• B is fully dependent on A if B is functionally dependent on A but not
on any proper subset of A.
 33

Second Normal Form (2NF)

• A relation that is in 1NF and every non-primary-key
attribute is fully functionally dependent on the primary key.
 34

1NF to 2NF
• Identify the primary key for the 1NF relation.

• Identify the functional dependencies in the relation.

• If partial dependencies exist on the primary key remove

them by placing them in a new relation along with a copy
of their determinant.
 35

2NF
 36

Third Normal Form (3NF)

• Based on the concept of transitive dependency.

• Transitive Dependency is 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 through B. (Provided that A is
not functionally dependent on B or C).
 37

Third Normal Form (3NF)

• A relation that is in 1NF and 2NF and in which no non-
primary-key attribute is transitively dependent on the
primary key.
 38

3NF
 39

The decomposition of the ClientRental

1NF relation into 3NF relations.
 40

2NF to 3NF
• Identify the primary key in the 2NF relation.

• Identify functional dependencies in the relation.

• If transitive dependencies exist on the primary key

remove them by placing them in a new relation along with
a copy of their dominant.
 41

General Definitions of 2NF and 3NF

• Second normal form (2NF)
• A relation that is in first normal form and every non-primary-
key attribute is fully functionally dependent on any candidate
key.

• 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 any
candidate key.
 42

Thank you for your attention

Questions????