Question

Let R(A, B, C, D) be a relation with FDs F= {A->B, A->C, C->A, B->C, ABC->D} which of the statement is correct?

Question 2 Not yet answered Marked out of 2.00 P Flag question Let R(A,B,C,D) be a relation with FDs F = {AL-B, AC, CA, B-C,

0 0
Add a comment Improve this question Transcribed image text
Answer #1

R(A,B,C,D)
F={
A->B
A->C
C->A
B->C
ABC->D
}

Here A->B And A->C is replaced with A->BC

New Set= A->BC
C->A
B->C
ABC->D
  
Now C is extraneous attribute in A->BC. Therefore it is replace with A->B

New Set= A->B
C->A
B->C
ABC->D
  
Here B is extraneous attribute in ABC->D. Therefore it is replace with AC->D

New Set= A->B
B->C
C->A
AC->D

  

Answer:- G={A->B , B->C, C->A, AC->D } is a Canonical cover of F.
  

Add a comment
Know the answer?
Add Answer to:
Let R(A, B, C, D) be a relation with FDs F= {A->B, A->C, C->A, B->C, ABC->D}...
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) be a relation with FDs F = {A—B, AC, C-A, B,C, ABC-D} Which of...

    Let R(A,B,C,D) be a relation with FDs F = {A—B, AC, C-A, B,C, ABC-D} Which of the following statements is correct ? (2 points) Select one: G = {A-B, B-C, C-A, AC=D } is a canonical cover of F H = { AC, CA, BC,BD} is a canonical cover of F. o F is a canonical cover of itself. O G and H are canonical covers of F. None of the above.

  • Let R(A,B,C,D) be a relation with FDs F = {A-B, A-C, C-A, B-C, ABC—D} Which of...

    Let R(A,B,C,D) be a relation with FDs F = {A-B, A-C, C-A, B-C, ABC—D} Which of the following statements is correct ? (2 Points) Select one: G= {A-B, B-C, C-A, AC-D } is a canonical cover of F O H = {A-C, C-A,B,C,B-D) is a canonical cover of F. o F is a canonical cover of itself. G and Hare canonical covers of F. None of the above.

  • 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.

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

    Consider the following relation R(A,B,C,D,E,G) and the set of functional dependencies F = { A → BCD BC → DE B → D D → A} Give a 3NF decomposition of the given schema based on a canonical cover

  • For the relation R(A,B,C,D,E) with the following FDs: A → B, C → D, AB →...

    For the relation R(A,B,C,D,E) with the following FDs: A → B, C → D, AB → C, BC → A 1. List all non-trivial FDs following from the above. (2 marks) 2. Generate all possible keys for R. (2 marks) 3. Check whether R is in BCNF. If it is in BCNF, explain the criteria you used. If it is not in BCNF, convert it into BCNF, showing the new relations and their FDs. (5 marks)

  • 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.

  • 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.

  • 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, 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.

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