Moreover since the process directly finds the decomposed tables up to 3NF, so the tables are already in 1NF and 2NF according one condition of 3NF that says that to be in 3NF, the relations or tables must be in 1NF and 2NF.
SQL 2. Decompose the following relation to conform with 2NF and 3NF. Custoner Retal Relation CR76 CR76 CRSA Tine Murphy P016 CRs6 PO16 Prinvey Key fdi ds id4 fas Spelling out the functional dep...
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....