SUBJECT – DBMS
TOPIC – FIFTH NORMAL FORM(5NF)
Sanjana
23211a0539
LEVELS OF
NORMALIZATION
• Levels of normalization based on
the amount of redundancy in
the database.
• Various levels of normalization are:
1. First Normal Form (1NF)
2. Second Normal Form (2NF)
3. Third Normal Form (3NF)
4. Boyce-Codd Normal Form (BCNF)
5. Fourth Normal Form (4NF)
6. Fifth Normal Form (5NF)
Redundanc
y
Number
of
Tables
Complexit
y
Most databases should be 3NF or BCNF in order to avoid the
database anomalies.
FIFTH NORMAL
FORM(5NF)
 A table is in the 5NF if it’s in 4NF and if for all
join
dependency of (𝑅1, 𝑅2, 𝑅3,…….., 𝑅𝑚) in R ,every
Ri is a super key for R.
 A table is in the 5NF if it”s in 4NF and if it can’t have
a
loseless decomposition in to any number of smaller
tables.
 It’s also known as Project-join normal form(PJ/NF).
 Fifth normal form is satisfied when all tables are broken
into as many tables as possible in order to avoid
redundancy. Once it is in fifth normal form it cannot
be broken into smaller relations without changing
the facts or the
meaning.
 Example
1
Agent Company Product
Suneet ABC Nut
Raj ABC Bolt
Raj ABC Nut
Suneet CDE Bolt
Suneet ABC bolt
• The table is in 4NF because it contains no multi-
valued dependency.
• Suppose that table is decomposed into it’s three
relations P1,P2 & P3.
Agent Company
Suneet ABC
Suneet CDE
Raj ABC
Example
1
 P
1 Agent Product
Suneet Nut
Suneet Bolt
Raj Bolt
Raj Nut
 P
2
Company Product
ABC Nut
ABC Bolt
CDE Bolt
 P
3
• From above tables or relations if we perform natural
join between any of two above relations i.e P1⋈P2 ,
P2⋈P3
or P1⋈P3 then extra rows are added so
this decomposition is called lossy
decomposition.
• But if we perform natural join between the above
three relation then no extra rows are added so this
decomposition is called loseless decomoposition.
• So, above three tables P1,P2 and P3 are in 5NF.
THANK
YOU

539_5th normal form539_5th normal form.pptx

  • 1.
    SUBJECT – DBMS TOPIC– FIFTH NORMAL FORM(5NF) Sanjana 23211a0539
  • 2.
    LEVELS OF NORMALIZATION • Levelsof normalization based on the amount of redundancy in the database. • Various levels of normalization are: 1. First Normal Form (1NF) 2. Second Normal Form (2NF) 3. Third Normal Form (3NF) 4. Boyce-Codd Normal Form (BCNF) 5. Fourth Normal Form (4NF) 6. Fifth Normal Form (5NF) Redundanc y Number of Tables Complexit y Most databases should be 3NF or BCNF in order to avoid the database anomalies.
  • 3.
    FIFTH NORMAL FORM(5NF)  Atable is in the 5NF if it’s in 4NF and if for all join dependency of (𝑅1, 𝑅2, 𝑅3,…….., 𝑅𝑚) in R ,every Ri is a super key for R.  A table is in the 5NF if it”s in 4NF and if it can’t have a loseless decomposition in to any number of smaller tables.  It’s also known as Project-join normal form(PJ/NF).  Fifth normal form is satisfied when all tables are broken into as many tables as possible in order to avoid redundancy. Once it is in fifth normal form it cannot be broken into smaller relations without changing the facts or the meaning.
  • 4.
     Example 1 Agent CompanyProduct Suneet ABC Nut Raj ABC Bolt Raj ABC Nut Suneet CDE Bolt Suneet ABC bolt • The table is in 4NF because it contains no multi- valued dependency. • Suppose that table is decomposed into it’s three relations P1,P2 & P3.
  • 5.
    Agent Company Suneet ABC SuneetCDE Raj ABC Example 1  P 1 Agent Product Suneet Nut Suneet Bolt Raj Bolt Raj Nut  P 2 Company Product ABC Nut ABC Bolt CDE Bolt  P 3
  • 6.
    • From abovetables or relations if we perform natural join between any of two above relations i.e P1⋈P2 , P2⋈P3 or P1⋈P3 then extra rows are added so this decomposition is called lossy decomposition. • But if we perform natural join between the above three relation then no extra rows are added so this decomposition is called loseless decomoposition. • So, above three tables P1,P2 and P3 are in 5NF.
  • 7.