First Normal Form (1NF): Eliminate repeating groups, ensure atomic values, each cell contains single value

Second Normal Form (2NF): Eliminate partial dependencies, non-key attributes depend on entire primary key

Third Normal Form (3NF): Eliminate transitive dependencies, non-key attributes depend only on primary key

Boyce-Codd Normal Form (BCNF): Stricter 3NF, every determinant must be candidate key

Functional dependencies: Understanding X → Y relationships, determinants, candidate keys

Update anomalies: Insertion anomalies (cannot insert without unrelated data), deletion anomalies (lose data unintentionally), update anomalies (must update multiple rows)

Normalization process: Step-by-step transformation from unnormalized to BCNF, identifying dependencies

Trade-offs: Normalization reduces redundancy but increases joins, balance based on read vs write workload

First Normal Form (1NF): Eliminate repeating groups, ensure atomic values, each cell contains single value

Second Normal Form (2NF): Eliminate partial dependencies, non-key attributes depend on entire primary key

Third Normal Form (3NF): Eliminate transitive dependencies, non-key attributes depend only on primary key

Boyce-Codd Normal Form (BCNF): Stricter 3NF, every determinant must be candidate key

Functional dependencies: Understanding X → Y relationships, determinants, candidate keys

Update anomalies: Insertion anomalies (cannot insert without unrelated data), deletion anomalies (lose data unintentionally), update anomalies (must update multiple rows)

Normalization process: Step-by-step transformation from unnormalized to BCNF, identifying dependencies

Trade-offs: Normalization reduces redundancy but increases joins, balance based on read vs write workload