463 views

1 Answer

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.
Position:
Show:

Related questions

1 1 vote
1 1 answer
90
90 views
GO Classes asked Sep 11
90 views
What is the name of the type of functional dependency that is removed when converting a relation from $\text{2NF}$ to $\text{3NF}$?Partial dependency Transitive dependenc...
0 0 votes
1 1 answer
86
86 views
GO Classes asked Sep 11
86 views
Consider relation $\text{Exam(ExamId, Section, Date, Duration, AnswersDate, AnswersTime, RoomId, TimeFrom, RoomNo)}$ with primary key $\text{(ExamId, Section)}$ and the f...
1 1 vote
1 1 answer
185
185 views
GO Classes asked Sep 7
185 views
Consider the relation schema $R(A,B,C,D,E,F)$ with the functional dependencies$F=\{A \to BF,\ B \to F,\ CD \to E,\ DE \to F\}$.What is $(CD)^+$?$\{C,D,E\}$ $\{C,D,E,F\}$ ...
2 2 votes
1 1 answer
119
119 views
GO Classes asked Sep 7
119 views
Suppose $R(A,B,C)$ satisfies $AB \to C$ and $B \to C$.Which of the following two-tuple relation instances is a valid counterexample showing that $A \to C$ does not necess...