In the relational model of databases, a candidate key of a relation is a minimal superkey for that relation; that is, a set of attributes such that
- the relation does not have two distinct tuples (i.e. rows or records in common database language) with the same values for these attributes (which means that the set of attributes is a superkey)
- there is no proper subset of these attributes for which (1) holds (which means that the set is minimal).
The constituent attributes are called prime attributes. Conversely, an attribute that does not occur in ANY candidate key is called a non-prime attribute.
Since a relation contains no duplicate tuples, the set of all its attributes is a superkey if NULL values are not used. It follows that every relation will have at least one candidate key.
The candidate keys of a relation tell us all the possible ways we can identify its tuples. As such they are an important concept for the design of database schema.
Read more about Candidate Key: Example, Determining Candidate Keys
Famous quotes containing the words candidate and/or key:
“A candidate once called his opponent “a willful, obstinate, unsavory, obnoxious, pusillanimous, pestilential, pernicious, and perversable liar” without pausing for breath, and even his enemies removed their hats.”
—Federal Writers’ Project Of The Wor, U.S. public relief program (1935-1943)
“Woe unto you, lawyers! for ye have taken away the key of knowledge: ye entered not in yourselves, and them that were entering in ye hindered.”
—Bible: New Testament Jesus, in Luke 11:52.