Ask Question
27 July, 08:06

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?

+1
Answers (1)
  1. 27 July, 08:18
    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?
Find 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 the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers