FD Concept => FD Inference Rules => FDs in DD Airport => Key and Superkey => Redundancy Reduction => BCNF Demo => Quiz

Key and Superkey:

Example:

Let R be a relation schema with schema(R) = {A1, A2, B1, B2, C}.
Let F = { A1 -> B1, A2 -> B2, B1 -> A1, B2 -> A2, B1B2 -> C}.

Keys for R with respect to F:

A1A2C, B1B2C, A1B2C, B1A2C.

Any set of attributes Y with a subset X which is key for R is a superkey.
Try to list all superkeys for R with respect to F.

(Keys for relations in DD Airline Scheduling will be shown in each kind of normal form respectively.
For detail, go to
Redundancy Reduction).