DBScholar

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
11123
Venue
VLDB
Year
2014
Pagerank
8.7932254e-05
Overall Rank
2,295 | 84.26%
DOI
10.14778/2732286.2732290

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{salihoglu_vldb14,
        title = {{Optimizing Graph Algorithms on Pregel-like Systems}},
        author = {Salihoglu, Semih and Widom, Jennifer},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {7},
        pages = {577--588},
        doi = {10.14778/2732286.2732290},
        url = {https://doi.org/10.14778/2732286.2732290},
        year = {2014}
}

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
3 Pregel: A System for Large-Scale Graph Processing 2010 SIGMOD 0.0012250108
954 Parallel Evaluation of Conjunctive Queries 2011 PODS 0.00012997301
1,207 Communication Steps for Parallel Query Processing 2013 PODS 0.00011663155
1,514 Upper and Lower Bounds on the Cost of a Map-Reduce Computation 2013 VLDB 0.00010527649
Previous Page 1 / 1 Next

Semantically Similar Papers