Consider the relation \(R(P,Q,S,T,X,Y,Z,W)\) with the following functional dependencies:
\[ PQ \rightarrow X; P \rightarrow YX; Q \rightarrow Y; Y \rightarrow ZW \] Consider the decomposition of the relation \(R\) into the constituent relations according to the following two decomposition schemes. \[ \begin{aligned} D_1 &: R = [(P,Q,S,T);\; (P,T,X);\; (Q,Y);\; (Y,Z,W)] \\ D_2 &: R = [(P,Q,S);\; (T,X);\; (Q,Y);\; (Y,Z,W)] \end{aligned} \] Which one of the following options is correct?
Consider the relation \(R(P,Q,S,T,X,Y,Z,W)\) with the following functional dependencies:
\[ PQ \rightarrow X; P \rightarrow YX; Q \rightarrow Y; Y \rightarrow ZW \] Consider the decomposition of the relation \(R\) into the constituent relations according to the following two decomposition schemes. \[ \begin{aligned} D_1 &: R = [(P,Q,S,T);\; (P,T,X);\; (Q,Y);\; (Y,Z,W)] \\ D_2 &: R = [(P,Q,S);\; (T,X);\; (Q,Y);\; (Y,Z,W)] \end{aligned} \] Which one of the following options is correct?
Show Hint
- \(D_1\) is a lossless decomposition, but \(D_2\) is a lossy decomposition.
- \(D_1\) is a lossy decomposition, but \(D_2\) is a lossless decomposition.
- Both \(D_1\) and \(D_2\) are lossless decompositions.
- Both \(D_1\) and \(D_2\) are lossy decompositions.
The Correct Option is A
Solution and Explanation
Step 1: Identify candidate keys of \(R\).
Using the given functional dependencies:
From \(P \rightarrow YX\) and \(Y \rightarrow ZW\), we get \(P \rightarrow X,Y,Z,W\).
From \(Q \rightarrow Y\), and already having \(Y \rightarrow ZW\), we get additional attributes.
Thus, \((P,Q,S,T)\) forms a key for \(R\).
Step 2: Check decomposition \(D_1\).
The relation \((P,Q,S,T)\) contains a key of \(R\). Hence, by the lossless join test, \(D_1\) is a lossless decomposition.
Step 3: Check decomposition \(D_2\).
None of the decomposed relations in \(D_2\) contains a key of the original relation \(R\).
Therefore, joining the decomposed relations may produce spurious tuples.
Step 4: Conclusion.
Thus, \(D_1\) is lossless, while \(D_2\) is lossy.
Final Answer: (A)
Top Questions on Normal Forms
- In a relational data model, which one of the following statements is TRUE?
- Suppose the following functional dependencies hold on a relation \(U\) with attributes \(P, Q, R, S,\) and \(T\):
\[ P \rightarrow QR, RS \rightarrow T \] Which of the following functional dependencies can be inferred from the above functional dependencies?
Questions Asked in GATE CS exam
- GATE CS - 2025
- Adjoint and Inverse of a Matrix
Consider the following code:
int a; int arr[] = {30, 50, 10}; int *ptr = arr[10] + 1; a = *ptr; (*ptr)++; ptr = ptr + 1; printf("%d", a + arr[1] + *ptr);In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative
- GATE CS - 2025
- Geometry
Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[ \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\ \hline P1 & 0 & 10 \\ P2 & 1 & 13 \\ P3 & 2 & 6 \\ P4 & 8 & 9 \\ \hline \end{array} \]Find the turnaround time for each process.
- GATE CS - 2025
- Programming in C
- If IMAGE and FIELD are coded as FHBNJ and EMFJG respectively then, which one among the given options is the most appropriate code for BEACH?
- GATE CS - 2025
- GATE IN - 2025
- GATE MT - 2025
- GATE NM - 2025
- GATE TF - 2025
- Logical and Analytical Reasoning Skills