Question

1. Here's a relation (R), its attributes and its functional dependencies (F):

R(A, B, C, D, E)

C D → B

A → D

D → C

E → C

1. What is the closure of AB ({AB}⁺)?

2. What is the closure of F (F⁺)? [ set of closures for all LHS][each LHS on one line]

3. What is the minimal set (cover) for F?

4. Provide a key for relation R (a minimal set of attributes that can determine all attr.)

5. Decompose the above relation using the Boyce-Codd Normal Form (BCNF) decomposition. Consider the key of the relation as you stated in part D, and Please provide your reason for each decomposition using the existing Functional dependencies.

Answer 1