Consider a relation r(abcdefghij) with the following set of functional dependenciesg = { f → ab, cd → e, c → fg, h → ij, d → h }
is cde a superkey of r (w. r.t. g)?
is cde a key of r (w. r.t. g)?
apply the appropriate algorithm to determine a key for r (w. r.t. g).
apply the appropriate algorithm to determine all the keys for r (w. r.t. g).
determine the prime attributes of r.
is r in bcnf (w. r.t. g)?
is r in 3nf (w. r.t. g)?
determine whether the decomposition d = { cde, cfg, dh, hij, fab } has (i) the dependency preservation property and (ii) the lossless join property, with respect to g. also determine which normal form each relation in the decomposition is in.