Question: Comparison of join algorithms. Consider two relations rl and r2 with schemas R1(ABC) and R2(CDE). Suppose we know that ri has 10,000 tuples, r2 has

Comparison of join algorithms. Consider two relations rl and r2 with schemas R1(ABC) and R2(CDE). Suppose we know that ri has 10,000 tuples, r2 has 15,000 tuples, 25 tuples of r fit on one block, and 20 tuples of r2 fit on one block. Assume that there are M-400 pages available in the memory. Estimate the number of block transfers and seeks required, using each of the following join strategies for ri x r2 (show your work): () Nested-loop join (i) Block-nested loop join iii) Merge join (iv) Hash Join
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
