Functional dependencies are more than an abstract piece of relational theory — they are the blueprint you use when deciding what tables a database should have and which attributes belong in each one. A dependency such as StudentID -> Advisor is a statement about the real world: it says that knowing a student determines exactly one advisor. Once you write down the dependencies that hold over your data, the structure of a good schema follows from them in a fairly mechanical way.
When dependencies are ignored, the cost shows up as redundancy and as insertion, deletion, and update anomalies: the same fact stored in many rows, facts that cannot be recorded because no complete row exists yet, and facts that vanish when an unrelated row is deleted. Normalization is the systematic response. Each normal form (2NF, 3NF, BCNF, and beyond) is defined in terms of functional dependencies and keys, and moving a schema into a higher normal form means decomposing relations so that every dependency has a key on its left side. Two properties constrain how you decompose: the decomposition must be lossless (joining the pieces back together recovers exactly the original relation, no spurious tuples) and ideally dependency preserving (every original dependency can still be enforced on a single fragment without a join).
While watching these videos, keep three questions in mind. First, which attribute closures and candidate keys are being computed, and how are they used to justify a split? Second, what specific anomaly does each decomposition eliminate? Third, note carefully the trade-off the first video highlights: BCNF is the stricter condition, but it does not always allow a dependency-preserving decomposition, which is why 3NF remains a practical target in real designs.
This lecture examines whether a BCNF decomposition always preserves functional dependencies, working through normalization examples to show the answer. Based on the title and channel's exam-oriented style, expect worked relations where candidate keys are identified, the schema is split, and the resulting fragments are checked for both losslessness and whether each original dependency can still be enforced.
It directly targets two of the harder subtopics — lossless decomposition and dependency preservation — and the counterexample framing makes the 3NF versus BCNF trade-off concrete rather than a memorized rule.
A single consolidated walkthrough of the normal forms from 1NF through 5NF, including 2NF, 3NF, and BCNF, illustrated with everyday examples rather than purely symbolic relations. The video should show, for each form, which kind of dependency violation it removes and how the schema changes as a result.
Gate Smashers' DBMS series is widely used and consistently accurate on definitions, and this one video gives you the full ladder of normal forms in order, making clear how functional dependencies serve as the foundation for every step.
This talk steps back to ask what normalization actually is and why it matters to people who build and maintain data platforms, rather than drilling procedure. Expect discussion of the motivation — redundancy, anomalies, and maintainability — alongside the presenter's own ranking of the normal forms by practical usefulness.
It supplies the design rationale that complements the mechanical examples, which supports the subtopics on dependencies as design blueprints and on the anomalies that appear when dependencies are ignored.
Together these videos carry the formal machinery of Module 2 into design practice. The normal-forms overview and the practitioner talk both show how redundancy and update anomalies trace back to specific functional dependencies, which is exactly the evaluation skill in MO5, and they reinforce the distinction between dependencies that are harmless and those that violate a normal form (MO2). The BCNF and dependency-preservation lecture depends on identifying candidate keys before any split can be justified, giving you repeated practice with the attribute closure reasoning from MO4 and the derivations from Armstrong's Axioms in MO3. All three keep the relational schema — attributes, keys, and relation structure — at the center, which supports the formal vocabulary established in MO1.
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.