KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
Given the following functional dependencies how would I compute the minimal cover: A -> B, ABCD -> E, EF -> GH, ACDF -> EG In the lecture notes it gives the derivation for the minimal cover but I do not understand it. For example for getting rid of ACDF -> E : A -> B => AACD -> BACD -> E => ACD -> E => ACDF -> E And then they say, similarly we do not keep ACDF -> G And then I understand that ABCD -> E is deduced to ACD -> E because A -> B , but I do not understand the formal process of how to get to that. So my question is, can anyone provide an explanation of how to generate the minimal cover for a set functional dependencies?
Tags (comma-separated)
Save Edits
Cancel