Database Paper Browser

Back to papers

Optimizing Graph Algorithms on Pregel-like Systems

Summary: Graph algorithms on Pregel-like systems: tackle slow convergence and high comm costs from diameter and skew by combining vertex-centric parallelism with a tiny serial input portion. Open-source Pregel; experiments on large graphs show runtime gains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10935
Venue
VLDB
Year
2014
Pagerank
9.0109891e-05
Overall Rank
2,336 | 83.76%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
4 Pregel: A System for Large-Scale Graph Processing 2010 SIGMOD 0.0019005923
1,110 Parallel Evaluation of Conjunctive Queries 2011 PODS 0.00013968198
1,308 Upper and Lower Bounds on the Cost of a Map-Reduce Computation 2013 VLDB 0.00012661651
1,411 Communication Steps for Parallel Query Processing 2013 PODS 0.0001212565
Previous Page 1 / 1 Next

Semantically Similar Papers