Question

Let r and s be relations with no indices, and assume that the relations are not sorted. Assuming infinite memory, what is the lowest-cost way (in terms of I/O operations) to compute r?

Answer 1

Step-by-step explanation:

I can save the whole smaller relation in memory, read the larger relation block by block and carryout nested loop join using the larger one as the outer relation. The number of I/O operations is equal to Br + Bs