Question: Consider a query R 1 | > | R 2 | > | R 3 | > | R 4 . A left - deep

Consider a query R1|>|R2|>|R3|>|R4. A "left-deep join tree" is shown below. X1-X2 are intermediate
relations produced in the plans. It is known that R1-R4 each has 10000 tuples and takes 1000 blocks.
X1-X2 each has 10000 tuples. Only 4 blocks of memory are available. All join operators are (tuple-
based) nested loop join. All the plans are fully pipelined. What is the number of data blocks (number
of I/Os) for the left-deep plan?
Figure 2: Left Deep Join
 Consider a query R1|>|R2|>|R3|>|R4. A "left-deep join tree" is shown below.

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!