0 0 votes Databases + – Dipanshu Rana 463 views answer comment Share Follow Print See all 2 Comments 2 2 Comments reply srestha commented Jun 7, 2018 reply Follow flag which exam this question came? 0 0 replyShare Dipanshu Rana commented Jun 7, 2018 reply Follow flag Not of any exam question This is workbook question 0 0 replyShare Please log in or register to add a comment.
0 0 votes Answer should be D, Because R relation is decomposed into R1 and R2 ,then relation should be lossless join .for lossless decomposition ,there should be two conditions (1) every attribute of R must be in$ R_1,R_2$ ( $R_1 $\Join$ R_2$ $ \cong$ R) (2)($R_1\cap R_2$)$\rightarrow$ $R_1$ //($R_1\cap R_2$) is super key of $R_1$ (OR) $(R_1\cap R_2)\rightarrow R_2$ //$(R_1\cap R_2) $ is super key of $ R_2$ Otherwise when we join R1 and R2 ,there will be spurious tuple(unwanted tuples) in relation.so decomposition should be based on superkey. Prateek Raghuvanshi answered Jun 7, 2018 Prateek Raghuvanshi comment Share Follow 0 reply Please log in or register to add a comment.