Consider a relation R(ABCDEFGHIJ) satisfying the following FDs:
DG→CFHB D→CJ F→EA J→B FG→DEI
(a) Find all candidate keys for R. Show all the steps. List prime attributes of R.
(b) Based on given functional dependencies and candidate keys that you have found, find a 3NF decomposition of R. (follow regular normalization steps and successively normalize to 3NF)
Find a lossless, dependency preserving 3NF decomposition of R(CDEFG) using the minimal cover method. R satisfies the following dependencies:
F→G D→E DC→F DE→C FG→C