Question: Let relations r1 (A, B, C) and r2 (C, D, E) have the following properties: r1 has 20,000 tuples, r2 has 45,000 tuples, 25 tuples
Let relations r1 (A, B, C) and r2 (C, D, E) have the following properties: r1 has 20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one block, and 30 tuples of r2 fit on one block. Estimate the number of block accesses required, using each of the following join strategies for r1 Θ r2:
a. Nested-loop joins
b. Block nested-loop joins
c. Merge joins
d. Hash joins
Step by Step Solution
3.51 Rating (161 Votes )
There are 3 Steps involved in it
r 1 needs 800 blocks and r 2 needs 1500 blocks Let us assume M pages of memory If M 800 the join can ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
16-CS-DB (292).docx
120 KBs Word File
