Imagine a single poorly-designed table, r(R), with attributes A, B, C, D, E, F, G, H, I, J, K, L, M.
You’ve looked over the naughty designer’s work and come up with the following logical functional dependencies. A —> {B, D, F}? B —> {G, H, I}? {A, C} —> {E, J, K}? {J, K} —> {L, M}
H is a composite attribute group with 3 attributes; H1, H2, H3. H3 is a multivalued attribute. L is a multivalued attribute.
1. Draw the functional dependency diagram for r(R).
2. What is the key of the original r(R)?
3. Resolve r(R) into 1NF
4. Resolve 1NF into 2NF
5. Resolve 2NF into 3NF
Imagine a single poorly-designed table, r(R), with attributes A, B, C, D, E, F, G, H,...
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....
(30 pts) Given R(a, b, c, d, e) with a key (a,b) and given the following set of functional dependencies F = { {a, b} → {c, d, e}, b → {d, e} }. Is R in 1NF? Justify your answer. Is R in 2NF? Justify your answer. Is R in 3NF? Justify your answer.
Q3: Given a relational schema R = {A,B,C,D,E,F,G,H,1,J,K} and a set of functional dependencies F {A B C D E, E F G H I J,AI →K} and a key(R) = AI = 1. Is R in BCNF? If yes, justify your answer [5 points] 2. If no, explain why and decompose R for two levels only [10 points] 3. Check whether the decomposition in step 2 dependency preserved or not [5 points]
MySQL: Consider the following abstract relational schema: (A, B, C, D, E, F) Now assume the following functional dependencies: A -> B, C, D, E, F C -> B Note: This implies that A is a key. Is this database in 1NF, 2NF, 3NF, or BCNF? Why?
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....
Given R = (A, B, C, D, E, G, H, I) and the set F of functional dependencies: BDEI → GH EG → AI DH → CE I → BD use the BCNF algorithm to generate a database design. Is your design dependency-preserving? Why or why not?
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)
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 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
We have the attributes: {A, B, C, D, E, F, G}. Consider the following functional dependencies E, F → C E → F B → A, G A, E, F → C, G D → A C, D, F → B, E, G A → B B, E → D, G Mark all functional dependencies that are implied by the dependencies above: a). D,F --> E, F b). D,F --> A,F c) D,F --> A d) D,F -->G e) D,F...