Determining Candidate Keys
The previous example only illustrates the definition of a candidate key and not how these are determined in practice. It is important to determine all superkeys, which is especially difficult if the relation represents a set of relationships rather than a set of entities. Therefore it is often useful to attempt to find any "forgotten" superkeys by also determining the functional dependencies. We can derive more superkeys by applying the following rule:
- if S is a superkey and X→Y a functional dependency
- then (S ∖ {Y}) ∪ {X} is also a superkey, where '\' is the set difference.
Consider for example the relation
- Marriage (Husband, Wife, Date)
for which it will trivially hold that
- {Husband, Wife, Date}
is a superkey. If we assume that a certain person can marry at most once on a given date then this implies the functional dependencies:
- {Husband, Date} → Wife
- {Wife, Date} → Husband
In this case, applying the above rule leads to the derivation of the superkeys {Husband, Date} and {Wife, Date} respectively.
Read more about this topic: Candidate Key
Famous quotes containing the words determining, candidate and/or keys:
“I esteem it the happiness of this country that its settlers, whilst they were exploring their granted and natural rights and determining the power of the magistrate, were united by personal affection. Members of a church before whose searching covenant all rank was abolished, they stood in awe of each other, as religious men.”
—Ralph Waldo Emerson (1803–1882)
“Hear, then, a mortal Muse thy praise rehearse,
In no ignoble verse;
But such as thy own voice did practise here,
When thy first-fruits of Poesy were given,
To make thyself a welcome inmate there;
While yet a young probationer,
And candidate of Heaven.”
—John Dryden (1631–1700)
“Bless all useful objects,
the spoons made of bone,
the mattress I cook my dreams upon,
the typewriter that is my church
with an altar of keys always waiting.”
—Anne Sexton (1928–1974)