Question: Consider a query R 1 | > | R 2 | > | R 3 | > | R 4 . A left - deep
Consider a query A "leftdeep join tree" is shown below. XX are intermediate
relations produced in the plans. It is known that RR each has tuples and takes blocks.
XX each has tuples. Only 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 IOs for the leftdeep plan?
Figure : Left Deep Join
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
