• retagged by
1 flag 583 views
0 0 votes

Assume two relations $R(P,Q)$ and $S(X,Y)$.

Consider the following TRC query:
\[
\{\,u \mid \exists v \exists w \ ((u,v) \in R \ \land\ (v,w) \in S)\,\}
\]

Which of the following relational algebra queries is equivalent to the above?

  1. $\pi_{P}\!\left(S \bowtie_{S.Y=R.Q} R\right)$
     
  2. $\pi_{P}\!\left(R \bowtie_{R.P=S.X} S\right)$
     
  3. $\pi_{P}\!\left(R \bowtie_{R.Q=S.X} S\right)$
     
  4. $\pi_{P}\!\left(S \bowtie_{S.Y=R.P} R\right)$

Please log in or register to answer this question.

Answer:
Position:
Show:

Related questions

0 0 votes
0 0 answers
493
493 views
GO Classes asked Feb 10
493 views
In the context of relational database normalization, which of the following statements are true?3NF lossless and dependency-preserving decomposition is always possible BC...
0 0 votes
0 0 answers
412
412 views
GO Classes asked Feb 10
412 views
Let $R(P,Q,R,S)$ be a relation. Which of the following statements are true?If $(PQ \rightarrow R)$ then $(P \rightarrow Q)\ \text{or}\ (Q \rightarrow R)$ If $P \rightarro...
0 0 votes
0 0 answers
464
464 views
GO Classes asked Feb 10
464 views
If the candidate keys are $A B, A C$ in relation $R(A B C D)$, then the number of superkeys is_____________
2 2 votes
1 1 answer
732
732 views
GO Classes asked Feb 16
732 views
An urn contains $10$ balls, of which $4$ are white and $6$ are black. Two balls are drawn at random from the urn one after another without replacement. What is the probab...