About this document
Efficient MapReduce with Monoids by olwenntaron1707 is a document available to read on EtoBox.
This document discusses using monoids as a design principle for efficient MapReduce algorithms. It uses finding the average of integer values by key as a running example. Naively, mappers emit key-value pairs and reducers compute the average. However, this is inefficient due to network shuffling. The document proposes using combiners to partially aggregate results before shuffling. However, a simple combiner that computes partial means does not work because it violates type constraints of the MapReduce mode
- Author
- olwenntaron1707
- Language
- EN