,Module 4: Normalization
Downloaded from Ktunotes.in
,SYLLABUS
• Different anomalies in designing a database, The idea of
normalization, Functional dependency, Armstrong‘s
Axioms (proofs not required), Closures and their
computation, Equivalence of Functional Dependencies
(FD), Minimal Cover (proofs not required).
• First Normal Form (1NF), Second Normal Form (2NF),
Third Normal Form (3NF), Boysce Codd Normal Form
(BCNF),
• Lossless join and dependency preserving
decomposition, Algorithms for checking Lossless Join
(LJ) and Dependency Preserving (DP) properties.
Downloaded from Ktunotes.in
, Informal Design Guidelines for Relation
Schema
• Four informal guidelines that may be used as
measures to determine the quality of relation
schema design:
▫ Making sure that the semantics of the attributes is clear
in the schema
▫ Reducing the redundant information intuples
▫ Reducing the NULL values intuples
▫ Disallowing the possibility of generating spurioustuples
Downloaded from Ktunotes.in
Downloaded from Ktunotes.in
,SYLLABUS
• Different anomalies in designing a database, The idea of
normalization, Functional dependency, Armstrong‘s
Axioms (proofs not required), Closures and their
computation, Equivalence of Functional Dependencies
(FD), Minimal Cover (proofs not required).
• First Normal Form (1NF), Second Normal Form (2NF),
Third Normal Form (3NF), Boysce Codd Normal Form
(BCNF),
• Lossless join and dependency preserving
decomposition, Algorithms for checking Lossless Join
(LJ) and Dependency Preserving (DP) properties.
Downloaded from Ktunotes.in
, Informal Design Guidelines for Relation
Schema
• Four informal guidelines that may be used as
measures to determine the quality of relation
schema design:
▫ Making sure that the semantics of the attributes is clear
in the schema
▫ Reducing the redundant information intuples
▫ Reducing the NULL values intuples
▫ Disallowing the possibility of generating spurioustuples
Downloaded from Ktunotes.in
