A superkey or super-key is defined in the relational model of database organization as a set of attributes of a relation variable for which it holds that in all relations assigned to that variable, there are no two distinct tuples that have the same values for the attributes in this set. It can be defined as a set of attributes of a relation schema upon which all attributes of the schema are functionally dependent. The set of all attributes is a trivial superkey, because in relational algebra duplicate rows are not permitted: rows are a set, not a multiset. The superkey is also known as superset key. If attribute set K is a superkey of relation R, then at all times it is the case that the projection of R over K has the same cardinality as R itself. A superkey is a set of attributes within a table whose values can be used to uniquely identify a tuple. A candidate key is a minimal set of attributes necessary to identify a tuple; this is also called a minimal superkey. Given an employee schema consisting of the attributes employeeID, name, job, and departmentID, where no value in the employeeID attribute is ever repeated, we could use the employeeID in combination with any or all other attributes of this table to uniquely identify a tuple in the table. Examples of superkeys in this schema would be,, and. The last example is known as trivial superkey, because it uses all attributes of this table to identify the tuple. In a real database we do not need values for all of those attributes to identify a tuple. We only need, per our example, the set. This is a minimal superkey—that is, a minimal set of attributes that can be used to identify a single tuple. employeeID is a candidate key.
Example
First, list out all the sets of attributes: Second, eliminate all the sets which do notmeet superkey's requirement. For example, cannot be a superkey because for the same attribute values, there are two distinct tuples:
Finally, after elimination, the remaining sets of attributes are the only possible superkeys in this example:
In reality, superkeys cannot be determined simply by examining one set of tuples in a relation. A superkey is a property of a relation variable which must hold for all possible values and can only be determined from the functional dependencies which apply to that relation variable. If a relation contains 'n' attributes then maximum number of superkeys possible is 2n. A relation of degree n has 2n superkeys whenever ∅ is a candidate key for that relation. For example: where ∅→ - meaning only one person can be president. There are four superkeys in President:
