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, 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

TEMTFK The Asker · Computer Science

Solve only C and D

Transcribed Image Text: 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
More
Transcribed Image Text: 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