This is an old revision of this page, as edited by Marudubshinki (talk | contribs) at 17:00, 19 December 2005 (→Other Implementations). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 17:00, 19 December 2005 by Marudubshinki (talk | contribs) (→Other Implementations)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)In Google's MapReduce programming model, parallel computations over large data sets are implemented by specifying a Map function that maps key-value pairs to new key-value pairs and a subsequent Reduce function that consolidates all mapped key-value pairs sharing the same keys to single key-value pairs.
MapReduce is often used in conjunction with Google File System, for greater parallelization.
Other Implementations
The Nutch project has developed an experimental implementation of MapReduce.
References
- Dean, Jeffrey & Ghemawat, Sanjay (2004). "MapReduce: Simplified Data Processing on Large Clusters". Retrieved Apr. 6, 2005.
 | This software article is a stub. You can help Misplaced Pages by expanding it. |