Multiple choice technology

What is the lowest cost partitioning method for parallel stage to sequential stage?

  1. Sort Merge

  2. Round Robin

  3. Entire

  4. Ordered
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Round Robin is the lowest cost method for parallel-to-sequential flow because it simply gathers records from all partitions without any computation - it just collects rows in the order they arrive. Entire would broadcast all data (expensive), Sort Merge requires sorting, and Ordered needs coordination. Round Robin's collect operation has minimal overhead.

Keep practicing — related questions