Question: Suppose you want to compute A,Bsum(C) on a relation s which is stored partitioned on s.B. Explain how you would do it efficiently, minimizing/avoiding repartitioning,
Suppose you want to compute A,Bγsum(C) on a relation s which is stored partitioned on s.B. Explain how you would do it efficiently, minimizing/avoiding repartitioning, if the number of distinct s.B values is large, and the distribution of number of tuples with each s.B value is relatively uniform.
Step by Step Solution
3.39 Rating (165 Votes )
There are 3 Steps involved in it
Assuming you want to compute ABsumC on a relation s which is stored pa... View full answer
Get step-by-step solutions from verified subject matter experts
