Functional Dependencies, Closure and Canonical Cover
A functional dependency (FD) X → Y says that the values of attributes X determine the values of attributes Y: two tuples that agree on X must agree on Y.
Database Management Systems · topic
Functional dependencies
Armstrong's axioms and derived rules, attribute closure, finding every candidate key and the prime attributes, counting FDs and superkeys, implied FDs and equivalence of FD sets, minimal cover step by step, and projecting FDs onto a decomposed relation.
Study this topic
Functional dependencies cheat sheets
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.