Course contentsShow
← Computer Science
Lesson 1640 of 2,87237. Database Design and NormalizationFree lesson

Boyce-Codd Normal Form (BCNF) Definition

Understanding BCNF as a stronger version of 3NF: every determinant must be a candidate key.

Boyce-Codd Normal Form (BCNF) Definition

What you'll learn: You'll understand BCNF as a stricter version of 3NF that eliminates certain anomalies by requiring every determinant to be a candidate key.

What Makes BCNF Stronger Than 3NF

You've learned that Third Normal Form (3NF) eliminates transitive dependencies—where non-key attributes depend on other non-key attributes. BCNF takes normalization one step further.

The core rule of BCNF: For every functional dependency X → Y in a table (where Y is not a subset of X), X must be a candidate key.

In simpler terms: if an attribute (or set of attributes) determines another attribute, then that determinant must be a candidate key for the entire table.

Why 3NF Isn't Always Enough

A table can be in 3NF but still have problems. This happens when:

  • A candidate key is composite (made of multiple attributes)
  • There's overlap between candidate keys
  • A non-prime attribute determines part of a candidate key

Think of it like this: 3NF says "non-key attributes can't depend on other non-key attributes." BCNF says "nothing can determine other attributes unless it uniquely identifies the whole row."

Example Scenario

Imagine a table with student tutoring sessions where (Student, Subject) is one candidate key and (Student, Tutor) is another (each tutor only teaches one subject, and each student has one tutor per subject). If Tutor → Subject, then Tutor determines Subject but isn't itself a candidate key—this violates BCNF even though it might satisfy 3NF.

Key Takeaway: BCNF requires that every determinant in a functional dependency must be a candidate key, making it a stricter normalization form than 3NF that eliminates additional anomalies.