Question

6. (20 points) Assume that R(A, B, C, D, E, F) has been decomposed into S(A, C, E, F) and other relations. If the dependencies for R are: AB C, C E, E B. B F, F D. (a) Find ALL non-trivial functional dependencies that hold in S (b) Determine the keys and superkeys of S (c) For each one of your functional dependencies from part a) indicate if it is a BCNF violation, a 3NF violation or no violation (with respect to S)

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

ven a) The Depends hotd Are - This is Trivao. There Are no-non triria Dependencies be cause. e Are Trvial Dependenctes 5) TheDePendenies e e Cave hes eSe al Defendences

Add a comment
Know the answer?
Add Answer to:
Assume that R(A, B, C, D, E, F) has been decomposed into S(A, C, E, F)...
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
  • Consider a relation R with five attributes A, B, C, D, and E. You are given...

    Consider a relation R with five attributes A, B, C, D, and E. You are given the following functional dependencies: A → B, BC→E, and ED→A. (a) Is R in BCNF? If it is not, decompose it into a collection of BCNF relations. 2: BCNF and 3NF (3 points) Consider the relation schema R with attributes A, B, C, and D and the following functional dependencies: AB→C, AC→B, B→D, BC→A. (a) Is R in BCNF? If it is not, decompose...

  • Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b-...

    Given the following relation schemas and the sets of FD's: a- R(A,B,C,D) F={ABẠC,C7D, D´A, BC+C} b- R(A,B,C,D) F={BẠC, BD, AD>B} C- R(A,B,C,D) F={AB-C, DC+D, CD+A, AD+B} d- R(A,B,C,D) F={AB=C, C+D, D™B, DE} e- R(A, B, C, D, E) F= {AB+C, DB+E, AE>B, CD+A, ECD} In each case, (i) Give all candidate keys (ii) Indicate the BCNF violation Give the minimal cover and decompose R into a collection of relations that are BCNF. Is it lossless? Does it preserve the dependencies?...

  • Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold o...

    Language: SQL - Normalization and Functional Dependencies Part 4 Normalization and Functional Dependencies Consider the following relation R(A, B, C, D)and functional dependencies F that hold over this relation. F=D → C, A B,A-C Question 4.1 (3 Points) Determine all candidate keys of R Question 4.2 (4 Points) Compute the attribute cover of X-(C, B) according to F Question 43 (5 Points) Compute the canonical cover of F.Show each step of the generation according to the algorithm shown in class....

  • Let, R=(A,B,C,D,E,G) and let F be {A→BDG, BG→DE, B→D, D→A}. Argue that R is not in...

    Let, R=(A,B,C,D,E,G) and let F be {A→BDG, BG→DE, B→D, D→A}. Argue that R is not in BCNF by finding one functional dependency in F that violates the definition of BCNF. Add one more non-trivial dependency to F so that R is in BCNF with respect to the new set of dependencies.

  • Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a) Specify all candidate keys for R. (b) Which of the given functional dependencies are Boyce-Codd No...

    Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a) Specify all candidate keys for R. (b) Which of the given functional dependencies are Boyce-Codd Normal Form (BCNF) violations'? (c) Give a decomposition of R into BCNF based on the given functional dependencies. (d) Give a different decomposition of R into BCNF based on the given functional dependencies. (e) Give a decomposition of R into 3NF based on the given functional dependencies. Consider a...

  • Consider a relation R with ve attributes A, B, C, D, and E. You are given...

    Consider a relation R with ve attributes A, B, C, D, and E. You are given the following functional dependencies: A->B, BC->E, and ED->A. (a) List all keys for R. (10 points) (b) Is R in BCNF? If it is, explain why. If is not, decompose it into a collection of BCNF relations. (20 points) (c) Is R in 3NF? If it is, explain why. If it is not, convert it into a collection of 3NF relations. (20 points)

  • Question 1: Functional Dependencies [7 marks Consider a relation R on attributes (A, B, C, D,...

    Question 1: Functional Dependencies [7 marks Consider a relation R on attributes (A, B, C, D, E, F,G, H) and the following functional dependen- cies. B →G C →D DE →GC → EF DEF → H (a) What is the closure of [F, G, Hy? (b) List all of the candidate keys of R under the dependencies above. (c) List all of the FDs above that are 3NF violations (d) List all of the FDs above that are BCNF violations....

  • Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a)...

    Consider a relation R(A,B,C,D,E) with the following functional dependencies: 8. AB C BCD CDE DEA (a) Specify all candidate keys for R. (b) Which of the given functional dependencies are Boyce-Codd Normal Form (BCNF) violations'? (c) Give a decomposition of R into BCNF based on the given functional dependencies. (d) Give a different decomposition of R into BCNF based on the given functional dependencies. (e) Give a decomposition of R into 3NF based on the given functional dependencies.

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

  • Consider the schema R=(A, B, C, D, E) and let the following set F of functional...

    Consider the schema R=(A, B, C, D, E) and let the following set F of functional dependencies hold for R: F= {A → BC, CD → E, B D } Problem 3 Suppose that the schema R=(A, B, C, D, E) is decomposed into R/ - (A, B, C) and R=(A, D, E). Show if this decomposition is a lossless decomposition with respect to the given set of functional dependencies F.

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