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

and indexed on B$.$ Consider the query: r$.$C$\backslash$gamma count$($s$.$D$)((\backslash$sigma A$>5($r$))$r$.$B$=$s$.$B

s

$)$

i Give a parallel query plan using the exchange operator, for computing the

subtree of the query involving only the select and join operators.

ii Now extend the above to compute the aggregate. Make sure to use preaggregation

to minimize the data transfer.