Scribd
Upload
3 views2 pages

DBMS Normalization Notes

Normalization in DBMS is a process aimed at minimizing data redundancy and avoiding anomalies by organizing data into tables according to normal forms. Key concepts include functional dependency, non-loss decomposition, and various normal forms (1NF, 2NF, 3NF, BCNF, 4NF, 5NF) that address different types of dependencies. The ultimate goal is to improve data integrity and ensure efficient database design.

Uploaded by

shantikagouda215
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
3 views2 pages

DBMS Normalization Notes

Normalization in DBMS is a process aimed at minimizing data redundancy and avoiding anomalies by organizing data into tables according to normal forms. Key concepts include functional dependency, non-loss decomposition, and various normal forms (1NF, 2NF, 3NF, BCNF, 4NF, 5NF) that address different types of dependencies. The ultimate goal is to improve data integrity and ensure efficient database design.

Uploaded by

shantikagouda215
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 – Assignment Notes

1. Introduction to Normalization
Normalization is a systematic process in database design used to minimize data redundancy and
avoid anomalies. It organizes data into tables based on rules called normal forms.

Objectives:
• Reduce redundancy
• Avoid anomalies
• Improve data integrity

2. Functional Dependency
A functional dependency is a relationship between attributes in a relation.
X → Y means Y depends on X.

3. Non-Loss Decomposition
A decomposition is lossless if the original relation can be reconstructed without losing data.

4. Dependency Preservation
A decomposition is dependency preserving if all dependencies can be enforced without joining
tables.

5. First Normal Form (1NF)


• Atomic values only
• No repeating groups

6. Second Normal Form (2NF)


• In 1NF
• No partial dependency

7. Third Normal Form (3NF)


• In 2NF
• No transitive dependency

8. BCNF
For every FD X → Y, X must be a super key.

9. Higher Normal Forms


Deals with multivalued and join dependencies.

10. Multivalued Dependency


X →→ Y means Y depends independently on X.

11. Fourth Normal Form (4NF)


• In BCNF
• No non-trivial MVDs

12. Join Dependency


Relation can be reconstructed by joining smaller relations.

13. Fifth Normal Form (5NF)


• In 4NF
• All join dependencies implied by keys

End of Notes

You might also like