Consider R(A, B, C, D, E) be a relation schema with the following functional dependencies:
F={A→BC,CD→E,B→D,E→A}
Which of the following is true for decomposition of R into (A, B, C) and (C, D, E)?
A
Lossless join and dependency preserving.
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
Not lossless join but dependency preserving
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
Neither lossless join nor dependency preserving.
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D
Lossless join but not dependency preserving
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is C Neither lossless join nor dependency preserving. (a) R1(ABC)∩R2(CDE)=C
But C is not the super key of neither relation R1nor relation R2.
So it is lossy decomposition.