(Solved) : Assume Two Relations R B S C Stored 150000 90000 Pages Respectively Index Created Two Rela Q30220044 . . . .

Assume two relations R(a,b) and S(a,c) stored in 150000 and90000 pages, respectively. No index

is created for these two relations.

(a)

Assume there are 400 buffer pages available. We want to have theoutput of join of R and S

sorted according to the attribute a.What join algorithm shouldwe use to have the minimum cost?

What is the cost of this algorithm?

(b)

Assume that there are 50 buffer pages available. What is thefastest join algorithm to produce

the join of R and S? What is the cost of this algorithm?

(c)

Assume that there are 310 buffer pages available. What is thefastest join algorithm to produce

the join of R and