Project 6 — Database Design

 

 

Academic Integrity: I completed this project without the assistance of others. I understand that cheating, helping others to cheat, or failing to report such actions is dishonest and wrong. Such acts could result in disciplinary action against me.

 

· Email your solution in an attached PDF file to both the instructor and the TA.

· The subject should be

“Project6 - " + Your First Name + Last Name e.g. Project6 - JohnDoe

· Your file name should be

“Project6 - " + Your First Name + Last Name + ".PDF” e.g. Project6 - JohnDoe.pdf

· Include your name inside the PDF file.

· For full credit, your assignment must be received by 11:59 pm on the due date.

 

 

Given R = (A, B, C, G, H, I) and F = {A ® B, A ® C, CG ® H, CG ® I, B ® H}

 

 

       1.   Compute the canonical cover of F (Fc) using Armstrong’s Axioms.  State the axioms that you use to arrive at Fc.

 

 

       2.   Identify all candidate keys for R.

 

 

Given R = (A, B, C) and F = {A ® BC, B ® C, A ® B, AB ® C}

 

           3.   Compute the canonical cover of F (Fc) using Attribute Closure.  Show your work.

 

 

4.   Explain why R is not in BCNF.

 

 

5.    Decompose R into 2 schemas that are in BCNF. Show how the decomposition will result in lossless join and dependency preservation.

 

 

Given R = (J, K, L ) and F = { JK ® L, L ® K }

 

6.   Compute the canonical cover of F (Fc).

 

 

7.   Identify all candidate keys for R.

 

 

8.   Explain why R is not in BCNF.

 

 

9.    Decompose R into BCNF.  Show how you arrived at that decomposition. Explain whether it is a lossless join and whether dependencies are preserved.

 

 

10.Explain whether or not R is in 3NF.

 

Explain what is wrong with the following statement

 

11. A decomposition of R into R1 and R2 (with corresponding F decomposed into F1 and F2) preserves dependencies if and only if F1 ∪ F2 = F.