Question: Let relations r1 (A, B, C), r2 (C, D, E), output= r1 r2 have the following properties: r1 has 20,000 tuples, r2 has 45,000 tuples,
Let relations r1 (A, B, C), r2 (C, D, E), output= r1 r2 have the following properties: r1 has 20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one page, and 30 tuples of r 2 fit on one page. Each tuple of r1 joins with exactly with 1 tuple of r2 and 10 tuples of output fit on one page. Estimate the number of page transfers required, using an index nested loop join.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
