Normalization is the process of organizing the columns and tables of a relational database so that each fact is stored in exactly one place. It is driven by functional dependencies — statements of the form "if you know the value of A, you know the value of B" — and it proceeds through a series of normal forms: 1NF removes repeating groups and non-atomic values, 2NF removes partial dependencies on part of a composite key, 3NF removes transitive dependencies on non-key attributes, and BCNF tightens 3NF by requiring that every determinant be a candidate key.
In this module, normalization is the baseline you will later deliberately depart from. Before you can argue that denormalizing a schema is worth the write overhead and storage cost, you need to be able to say precisely what normal form a table is in and which anomalies — insertion, update, and deletion — you are accepting when you relax it. That is why this topic revisits 1NF through BCNF and the dependency theory underneath them rather than treating them as rules to memorize.
As you watch, keep a worked example of your own in front of you. For each table discussed, try to write down the candidate keys first, then list the functional dependencies, then check each one against the definition of the normal form being explained. Pay particular attention to the difference between 3NF and BCNF — the gap between them is small, appears only in tables with overlapping candidate keys, and is the detail students most often get wrong on exams.
A compact walkthrough of the full ladder of normal forms — 1NF, 2NF, 3NF, BCNF, and on to 4NF and 5NF — using everyday examples rather than abstract notation. The video is part of Gate Smashers' well-known DBMS lecture series and is pitched at students preparing for competitive exams, so it moves briskly and emphasizes the test you apply to decide whether a table satisfies each form.
It covers nearly every subtopic on this page in a single eleven-minute pass, making it an efficient refresher and a good way to see how the normal forms build on one another in sequence.
A focused, example-driven explanation of Boyce-Codd Normal Form from the Decomplexify channel, which is known for carefully building up normalization concepts step by step. Expect attention to candidate keys and determinants, and to the specific situations where a table is already in 3NF but still violates BCNF.
BCNF is the subtopic students most frequently misunderstand, and this video's longer, slower treatment gives the determinant-must-be-a-candidate-key rule the space it needs.
Database Star's plain-English tour of normalization from 1NF through 5NF, presented as a practical guide for working developers rather than as formal theory. Based on its title and framing, it should take a sample schema and progressively restructure it, explaining the redundancy and anomalies each step removes.
Its practical, designer-oriented angle reinforces why normalization preserves data integrity, which connects this review directly to the schema design and denormalization trade-offs later in the module.
Together these videos rebuild the foundation that the rest of Module 12 depends on. The Gate Smashers and Database Star videos give you the full 1NF-through-BCNF progression and the functional dependency reasoning needed to classify a table by its highest satisfied normal form (MO1), while the Decomplexify video closes the hardest gap in that classification task at the 3NF/BCNF boundary. The emphasis across all three on removing redundancy and eliminating update anomalies supports producing a fully normalized schema from a design (MO2), and it establishes the normalized baseline against which you will later weigh denormalization techniques, performance trade-offs, and design justifications (MO3-MO5).
These videos were chosen from YouTube on October 2, 2026. Each has captions; the player turns them on. Videos on YouTube can be changed or removed — if one no longer plays, tell your instructor. If a player does not appear, use its Watch on YouTube link.