Question: Solve only C and D Let relations r1(A, B,C) and r2(C, D, E) have the following properties: r1 has 10,000 tuples, r2 has 15,000 tuples,

 Solve only C and D Let relations r1(A, B,C) and r2(C,

Solve only C and D

Let relations r1(A, B,C) and r2(C, D, E) have the following properties: r1 has 10,000 tuples, r2 has 15,000 tuples, 25 tuples of r1 fit on one block, and 30 tuples of r2 fit on one block. Estimate the number of block transfers and seeks required, using each of the following join strategies for r1 r2: a) Nested-loop join. b) Block nested-loop join. c) Merge join. d) Indexed nested-loop join

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!