FDs and Normal Forms
Determine Candidate Keys (CKs)
A field is prime iff it is in some CK
1NF: All relations are in 1NF
2NF: No FDs X?A where X ? some CK and A is non-prime
3NF: For each FD X?A:
- X is a superkey OR A is prime OR A ?X (trivial)
BCNF: For each FD X?A:
- X is a superkey OR A ?X (trivial)
Normalize by decomposing R (ABC) to R1(AB) and R2 (BC), where B?C violates a NF