Let us join two relations R(a, b) and S(a, on attribute a using a merge join. Suppose B(R)=10,000 and B(S)=5,000. Assume a memory size of 101 blocks. If both R and S are already sorted on a, how many disk IOs are needed for a merge join?
A. 10000
B. 15000
C. 5000
D. 150000000
Answer:B
Let us join two relations R(a, b) and S(a, on attribute a using a merge join. Suppose B(R)=10,000 and B(S)=5,000. Assume a memory size of 101 blocks. If both R and S are already sorted on a, how many disk IOs are needed for a merge join?
A. 10000 B. 15000 C. 5000 D. 150000000