Digging around a bit, without much luck - there's the research blog post of a year ago: http://googleresearch.blogspot.com/2009/06/large-scale-graph-computing-a

Digging around a bit, without much luck - there's the research blog post of a year ago: http://googleresearch.blogspot.com/2009/06/large-scale-graph-computing-at-google.html http://googleresearch.blogspot.com/2009/06/large-scale-graph... (some comments there point to similar work.) Snippets: so far we haven't come across a type of graph or a practical graph computing problem which is not solvable with Pregel. It computes over large graphs much faster than alternatives, and the application programming interface is easy to use. Implementing PageRank, for example, takes only about 15 lines of code. spoiler: The seven bridges of Königsberg — inspiration for Leonhard Euler's famous theorem that established the basics of graph theory — spanned the Pregel river.