← 🧩 Normal Forms & Decomposition
Subtopic 3 of 6

5.3Lossless-join decomposition

The idea

A decomposition is lossless if natural-joining the parts gives back exactly the original table, with no spurious rows.

Think of it like this: Cutting a map into two pieces: they must overlap in a strip that tells you exactly how to glue them back.

Why it exists

Lossless-join questions use either the quick binary rule or the chase test.

How it works

  1. Two parts: R1 ∩ R2 must determine R1 − R2 or R2 − R1.
  2. More parts: build a table of rows (one per part), a_j for attributes the part has, b_ij otherwise.
  3. Apply each FD: rows that agree on the left side get equal right-side symbols (prefer a).
  4. Lossless if some row ends up all a.

Worked example: R(A, B, C) split into AB and BC with B → C.

AB ∩ BC = B determines BC − AB = C, so lossless. With only A → B it would be lossy.

Now play with it

  • →Press the two example buttons and compare the verdicts.
  • →Step through the chase table for five relations.
RelationABCDE
R1 (AD)a1b12b13a4b15
R2 (AB)a1a2b23b24b25
R3 (BE)b31a2b33b34a5
R4 (CDE)b41b42a3a4a5
R5 (AE)a1b52b53b54a5
  • Initial tableau: a_j where the relation has the attribute, b_ij otherwise
  • Apply A → C: rows 1 and 2 agree on A, so make C equal (b23 → b13)
  • Apply A → C: rows 1 and 5 agree on A, so make C equal (b53 → b13)
  • Apply B → C: rows 2 and 3 agree on B, so make C equal (b33 → b13)
  • Apply C → D: rows 1 and 2 agree on C, so make D equal (b24 → a4)
  • Apply C → D: rows 1 and 3 agree on C, so make D equal (b34 → a4)
  • Apply C → D: rows 1 and 5 agree on C, so make D equal (b54 → a4)
  • Apply DE → C: rows 3 and 4 agree on DE, so make C equal (b13 → a3)
  • Apply CE → A: rows 3 and 4 agree on CE, so make A equal (b41 → b31)
  • Apply CE → A: rows 3 and 5 agree on CE, so make A equal (b31 → a1)
ResultLossless: some row is all a

For a binary split R1, R2 you can skip the table: lossless iff (R1 ∩ R2) → (R1 − R2) or (R1 ∩ R2) → (R2 − R1) holds.

Check yourself

R(A, B, C) with F = {A → B} decomposed into AB and BC is

Remember: Binary: common part determines one side. Otherwise chase until a row is all a.
Exam notes (the dense version)

A decomposition is lossless if joining the parts gives back exactly the original rows. For two relations R1, R2: lossless iff (R1 ∩ R2) → (R1 − R2) or (R1 ∩ R2) → (R2 − R1). For more relations use the chase (tableau) test: start with a row per relation, apply the FDs to equate symbols, lossless if some row becomes all distinguished. Lossy joins create spurious tuples.

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.