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
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 ⋈ s? What is the amount of memory required for this algorithm?
Step by Step Solution
3.39 Rating (155 Votes )
There are 3 Steps involved in it
The amount of memory required for this algorithm the amoun... View full answer
Get step-by-step solutions from verified subject matter experts
