-
Consider a schema R(A, B, C, D) and functional dependencies A → B and C → D. Then the decomposition of R into R1 (AB) and R2 (CD) is
-
- dependency preserving and lossless join
- lossless join but not dependency preserving
- dependency preserving but not lossless join
- not dependency preserving and not lossless join
- dependency preserving and lossless join
Correct Option: C
We need to check two paramenters for the solutions
1. Loseless join
2. Dependency preserving
1. Lossless join R1 (AB) ∧ R2 (CD) → R1 (AB)
Also, R1 (AB) ∧ R2 (CD) → R1 (CD)
But we know that
Functional dependencies A → B and C → D
Hence, the statement above is not possible. → R(ABCD) is not a lossless join.
2. Dependency preserving
Since, R1 (AB) ∨ R2 (CD) → R(ABCD) It is dependency preserving.