Normalization: design around dependencies
Organize relational tables to reduce repeated facts and avoid update, insertion and deletion anomalies.
Identify candidate keys and functional dependencies before deciding which table decomposition is valid.
A non-trivial dependency X → A satisfies 3NF when X is a superkey or A belongs to a candidate key.
Aim for a lossless join and preserve useful dependencies. Normalization does not automatically make every query faster.
Why can repeating a department name in many student rows cause trouble?
Reveal answer / उत्तर देखें
An update may change only some rows, leaving inconsistent department names. Separate facts by their dependencies.