Minimal Cover Sets Flashcards
1
Q
What is the algorithm to find a minimal cover set?
A
1 Put FDs in standard form
- singletons on RHS
- Use decomposition axiom
2 Minimise LHS of each FD
- check if deleting an attribute will still preserve F+ = G+
(single letters, not the whole FD)
3 Delete redundant FDs
- check if deleting FD will preserve G+ = F+
