529 views

2 Answers

4 4 votes
The maximum number of tuples can be $m n$. This happens in two cases.
Case $1$: if there is a common attribute between $R$ and $S$, and every row of $r$ matches with the each row of $s$ i.e., it means, the join attribute has the same value in all the rows of both $r$ and $s$,

Case $2$ : If there is no common attribute between $R$ and $S$.
The minimum number of tuples is $0$ . This happens when there is a common attribute between $R$ and $S$ and it has no common value between the two relations.
• reshown by
0 0 votes

Answer: Option B
             
Maximum number of tuples will be: m*n
              Minimum number of tuple will be : 0 (if there is no common attribute)

1 flag:
✌ Edit necessary (Aambo04 “wrong answer. Minimum = 0 when there is common atribute but none of its values in R matches with S correspoinding attribut value.”)
Answer:
Position:
Show:

Related questions

2 2 votes
3 3 answers
589
589 views
GO Classes asked Jul 20, 2025
589 views
If a node has $K$ children in $B$ tree, then the node contains exactly_______keys.$K^2$ $K-1$ $K+1$ $\sqrt{K}$
2 2 votes
1 1 answer
543
543 views
GO Classes asked Jul 20, 2025
543 views
Calculate the order of leaf ( $P_{\text {leaf }}$ ) and non leaf (P) nodes of a $B^{+}$tree based on the information given below.Search key field = $12$ fieldRecord point...
10 10 votes
5 5 answers
749
749 views
GO Classes asked Jul 20, 2025
749 views
Which functional dependency holds in given relation $\mathrm{R}(\mathrm{A}, \mathrm{B}, \mathrm{C})$ and why? $$\begin{array}{|c|c|c|}\hline \mathbf{A} & \mathbf{B} & \m...
5 5 votes
3 3 answers
495
495 views
GO Classes asked Jul 20, 2025
495 views
Consider a relation R(A, B, C, D, E, F, G, H, I, J) with functional dependencies:$$\mathrm{AB} \rightarrow \mathrm{C}, \mathrm{BD} \rightarrow \mathrm{EF}, \mathrm{AD} \r...