2,895 views
3 3 votes

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 equal to r2⋈ r1 true or false?

1 Answer

Best answer
2 2 votes

answer is 2000

 r1 table

P Q R
1 2 3
4 5 6

r2 table

R S T
3 10 11
6 12 13
9 14 15

r1 natural join r2

P Q R S T
1 2 3 10 11
4 5 6 12 13

here natural join is commutative so number of rows will be 2000 from above example we drive as r1 table contain 2 rows and r2 table contain 3 rows but R attribute's (3 and 6) only matched.

selected by
Position:
Show:

Related questions

1 1 vote
2 2 answers
2.1k
2.1k views
aditi19 asked May 8, 2019
2,115 views
Suppliers(sid, sname, address)Parts(pid, pname, color)Catalog(sid, pid, cost)Find the pids of the most expensive parts supplied by suppliers named Yosemite Sham
0 0 votes
0 0 answers
800
800 views
kumar.dilip asked Oct 27, 2018
800 views
Online Site For practicing Relational Algebrahttps://dbis-uibk.github.io/relax/calc.htm
0 0 votes
1 1 answer
1.5k
1.5k views
aditi19 asked May 7, 2019
1,518 views
Given relationcatalog(sid, pid, cost)Find pairs of sids such that the supplier with the first sid charges more for some part than the supplier with the second sidwhat is ...
2 2 votes
0 0 answers
702
702 views
♥_Less asked Jan 14, 2018
702 views
I have two doubts:1) A natural join B What will be the result when B don't have any tuple in it. Like in B their is relational algebra expression which is selecting Cars ...