This document outlines the MapReduce process with 3 steps - Map, Shuffle and Sort, and Reduce. The Map step processes the input data in parallel across 4 partitions. The Shuffle and Sort step collects the output from the Map step and sorts it. The Reduce step then processes each unique key from the sorted output of the previous step to produce the final results.

1. STEP 0 –
STORE TO
HDFS
1 - MAP 2 – SHUFFLE
and SORT
3 - REDUCE
Assume 4 data
partitions.
( , __ )
( , __ )
( , __ )
( , __ )
( , __ )