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
  • Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, D-E} The decomposition of...

    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(C, D, E) is 2 Points) Select one: Lossless and Dependency Preserving. Lossy and Not Dependency Preserving. Lossless and Not Dependency Preserving. Lossy and Dependency Preserving.

  • Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, DE} The decomposition of...

    Let R(A,B,C,D,E) be a relation with FDs F = {AB-CD, A-E, C-D, DE} The decomposition of R into R1(A, B, C), R2(B, C, D) and R3(C, D, E) is (2 Points) Select one: Lossy and Dependency Preserving. Lossless and Not Dependency Preserving. Lossy and Not Dependency Preserving. Lossless and Dependency Preserving.

  • Find the decopmosition of R into R1(A, B, C), R2(B, C,D ) and R3(C, D, E)...

    Find the decopmosition of R into R1(A, B, C), R2(B, C,D ) and R3(C, D, E) Let R(A,B,C,D,E) be a relation with FDs F = {AB-CDAE, C-D, D-E} The decomposition of R into R1(A, B, C), R2(B, C, D) and RP(C, D, E) is (2 Points) Select one: Lossy and Not Dependency Preserving. Lossless and Not Dependency Preserving. Lossy and Dependency Preserving. Lossless and Dependency Preserving.

  • Let R(A, B, C, D, E) be a relation wit FDs F = {AB->C, CD->E, E->B,...

    Let R(A, B, C, D, E) be a relation wit FDs F = {AB->C, CD->E, E->B, CE->A}.... Question 4 Not yet answered Marked out of 2.00 P Flag question Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E-B, CE-A} Consider an instance of this relation that only contains the tuple (1, 1, 2, 2, 3). Which of the following tuples can be inserted into this relation without violating the FD's? (2 points) Select one: 0 (0, 1,...

  • Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E–B} (2 Points) Select one:...

    Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E–B} (2 Points) Select one: O Ris in 3NF but not in BCNF. O Ris not in 3NF but in BCNF. O Ris in 3NF and in BCNF. R is not in 3NF and not in BCNF.

  • Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E-B, CE-A} Consider an instance...

    Let R(A,B,C,D,E) be a relation with FDs F = {AB-C, CD-E, E-B, CE-A} Consider an instance of this relation that only contains the tuple (1, 1, 2, 2, 3). Which of the following tuples can be inserted into this relation without violating the FD's? (2 points) Select one: O (0, 1, 2, 4,3) (1,1,2,2,4) (1.2.2, 2, 3) o (1,1,3,2,3) All of the above can be inserted. None of the above can be inserted.

  • Consider the following relation R = {A,B,C,D,E} and the following set of functional dependencies F =...

    Consider the following relation R = {A,B,C,D,E} and the following set of functional dependencies F = { A → BC CD → E B → D E → A} F = { A → BC CD → E B → D E → A} Give a lossless, dependency-preserving decomposition into 3NF of schema R

  • Consider the relation schema R(T, E, C, D, Y) and the following set of F of...

    Consider the relation schema R(T, E, C, D, Y) and the following set of F of functional dependencies: CY à   E E à Y DY à T CT à D The relation R decomposes into R1(C, Y, E), R2(C, T, D). 1. Is this decomposition lossless-join? _________________Blank 1 True False 2. Is this decomposition dependency preserving? ? _____________Blank 2 True False

  • Consider the following relation R= {A, B, C, D, E} and the following set of functional...

    Consider the following relation R= {A, B, C, D, E} and the following set of functional dependencies F={ A → BC CD → E B + D E + A} Give a lossless, dependency-preserving decomposition into 3NF of schema R

  • my choices for these are wrong. 10 points QUESTION 3 Given R=(A, B, C) is a...

    my choices for these are wrong. 10 points QUESTION 3 Given R=(A, B, C) is a schema and F = {2C-A AB) is a set of FDs that hold on R. Which of the following statements is not true? d=(AB. AC) is a decomposition of that is in BCNF. O Ris in 3NF O BC is a candidate key for R Ris in BCN 10 points QUESTION 4 Given R= (A. 3. CD. E) is a schema and F= (A...

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