Question

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. Question 4.4 (7 Points) In which normal form is relation R (recall that a relation can be in multiple normal forms). 2NF 3NF BCNF Use 3NF decomposition algorithm to decompose R into 3NF R Let Fe be a canonical cover for F: for each functional dependency α-+β in FC do j if none of the schemas R, 1 a β i contains if none of the schemas Rj. 1 sj sicontains a candidate key for R begin i 1: Ri any candidate key for R remove redundant relations/ Use BCNF decomposition algorithm to decompose R into BCNF Ri:Suppose we have a schema R and a n trivial dependency α-,β causes a violation of BCNF. We decompose R into: (α υ β ) · Check if functional dependency is preserved result-α while (changes to result) do for each R in the decomposition t-(result nR) R andresult -result ut If result contains all attributes in β then the functional dependency then α → β is preserved.

Answer 1

PAGE No DATE 1201 4.I

DATE : 『 0'201 4.3 now-emie.t.ac -elar Aurda.ne 1:· F-movin, B A Their でrA

PAE No DATE 201 4.4 Canarial.torhal E:._ B→ A not f.