Question: Suppose relation r is stored partitioned and indexed on A, and s is stored partitioned and indexed on B. Consider the query: a. Give a
Suppose relation r is stored partitioned and indexed on A, and s is stored partitioned and indexed on B. Consider the query:
![]()
a. Give a parallel query plan using the exchange operator, for computing the subtree of the query involving only the select and join operators.
b. Now extend the above to compute the aggregate. Make sure to use preaggregation to minimize the data transfer.
c. Skew during aggregation is a serious problem. Explain how preaggregation as above can also significantly reduce the effect of skew during aggregation.
r.CY count(s.D) (4>5(r)) r.B=s.BS)
Step by Step Solution
3.34 Rating (157 Votes )
There are 3 Steps involved in it
a A parallel query plan using the exchange operator is In the first iteration execute AS on P1 and B... View full answer
Get step-by-step solutions from verified subject matter experts
