Scribd
Upload
4 views2 pages

Understanding Database Normalization Techniques

Uploaded by

Mathu Ashi
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
4 views2 pages

Understanding Database Normalization Techniques

Uploaded by

Mathu Ashi
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

Normalization in DBMS (Detailed Notes)

Normalization is the process of organizing data in a database to reduce redundancy and improve
data integrity. It involves decomposing larger relations into smaller, well-structured relations while
preserving dependencies.

Benefits of Normalization: Eliminates data redundancy. Ensures data integrity. Simplifies


queries and updates. Saves storage space. Makes the database more flexible and efficient.

1NF (First Normal Form)


• Attributes must be atomic (indivisible).
• Removes repeating groups and multi-valued attributes.
• Example: Splitting multiple phone numbers into separate rows.

2NF (Second Normal Form)


• Must be in 1NF.
• Removes partial dependency.
• Every non-key attribute must depend on the whole primary key.
• Example: CourseName depending only on CourseID.

3NF (Third Normal Form)


• Must be in 2NF.
• Removes transitive dependency.
• Non-key attributes must depend only on the primary key.
• Example: DeptName depending on DeptID, which depends on StudentID.

BCNF (Boyce-Codd Normal Form)


• Stronger form of 3NF.
• For every dependency X → Y, X must be a candidate key.
• Removes anomalies from overlapping candidate keys.

4NF (Fourth Normal Form)


• Must be in BCNF.
• Removes multi-valued dependencies.
• Example: Student → Skills, Student → Hobbies stored together.

5NF (Fifth Normal Form / PJNF)


• Must be in 4NF.
• Removes join dependency.
• Ensures lossless decomposition into smaller relations without redundancy.

Comparison Table (1NF → 5NF)


Normal Form Key Condition Removes Example
1NF Atomic attributes Repeating groups Multiple phone numbers in one field
2NF No partial dependency Partial dependency CourseName depends only on CourseID
3NF No transitive dependency Transitive dependency DeptName depends on DeptID
BCNF Determinant is candidateAnomalies
key from overlapping keys Instructor → Course
4NF No multi-valued dependency Multi-valued dependency Student → Skills, Hobbies
5NF No join dependency Join dependency Supplier-Product-Location relations

You might also like