Consider the following relational schemas and functional dependencies. Assume that the relations have been produced from a relation ABCDEFGHI and that all known dependencies for this relation are listed. State the strongest normal form for each one and, if appropriate, decompose to BCNF.
(a) R(A, B, C, D, E); A ? B, C ? D
(b) S(A, B, F); AC ? E, B ? F
(c) T(A, D); D ? G, G ? H
(d) U(C, D, H, G); A ? I, I ? A
(e) V(A,C, E, I)
(a) Not in 3NF. Decompose to: AD, CD, and ACE.
(b) Not in 3NF. Decompose to: AB and BF.
(c) – (e) Last three are in BCNF.
Computer Science & Information Technology
You might also like to view...
A character, such as a colon or comma, that separates fields is a ________
A) named range B) slicer C) delimiter D) definition
Computer Science & Information Technology
Proper security administration policies, controls, and procedures enforce which of the following?
A. The total reduction of malware B. The elimination of risk C. Separation of duties D. The AIC objectives
Computer Science & Information Technology