Suppose relation r is stored partitioned and indexed on A, and s is stored partitioned and indexed

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

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Database System Concepts

ISBN: 9780078022159

7th Edition

Authors: Abraham Silberschatz, Henry F. Korth, S. Sudarshan

Question Posted: