Consider a relation R (ABCDEFGH) with the following functional dependencies:

• AB-->C
• CD-->EF
• AG-->D
• D-->CB
• C-->G
• G-->A
• A-->D

Find minimal cover and identify all possible candidate keys. In order to receive full credit, please list each step taken and the rules that you applied.

 

Question 3

Using the functional dependencies provided below, normalize each of the relations, R1 and R2 to the third normal form. You should assume that there are no duplicate rows present and that all values are atomic. A separate solution is required for each relation that must clearly identify the steps required to normalize the relation to 3NF and demonstrate that it is lossless and preserves all functional dependencies.

1.

R1(ABCDEFG)

Key: AB

G-->F

E-->F

AB-->CD

 

R2(ABCDEFG)

Key: AC

A-->B

C-->B

D-->B