Boyce-Codd Normal Form (BCNF) is a stricter version of Third Normal Form. Where 3NF tolerates certain functional dependencies whose left-hand sides are not keys (as long as the right-hand side is a prime attribute), BCNF removes that exception entirely: for every nontrivial functional dependency X -> Y in the relation, X must be a superkey. That single rule is the whole definition, but applying it requires you to be comfortable finding candidate keys and listing the functional dependencies that actually hold in a schema.
This matters in COP4708 because BCNF is the practical stopping point for most relational designs built on functional dependencies. Relations that satisfy 3NF but not BCNF can still carry redundancy and update anomalies, and these cases typically appear when a relation has overlapping composite candidate keys. Learning to spot those cases, and to decompose the relation into projections that preserve the original data through a lossless join, is the core skill of this topic.
As you watch, keep three questions in mind. First, what are the candidate keys of the example relation, and which dependency violates the superkey rule? Second, how is the decomposition constructed from the violating dependency, and why is the resulting join lossless? Third, what is lost in the trade: BCNF decomposition can fail to preserve all functional dependencies, which is exactly the tension between 3NF and BCNF that you will be asked to evaluate.
A focused, example-driven walkthrough of what BCNF requires and how it differs from the normal forms that precede it. Based on its title and description, it builds up the definition around functional dependencies and keys and then shows worked examples of relations that fail BCNF and how they are restructured. Expect a clear statement of the rule that every determinant must be a candidate key.
Decomplexify is widely used for normalization explanations and this video is the most-viewed introduction of the three, making it a good first pass at the definition, the difference from 3NF, and identifying violations.
A longer, more deliberate treatment that positions BCNF as one of the two most important normal forms in practice. The description indicates it explains what BCNF is and how to work with it, so expect coverage of the formal condition, how to test a schema against it, and how decomposition proceeds step by step.
Its slower pace and practitioner framing complement the shorter overview, giving you more time on the formal definition and on the mechanics of decomposing a schema to reach BCNF.
This lecture addresses a specific and important question: whether a BCNF decomposition always preserves dependencies. It works through normalization examples to illustrate the point, which is the standard way this result is demonstrated in database courses.
It targets the lossless decomposition versus dependency preservation trade-off directly, which is the subtopic students most often misunderstand, and it explains exactly when 3NF may be preferred over BCNF.
Together these videos cover the superkey test for functional dependencies that MO1 requires, and the decomposition procedures behind MO2, including why the resulting projections join losslessly. The Gate Smashers lecture speaks directly to MO4 by examining whether BCNF decompositions preserve dependencies, giving you the evidence needed to argue a trade-off for a given schema. The BCNF foundation built here is the first of the three transformations in MO5; multivalued dependencies and 4NF (MO3) are treated in the later topics of this module.
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.