| Revision as of 15:24, 7 September 2005 editMarudubshinki (talk | contribs)49,641 editsNo edit summary← Previous edit | Revision as of 00:56, 8 September 2005 edit undo84.42.164.136 (talk) cs:Next edit → | ||
| Line 5: | Line 5: | ||
| ==References== | ==References== | ||
| * Dean, Jeffrey & Ghemawat, Sanjay (2004). . Retrieved Apr. 6, 2005. | * Dean, Jeffrey & Ghemawat, Sanjay (2004). . Retrieved Apr. 6, 2005. | ||
| ⚫ | {{Compu-soft-stub}} | ||
| ] | ] | ||
| ] | |||
| ⚫ | {{Compu-soft-stub}} | ||
Revision as of 00:56, 8 September 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.
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. |