explains the methods used at google to make computations that are in principle easy, but in practice difficult because they need to be done on huge data sets. The principle is to decompose any computation in operations of type Map and Reduces
%0 Conference Paper
%1 dean2004map-reduce
%A Dean, Jeffrey
%A Ghemawat, Sanjay
%B OSDI
%D 2004
%K computation dataset, graph, large
%P 137--150
%T MapReduce: Simplified Data Processing on Large Clusters
%U http://www.usenix.org/events/osdi04/tech/dean.html
@inproceedings{dean2004map-reduce,
added-at = {2007-11-09T10:18:25.000+0100},
author = {Dean, Jeffrey and Ghemawat, Sanjay},
biburl = {https://www.bibsonomy.org/bibtex/21fc56b2c39922da949ea59c8796dbca8/sbattiston},
booktitle = {OSDI},
comment = {explains the methods used at google to make computations that are in principle easy, but in practice difficult because they need to be done on huge data sets. The principle is to decompose any computation in operations of type Map and Reduces},
folder = {graphs},
interhash = {c853fc61c156362ffecdf9302fe7c33f},
intrahash = {1fc56b2c39922da949ea59c8796dbca8},
keywords = {computation dataset, graph, large},
organization = {google labs},
pages = {137--150},
signalledby = {F. Walter},
timestamp = {2007-11-09T10:18:26.000+0100},
title = {MapReduce: Simplified Data Processing on Large Clusters},
url = {http://www.usenix.org/events/osdi04/tech/dean.html},
year = 2004
}