DATABASE NORMALIZATION
Answer the following questions for this relational schema and functional dependencies:
R (A, B, C, D, E, F, G, H, I) A -> C ; C -> D ; A,C -> D B -> E,F ; A,B -> G ; G -> H,I ; A,G -> I
R (A, B, C, D, E, F, G, H, I) A -> C ; C -> D ; A,C -> D B -> E,F ; A,B -> G ; G -> H,I ; A,G -> I
a) List all candidate keys of R.
A, B -> A, B, C, D, E, F, G, H, I

b) Does the functional dependency A,C -> I hold?
A, C -> A, C, D
A, C can determine only A,C,D
=> A, C -> I does not hold
c) Does the functional dependency B -> F hold?
B -> E, F
=> B -> E, B -> F => holds
d) Normalize R into BCNF.
R (A, B, C, D, E, F, G, H, I)
The key of the above relation is AB. But B individually determines E, F
R => R1 and R2 by (4)
R1 = {A, B, C, D, G, H, I} key ={A, B}
R2 = {B, E, F} key = {B}
R1 => R3 and R4 by (1) and (2)
R3 = {A, B, G, H, I} key = {A, B}
R4 = {A, C, D} key = {A}
R3 => R5 and R6 by (6)
R5 = {A, B, G} key = {A, B}
R6 = {G, H, I} key = {G}
after normalization
R2 = {B, E, F} key = {B}
R4 = {A, C, D} key = {A}
R5 = {A, B, G} key = {A, B}
R6 = {G, H, I} key = {G}
DATABASE NORMALIZATION Answer the following questions for this relational schema and functional dependencies: R (A, B,...
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....
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]
Discuss the normal forms for a relational database schema. What does functional dependency mean? Given is the relational schema R( A, B, C, D, E ) as well as the functional dependencies • AC → BDE • B → D • A → E. Convert the schema into its 3rd normal form.
Write the complete proof.
Consider the relational schemas given below and the respective sets of functional dependencies valid in the schemas For each one of the relational schemas, determine the highest normal form, which is valid for a schema. Justify your answer If a schema is not in BCNF, then decompose it into a minimum number of schemas so that each one of them is in BCNF. Justify your answers. Justification must include the derivations of minimal keys from the...
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 relational schema R(A, B, C, D) with a set of functional dependencies F = { D --> AB, C --> B, CD --> A, AD --> B, B --> A } a. Compute { B, C }+ b. Show that { C, D } is a candidate key of R. c. Is { R1(A, B, C), R2(C, D ) } a lossless-join decomposition? Why? d. Compute a minimal cover Fmin of F.
Q2: Explain with example the difference between super keys and functional dependencies in relational databases. Show how to find a key (super/candidate) for the following functional dependencies [10 points]: R = {A, B, C, D, E, F, G, H, I, J, K,L,M} F {A B C D E, E F G H I J,AI →K,AL →M} =
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...
1. Given the schema R(A,B,C,D,E) with the functional
dependencies
F = { A → C,D D B, E B, C + D, E E → B,C } Is this schema in BCNF? If it is, prove it. If not, find a BCNF decomposition and then prove that the decomposition is in BCNF. You must prove each step carefully.
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?