Exercises on functional dependencies and normalization theory

EXERCISE N. 1
Given the set of attributes Z = {D,E,G,H,L,M,N} and the following set of functional dependencies:

F = {D ® E, DE ® H, H ® L, D ® L, LM ® N, N ® M}

It is required to the student to:

a. produce a minimal cover for the set of functional dependencies F.
b. compute the key/s of the set of attributes Z w.r.t. F.
c. compute a decomposition of Z in 3NF such that it is lossless and it preserves the functional
dependencies of F.

EXERCISE N. 2
Given the set of attributes Z = {A,B,C,D,E,F,G,H } and the following set of functional
dependencies:

F = {G ® H, AB ® C, A ® F, C ® D, C ® F, DG ® E, GH ® D, GH ® E}:

a) produce a minimal cover for the set of functional dependencies F

b) compute the key/s of the set of attributes Z w.r.t. F.
c) given the following decomposition determine for each relation: the keys of the relation and
the normal form that it satisfies (BCNF, 3NF o neither of them).

R1(A,B,C,D),
R2(C,F),
R3(G,H,D,E)