Consider a relation with schema R (A, B, C, D) and FDs the set F: F={...

 

Transcribed Image Text:

Consider a relation with schema R (A, B, C, D) and FDs the set F: F={ } AB A C C D a. (5%) Determine the set of all candidate keys for the relation schema. b. (5%) Determine the highest normal form (no NF, INF, 2NF, 3NF, BCNF) that the relation schema is in. Explain your answer. c. (10%) Decompose the relation schema into new relation schemas that satisfy the next higher normal form. d. (10%) Show the minimal covers of functional dependencies for the decomposed relation schemas. e. (10%) List the candidate keys of the decomposed relation schemas. f. (10%) Prove that the decomposition is a lossless join decomposition and/or dependency preserving. Consider a relation with schema R (A, B, C, D) and FDs the set F: F={ } AB A C C D a. (5%) Determine the set of all candidate keys for the relation schema. b. (5%) Determine the highest normal form (no NF, INF, 2NF, 3NF, BCNF) that the relation schema is in. Explain your answer. c. (10%) Decompose the relation schema into new relation schemas that satisfy the next higher normal form. d. (10%) Show the minimal covers of functional dependencies for the decomposed relation schemas. e. (10%) List the candidate keys of the decomposed relation schemas. f. (10%) Prove that the decomposition is a lossless join decomposition and/or dependency preserving.