Scribd
Upload
10 views7 pages

Higher Order NFs

The document discusses higher order normal forms in database normalization, specifically focusing on Fourth Normal Form (4NF) and Fifth Normal Form (5NF). It explains that a relation is in 4NF if it is in Boyce Codd normal form and has no multi-valued dependencies, providing examples of how to decompose tables to achieve this. Additionally, it describes 5NF as a state where a relation is in 4NF and has no join dependencies, emphasizing the importance of avoiding redundancy through decomposition.

Uploaded by

harshithanitha2002
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
10 views7 pages

Higher Order NFs

The document discusses higher order normal forms in database normalization, specifically focusing on Fourth Normal Form (4NF) and Fifth Normal Form (5NF). It explains that a relation is in 4NF if it is in Boyce Codd normal form and has no multi-valued dependencies, providing examples of how to decompose tables to achieve this. Additionally, it describes 5NF as a state where a relation is in 4NF and has no join dependencies, emphasizing the importance of avoiding redundancy through decomposition.

Uploaded by

harshithanitha2002
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/ 7

HIGHER ORDER NORMAL FORMS

Fourth normal form (4NF)


A relation will be in 4NF if it is in Boyce Codd normal form
and has no multi-valued dependency.
For a dependency A → B, if for a single value of A, multiple
values of B exists, then the relation will be a multi-valued
dependency.
Example
STUDENT

STU_ID COURSE HOBBY


21 Computer Dancing
21 Math Singing
34 Chemistry Dancing
74 Biology Cricket
59 Physics Hockey
The given STUDENT table is in 3NF, but the COURSE and
HOBBY are two independent entity. Hence, there is no
relationship between COURSE and HOBBY.

In the STUDENT relation, a student with STU_ID, 21


contains two courses, Computer and Math and two hobbies,
Dancing and Singing. So there is a Multi-valued dependency
on STU_ID, which leads to unnecessary repetition of data.

pg. 1
HIGHER ORDER NORMAL FORMS

So to make the above table into 4NF, we can decompose it


into two tables
STUDENT_COURSE

STU_ID COURSE
21 Computer
21 Math
34 Chemistry
74 Biology
59 Physics

STUDENT_HOBBY

STU_ID HOBBY
21 Dancing
21 Singing
34 Dancing
74 Cricket
59 Hockey

pg. 2
HIGHER ORDER NORMAL FORMS

Fifth normal form (5NF)


A relation is in 5NF if it is in 4NF and not contains any join
dependency and joining should be lossless.
5NF is satisfied when all the tables are broken into as many
tables as possible in order to avoid redundancy.
5NF is also known as Project-join normal form (PJ/NF).
Example
SUBJECT LECTURER SEMESTER
Computer Anshika Semester 1
Computer John Semester 1
Math John Semester 1
Math Akash Semester 2
Chemistry Praveen Semester 1
In the above table, John takes both Computer and Math class
for Semester 1 but he doesn't take Math class for Semester 2.
In this case, combination of all these fields required to
identify a valid data.

Suppose we add a new Semester as Semester 3 but do not


know about the subject and who will be taking that subject so
we leave Lecturer and Subject as NULL. But all three
columns together acts as a primary key, so we can't leave
other two columns blank.

pg. 3
HIGHER ORDER NORMAL FORMS

So to make the above table into 5NF, we can decompose it


into three relations P1, P2 & P3:

P1
SEMESTER SUBJECT
Semester 1 Computer
Semester 1 Math
Semester 1 Chemistry
Semester 2 Math

P2
SUBJECT LECTURER
Computer Anshika
Computer John
Math John
Math Akash
Chemistry Praveen

P3
SEMSTER LECTURER
Semester 1 Anshika
Semester 1 John

pg. 4
HIGHER ORDER NORMAL FORMS

Semester 1 John
Semester 2 Akash
Semester 1 Praveen

pg. 5
HIGHER ORDER NORMAL FORMS

ASSIGNMENT
UNIT 01
Explain DBMS Architecture.
Explain DBMS Environment.
Briefly explain DBMS Interfaces.

UNIT 03
5marks
What is Relational Algebra? Explain Set Operations.
Define Anomaly? Explain types of Anomalies.
What is Functional Dependency? Explain the types of
Functional Dependency.
What is View? Explain the creation of view with an example.

10 Marks
Explain Unary and Binary Relational operations.
Define Normalization. Explain all the types of Normal forms
with an example.
Define SQL. Explain insert, Delete and update statements in
SQL.

pg. 6
HIGHER ORDER NORMAL FORMS

pg. 7

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