Question 2

Consider the relation schema R = {A, B, C, D, E} and the following set Σ of FDs:

• AB → C

• BC → A

• C → DE

• DE → B

2.1 What are the candidate keys of R? Justify your answer (i.e., include the main steps used for finding the candidate keys).

2.2 Find a minimal cover of Σ and include the main steps used for finding a minimal cover.

2.3 Consider another set Σ1 of FDs on R:

• AB → CDE

• C → AB

• DE → B

Are Σ and Σ1 equivalent or not? Justify your answer.