Consider a relation schema $R = (U, V, W, X, Y, Z)$, on which the following functional dependencies hold:
${U \rightarrow V,; VW \rightarrow X,; Y \rightarrow W,; X \rightarrow U}$
The candidate keys of $R$ are:
Functional dependencies:
$U \rightarrow V$
$VW \rightarrow X$
$Y \rightarrow W$
$X \rightarrow U$
Start with $UY$:
$U \rightarrow V$
$Y \rightarrow W$
Thus we get $V,W$
Then
$VW \rightarrow X$
Then
$X \rightarrow U$
So closure:
$UY^+ = {U,V,W,X,Y}$
Add $Z$ to cover all attributes.
Thus minimal key:
$UYZ$
Similarly:
$VYZ$ and $XYZ$
Thus candidate keys:
$UYZ,; VYZ,; XYZ$
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.