Theory-of-Computation
October 3, 2023
Nielit Scientist-C 2016 march
October 3, 2023
Theory-of-Computation
October 3, 2023
Nielit Scientist-C 2016 march
October 3, 2023

Relational-Algebra

Question 15

Consider the relations r1(P, Q, R) and r2(R, S, T) with primary keys P and R respectively. The relation r1 contains 2000 tuples and r2 contains 2500 tuples. The maximum size of the join r1⋈ r2 is :

A
2000
B
2500
C
4500
D
5000
Database-Management-SystemRelational-AlgebraGATE 2006-IT
Question 15 Explanation: 
r1⋈ r2 is a join operation done on the common attribute R. So this can have 2000 tuples.
Correct Answer: A
Question 15 Explanation: 
r1⋈ r2 is a join operation done on the common attribute R. So this can have 2000 tuples.
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!