Assume you are using one machine with 201 buffer pages tocompute the join of two relations R(a,b) and S(b,c). Relation R isstored in 2000 pages and relation S is stored in 400 pages. Thejoin algorithm that you currently use is block-nested join with thecost of 6400.
Assume that you have received funding to buy a new machine, alsowith 201 buffer pages. Then, you can connect these two machines totransfer data between each other. Suppose the data com- municationcost is negligible. Suggest a join algorithm to reduce the cost ofjoin algorithm to 2400. Ignore the cost of writing the result backto disk.
Expert
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured