← 🧩 Normal Forms & Decomposition
Subtopic 1 of 6

5.11NF, 2NF, 3NF and BCNF

The idea

Normal forms grade how much redundancy FDs allow. 2NF: no partial dependency. 3NF: left side is a super key or right side is prime. BCNF: left side is always a super key.

Think of it like this: Tidying a cupboard in stages: first no duplicate items, then every item stored under the right label, then no exceptions at all.

Why it exists

Everything in normalisation is stated through candidate keys and prime attributes.

How it works

  1. Find the candidate keys and prime attributes (parts of any key).
  2. BCNF: every non-trivial X → A has X a super key.
  3. 3NF: same, but allowed if A is prime.
  4. 2NF: no non-prime attribute depends on a proper part of a key.
  5. BCNF ⊂ 3NF ⊂ 2NF ⊂ 1NF.

Worked example: R(A, B, C, D), F = {AB → C, C → D, D → A}.

Keys AB, BC, BD; every attribute is prime, so the relation is in 3NF. C → D has a non-key left side, so it is not in BCNF.

Now play with it

  • →Load each preset in the checker and look at the verdict column.
  • →Change an FD to make the relation BCNF.
Candidate keysAB, BC, BD
PrimeA, B, C, D
Non-prime-
Highest normal form3NF
FDLeft side a super key?Right side prime?Partial dependency?Verdict
AB → Cyesyesnofine for BCNF
C → Dnoyesnobreaks BCNF, ok for 3NF
D → Anoyesnobreaks BCNF, ok for 3NF

BCNF: every non-trivial FD has a super key on the left. 3NF: or the right side is prime. 2NF: no non-prime attribute depends on part of a key.

Normal formRuleWhat it removes
1NFatomic attribute valuesrepeating groups, sets in a cell
2NF1NF and no partial dependency on a candidate keyredundancy from part of a key
3NFX is a super key or the right side is primetransitive dependencies through non-key attributes
BCNFevery non-trivial X → A has X a super keyall FD-based redundancy

Check yourself

A relation where every attribute is prime is always in at least

Remember: BCNF: left side super key. 3NF: or right side prime. 2NF: no partial dependency.
Exam notes (the dense version)

1NF: attributes are atomic. 2NF: 1NF + no non-prime attribute depends on a proper part of a candidate key (partial dependency). 3NF: for every non-trivial X → A, X is a super key or A is prime. BCNF: for every non-trivial X → A, X is a super key. BCNF ⊂ 3NF ⊂ 2NF ⊂ 1NF. A relation whose keys are all single attributes is automatically in 2NF; a relation with only two attributes is always in BCNF.

Previous year questions: Normal Forms & Decomposition (11)

PYQs are grouped by topic, so this is the full set for Normal Forms & Decomposition; try the ones that match this subtopic. Open all 11 on the topic page.