5 5 votes Consider the following FD set {A → BC,B → AC, C → AB}. The number of different minimal covers possible for the above FD set __________ . Databases + – Anirban Biswas 2.3k views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply Shamim Ahmed commented Dec 20, 2018 i edited by Lakshman Bhaiya Dec 20, 2018 reply Follow flag @Lakshman Patel RJIT The minimal covers should be A→ C, B→ C, C→ A, C→ B right? 0 0 replyShare Lakshman Bhaiya commented Dec 20, 2018 reply Follow flag Yes it possible 0 0 replyShare Please log in or register to add a comment.
3 3 votes Minimal Cover means that you should not take those Functional Dependencies which could be derived without taking that Functional Dependency. In simplar words if there is Functional Dependency like A-->B you should not be able to derive it by A+ without A-->B. For this question we get 2 Functional Dependency sets which are minimal : A-->B, B-->C, C-->A A-->C, B->A, C-->B Mehak Sharma 1 answered Jan 1, 2017 Mehak Sharma 1 comment Share Follow See 1 comment 1 1 comment reply Pankaj Joshi commented Jan 28, 2017 i edited by Pankaj Joshi Jan 28, 2017 reply Follow flag there could be more minimal covers A--->B, A--->C, B-->A, C-->A A--->B, B--->A, B-->C, C-->B A--->B, B--->C, C-->B, C-->A A-->B, B-->C, C-->A A--->C, B-->C, C-->A total 5 2 2 replyShare Please log in or register to add a comment.
3 3 votes A--->B, A--->C, B-->A, C-->A A--->B, B--->A, B-->C, C-->B A--->B, B--->C, C-->B, C-->A A-->B, B-->C, C-->A A--->C, B-->C, C-->A total 5 Pankaj Joshi answered Jan 28, 2017 Pankaj Joshi comment Share Follow 0 reply Please log in or register to add a comment.
