Every Determinant Is a Candidate Key
← Back to BCNF
The BCNF requirement that for every functional dependency X → Y, X must be a candidate key (a minimal superkey). Stronger than 3NF.
← Back to BCNF
The BCNF requirement that for every functional dependency X → Y, X must be a candidate key (a minimal superkey). Stronger than 3NF.