Question

Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, D-E} The decomposition of Rinto R1(A, B, C), R2(B, C, D) and R3
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Correct Answer :

Lossy and Not Dependency Preserving

Reason :

  • FDs = { AB ->CD ,A ->E , C ->D , D->E}
  • Now , based on this dependies , the minimal cover will be :
  1. A,B --> C
  2. A --> E
  3. C --> D
  4. D --> E
  • From this , on the RHS , only A,B is not missing .
  • Now , taking {A,B}+ = {A,B,C,D,E} => AB is candidate key
  • Now , relation R1(A,B,C) , FD set is AB->C.
  • Now , relation R2(B,C,D) , FD set is C->D.
  • Now , relation R3(C,D,E) , FD set is C->D,D->E.
  • Here, A->E cannot be derived, hence the decomposition is not dependency preserving.
  • Here, the common attribute in R1 and R2 is C, which is not the Candidate key in either of the relation, hence decomposition is not lossless.
Add a comment
Know the answer?
Add Answer to:
Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, D-E} The decomposition of...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT