Question: Suppose the following relation ( schema ) R and functional dependencies F are given: R ( A , B , C , D , E

Suppose the following relation (schema) R and functional dependencies F are given:
R(A,B,C,D,E,F,G,H,I,J)
F=(ABC,ADE,BF,FGH,DIJ)
Assume that the first normalization form is already met. Before applying database normalization, please
draw a normalization diagram we did in class first. Then, decompose it to satisfy the second and third
normalization forms by filling out each relation table below.
Answer
Normalization Diagram (4 points)
2NF (12 points)
R1
R2
R3
3NF (14 points)
2NF (12 points)
R1
R2
R3
3NF (14 points)
R1
R2
R3
R4
R5
Asvignment #2
The following schema R and functional dependencies F
are given:
First normalization is already met.
Dra(s) diaaram:
a big box b/cis is
a composite key.
(2)2NF we must eliminate partial dependencies
snows C depends on A determines both D+.B determines F, and F
Ith AdB together. Include all other attribues determines GioH.
114
116 VALUES ('453453453','2','20.0'):
117
119 VALUES ('3334455555','2','10.0');
120
122 VALUES ('333445555','3','10.0')s
123
125 VALUES ('333445555','10','10.0')8
128 VALUES ('333M95555','20','30.0')8
Suppose the following relation ( schema ) R and

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!