Which normal form is stricter than 3NF and requires every non-trivial functional dependency X → Y to have X as a superkey?
Options
-
A.
1NF
-
B.
2NF
-
C.
BCNF
-
D.
More than one of the above
-
E.
None of the above
Correct Answer (Detailed Explanation is Below)
C.
BCNF
Detailed Explanation
- Boyce-Codd Normal Form (BCNF): For every non-trivial functional dependency X → Y, X must be a superkey.
- BCNF is stricter than 3NF.
- It addresses certain redundancy problems that may remain in 3NF.
OOps! You are currently offline.