• edited by
583 views
2 2 votes

Consider a relation schema $\mathrm{R}=(\mathrm{U}, \mathrm{V}, \mathrm{W}, \mathrm{X}, \mathrm{Y}, \mathrm{Z})$, on which the following functional dependencies hold:

$$\{\mathrm{U} \rightarrow \mathrm{~V}, \mathrm{VW} \rightarrow \mathrm{X}, \mathrm{Y} \rightarrow \mathrm{~W} ; \mathrm{X} \rightarrow \mathrm{U}\} $$

The candidate keys of $\mathrm{R}$ are:

  1. $\mathrm{UY, ~VY}$
  2. $\mathrm{UY, ~VY, ~XY}$
  3. $\mathrm{UYZ, ~VYZ, ~VWZ}$
  4. $\mathrm{UYZ, ~VYZ, ~XYZ}$

3 Answers

2 2 votes
Ans is : D
 

YZ attributes are not present on the RHS of any functional dependency, so YZ has to be the part of candidate keys.
we can eliminate the options A and B , because no YZ are present. and Option C is eliminated because CKs, UYZ,VYZ Contains YZ attributes, but VWZ does not contains Y, so we can eliminate the VWZ and hence ans is D.
 
0 0 votes

Just solve for closure to get your first candidate key. 
$$ U\cancel{V}\cancel{W}\cancel{X}YZ^* = \left \{ U, V, W, X, Y, Z \right \} $$ 

  1. check if any subset of candidate key determines all the attribute: No
  2. check if any candidate key attributes on RHS: Yes
Check and solve again, you will get option (d) as correct answer.
0 0 votes

The correct answer is D. The reason is that the attributes Y and Z do not appear on the right-hand side of any given functional dependency. Therefore, they cannot be derived from any other attributes and must be included in every candidate key.

Since Y and Z can only determine themselves ( {Y, Z} → {Y, Z}), excluding them from a key would mean that not all attributes can be derived. In that case, the set would fail to qualify even as a superkey.

Because a candidate key is defined as a minimal superkey, Y and Z must be part of every candidate key. None of the other given options except D include both Y and Z, so they can be eliminated.

Answer:
Position:
Show:

Related questions

3 3 votes
2 2 answers
761
761 views
Shubham Sharma 2 asked Sep 9, 2025
761 views
Consider a schema $\text{R(P, Q, R, S)}$ and the following functional dependencies $\text{P} \rightarrow \text{Q}, \text{Q} \rightarrow \text{R}, \text{R} \rightarrow \te...
4 4 votes
2 2 answers
526
526 views
Shubham Sharma 2 asked Sep 9, 2025
526 views
In a schema $R(A, B, C, D, E, F, G, H)$, each field of $R$ contains only atomic values. $\mathrm{F}=\{\mathrm{CH} \rightarrow \mathrm{G}, \mathrm{A} \rightarrow \mathrm{B...
3 3 votes
1 1 answer
347
347 views
Shubham Sharma 2 asked Sep 9, 2025
347 views
Which of the following relations can not be decomposed in to BCNF with a lossless join and dependency-preserving decomposition?$\mathrm{R}(\mathrm{V}, \mathrm{W}, \mathrm...
2 2 votes
2 2 answers
705
705 views
soujanyareddy13 asked May 12, 2021
705 views
An organization needs to maintain database having five attributes $\textbf{A, B, C, D, E}$. These attributes are functionally dependent on each other for which functional...