Ask Question
1 April, 20:15

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?

+3
Answers (1)
  1. 1 April, 23:44
    0
    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
Know the Answer?
Not Sure About the Answer?
Get an answer to your 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 ...” in 📙 Business if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers