Assume you are using one machine with 201 buffer pages to compute the join of tw

Question

Assume you are using one machine with 201 buffer pages to compute the join of two relations R(a,b) and S(b,c). Relation R is stored in 2000 pages and relation S is stored in 400 pages. The join algorithm that you currently use is block-nested join with the cost of 6400.

Assume that you have received funding to buy a new machine, also with 201 buffer pages. Then, you can connect these two machines to transfer data between each other. Suppose the data com- munication cost is negligible. Suggest a join algorithm to reduce the cost of join algorithm to 2400. Ignore the cost of writing the result back to disk.

Explanation / Answer

Solution:-

As you have asked only the type of join algorithm, that helps in reducing cost of join algorithm from 6400 to 2400, is the ideal one-pass join.

in that, Cost of join algorithm is:-

2000 + 400 = 2400.

++====================SOLUTION ENDS=======================

Note:- Please upvote, if it helped, else do comment on the part you need more explanation to, I'll be happy to help.

Thanks!!

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.