AlgoPlus//structures / normalization
Read the theory

Normalization

Decompose a redundant table through the normal forms — 1NF to 3NF / BCNF.

Normal form
Tables
1
Legend
Good FD
Violating FD
Key column
AI Tutor Workspace
In a nutshell
Normalization is the step-by-step splitting of one cluttered table into several clean ones so that no fact is stored twice. Each level fixes a specific flaw: 1NF demands single-valued cells, 2NF removes columns that depend on only part of the key, 3NF removes columns that depend on the key only second-hand, and BCNF tightens that further. Every split is lossless — you can rejoin to the original — and the payoff is that update anomalies disappear.
Ready
Press play to begin the cinematic walkthrough.
Normalization removes redundancy by decomposing on functional dependencies: 2NF kills partial dependencies on a composite key, 3NF kills transitive dependencies. Each split is lossless, so no data is lost and update anomalies disappear.
Key terms
Go deeper in the lesson
Read the full theory, intuition & complexity for Normalization.