A superkey is essentially a super set of a key. Consider a relation R(a,b,c,d) where {a} is the key. Any addition to a such as {a,b},{a,c}, {a,b,c} are considered superkeys. Furthermore, if you add more attributes to a superkey, it will be considered a superkey as well. So yes, a superset of a superkey is another superkey.

In database a key is a field that we use to sort a data.whereas superkey is a subset of attribute so that no tuple have the same combination of values.

it is a set one or more attribute,that taken collectively allow as to idendify uniquly and entity in entity set.

ex-customer-id,

3NF is where data depends on nothing but the whole key. It seems that every 3NF table should be in BCNF, as BCNF is stricter than 3NF. But, BCNF requires that every nontrivial attribute is a superkey, even if the dependent attributes are part of keys, that is, when X->Y, X is a superkey for the relation, where 3NF also allows that Y is a key attribute for the relation.

A superkey is defined as a set of attributes of a relation for which it holds that in all relations assigned to

that variable there are no two distinct tuples (rows) that have the same values for the attributes in this set.

As an example

Code:

Roll Number | First Name | Last Name

CSU0001 | Shabbir | Bhimani |

CSU0002 | SomeName | SurName |

CSU0003 | Larry | page |

Now here we have the following as super keys

1. Roll Number | First Name

2. Roll Number | First Name | Last Name

Now in plain language Any Unique key with some Non Unique key combination is called a super key of the

relationship.

A candidate key of a relationship is a set of attributes of that relationship such that there are no two distinct

tuples with the same values for these attributes. In simple example candidate key is a minimal superkey, i.e. a

superkey of which no proper subset is also a superkey.

Since a relation is a set(no duplicate elements), it holds that every relation will have at least one candidate key

(because the entire heading is always a superkey). For practical reasons RDBMSs usually require that for each

relation one of its candidate keys is declared as the primary key

Quote:

For example, Given an employee table consisting of the columns:

employeeID

name

job and

departmentID

we could use the employeeID in combination with any or all other columns of this table to uniquely identify a row

in the table. Examples of superkeys in this table would be {employeeID, Name}, {employeeID, Name, job}, and

{employeeID, Name, job, departmentID}.

In a real database we don't need values for all of those columns to identify a row. We only need, per our example,

the set {employeeID}. This is a minimal superkey - that is, a minimal set of columns that can be used to identify a

single row. So, employeeID is a candidate key.

Now, if employeeID is a candidate key then why not it is the superkey. Because employeeID can also uniquely

identify the tuples.

(2) In your example why Roll number is not the superkey as it is uniquely identifying the tuples?

(3)

Quote:

Any Unique key with some Non Unique key combination is called a super key of the relationship

Is it necessary that Unique key has to be combined with some Non Unique key to be called as a super key.

Unique key is also a super key but the minimal super key is called candidate key and all candidate keys are super

keys but the reverse is not true.