| Revision as of 10:27, 19 December 2005 editMParaz (talk | contribs)90 edits Nutch implementation← Previous edit | Revision as of 17:00, 19 December 2005 edit undoMarudubshinki (talk | contribs)49,641 edits →Other ImplementationsNext edit → | ||
| Line 4: | Line 4: | ||
| ==Other Implementations== | ==Other Implementations== | ||
| ] has an experimental implementation |
The ] project has developed an experimental implementation of MapReduce. | ||
| ==References== | ==References== | ||
Revision as of 17:00, 19 December 2005
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. |