1 1 vote Consider $R(S,N,C,P,X,Y,Q)$ with $F=\{S\to NC,\ P\to XY,\ SP\to Q\}$.The relation is decomposed into $R_1(S,N,C),$ $R_2(P,X,Y), $ $R_3(S,P,Q)$.Which statement is correct?The decomposition is lossy because no single component contains all attributes of $R$. The decomposition is lossless, and the Chase eventually produces a row containing all distinguished values. The decomposition is lossless only if $NC\to S$ is additionally given. Chase cannot be applied because the decomposition contains three relations. Databases goclasses goclasses-da-dpp goclasses-da-dpp-day-275 goclasses-cs-dpp goclasses-cs-dpp-day-373 databases goclasses-databases-practice-questions dependency-preserving chase-test + – GO Classes 94 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote One way to see this is through the Chase.For $R_3(S,P,Q)$, initially the distinguished values are available for $S$, $P$, and $Q$.Using $S\to NC$, the values of $N$ and $C$ can be forced to their distinguished values in the row corresponding to $R_3$.Using $P\to XY$, the values of $X$ and $Y$ can also be forced to their distinguished values.Thus the $R_3$ row eventually contains distinguished values for $S,N,C,P,X,Y,Q$.Therefore, the Chase contains a completely distinguished row.Hence, the decomposition is lossless.We can also prove it using successive combining:$R_1\cap R_3={S}$.Since$S\to SNC$,$R_1$ and $R_3$ combine losslessly.Their combined schema is $SNCPQ$.Now its intersection with $R_2$ is $\{P\}$.Since$P\to PXY$, the second combination is also lossless.Therefore, all three relations reconstruct $R$ losslessly.Answer : B GO Classes answered Sep 16 GO Classes comment Share Follow 0 reply Please log in or register to add a comment.