view article
Figure 4
A simple word count example to explain processing under the MapReduce framework. (a) The input is a series of words in a single document. (b) Each map scans part of the input. (c) An intermediate count of words is emitted by each map as a key-value pair. The word itself is the key and the count of its occurrence is the value. (d) Shuffle combines the intermediate key-values and passes them to reduce, where each reduce function obtains a distinct key along with all the intermediate values associated with that key. (e) Reduce computes the final count.

Journal logoJOURNAL OF
SYNCHROTRON
RADIATION
ISSN: 1600-5775
Volume 25| Part 4| July 2018| Pages 1135-1143
https://doi.org/10.1107/S160057751800601X
Follow J. Synchrotron Rad.
Sign up for e-alerts
E-alerts
Follow J. Synchrotron Rad. on Twitter
Twitter
Follow us on facebook
Facebook
Sign up for RSS feeds
RSS