Consider the following set of functional dependencies on the schema (A, B, C)
A --> BC,
B —> C,
A —> B,
AB —> C
The cannonical cover for this set is
| A. | A —> BC and B ---->C |
| B. | A ----> BC and AB —> C |
| C. | A —> BC and A —> B |
| D. | A —> B and B —> C |
Answer : A Explanation : Sets of functional dependencies may have redundant dependencies that can be inferred from the other functional dependencies. A canonical cover of F is a “minimal” set of functional dependencies equivalent to F, having no redundant dependencies or redundant parts of dependencies. As we can infer all FD's from option A , so A is right answer. |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
