Homework Answers
Add Answer to:
Assume that R(A, B, C, D, E, F) has been decomposed into S(A, C, E, F)...
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....
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...
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 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.
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.
[1] [30 points] Consider the relation R City, Street, Zip Code), where a tuple (c, s,...
[1] [30 points] Consider the relation R City, Street, Zip Code), where a tuple (c, s, z) is in R only if city c has a building with street s, and z is the zipcode for that address in that city. It is assumed that the nontrivial functional dependencies are: Street → Zip Code ZipCode → City City, [a] [b] [C] [d] [e] Determine all possible keys for R. Indicate all possible BCNF and 3NF violations. Decompose R as necessary...
For the following relations and set of FDs: 1. give a key for the relation; 2....
For the following relations and set of FDs: 1. give a key for the relation; 2. state whether the relation is in BCNF, and if it is not state why: 3. give a set of relations in 3NF equivalent to the original relation 1. (33 points) What is the closure of (A,B) with respect to R(A,B,C,D,E,F,G)if R has the following functional dependencies? (a) GCDE AF BF - ABC FC G (b) D-AC-D A+B ABC 2 33 points for each of...
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 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....
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...
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) 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 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.
[1] [30 points] Consider the relation R City, Street, Zip Code), where a tuple (c, s, z) is in R only if city c has a building with street s, and z is the zipcode for that address in that city. It is assumed that the nontrivial functional dependencies are: Street → Zip Code ZipCode → City City, [a] [b] [C] [d] [e] Determine all possible keys for R. Indicate all possible BCNF and 3NF violations. Decompose R as necessary...
For the following relations and set of FDs: 1. give a key for the relation; 2. state whether the relation is in BCNF, and if it is not state why: 3. give a set of relations in 3NF equivalent to the original relation 1. (33 points) What is the closure of (A,B) with respect to R(A,B,C,D,E,F,G)if R has the following functional dependencies? (a) GCDE AF BF - ABC FC G (b) D-AC-D A+B ABC 2 33 points for each of...
Most questions answered within 3 hours.
-
Using the 12th edition of Language Awareness,
complete the following assignment:
After reading Akiba Solomon's "Thugs....
asked 9 minutes ago -
For all problems assume an effective monthly interest rate of 1%
unless otherwise indicated in the...
asked 20 minutes ago -
Fix all syntax and logical errors for the following program.
Please generate the correct output. //...
asked 28 minutes ago -
The USPS sells money orders identified by an 11 –digit number
x1, x2, …, x11. The...
asked 32 minutes ago -
Provide an example of equilibrium in relation to
Newton’s First and Second Laws. Explain your answer....
asked 33 minutes ago -
You are __________ to commit a Type I error using the 0.05 level
of significance than...
asked 51 minutes ago -
1. the following results are obtained:
200
kiwi
575 wild-type
What can we conclude about the...
asked 56 minutes ago -
Explain how you might use E. coli bacteria to produce human
growth hormone using the following:...
asked 57 minutes ago -
WHAT IS THE EFFEKT OF ADD K2CO3 TO ( METHANOL OG WATER)?
asked 1 hour ago -
Calculate the cell potential, the equilibrium constant, and the
free-energy change for: Ca(s)+Mn2+(aq)(1M)⇌Ca2+(aq)(1M)+Mn(s) given
the following...
asked 1 hour ago -
Determine the pH at the equivalence (stoichiometric) point in
the titration of 48 mL of 0.28...
asked 1 hour ago -
11. In CPM/PERT, an activity that is on the critical path
A. has equal values for...
asked 1 hour ago