Home » MCQs » DBMS MCQs » DBMS Decomposition Algorithms MCQs

We need to verify that α+ (an attribute closure of α under F) either includes all the attributes of the relation Ri or no attributes of ___, for every subset α of attributes in the relation Ri

8. We need to verify that α+ (an attribute closure of α under F) either includes all the attributes of the relation Ri or no attributes of ___, for every subset α of attributes in the relation Ri.

1. α
2. Ri+α
3. Ri-α
4. Ri

Answer: C) Ri-α

Explanation:

We need to verify that α+ (an attribute closure of α under F) either includes all the attributes of the relation Ri or no attributes of Ri-α, for every subset α of attributes in the relation Ri.