DBScholar

Back to papers

An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing

Summary: Empirical comparison of partitioning strategies in distributed graph systems, evaluating performance and resources across workloads. No single strategy dominates; outcomes depend on degree distribution, duration, cluster size, and PowerLyra results. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11734
Venue
VLDB
Year
2017
Pagerank
9.5915721e-05
Overall Rank
1,865 | 87.21%
DOI
10.14778/3055540.3055542

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{verma_vldb17,
        title = {{An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing}},
        author = {Verma, Shiv and Leslie, Luke M. and Shin, Yosub and Gupta, Indranil},
        journal = {PVLDB},
        series = {{VLDB} '17},
        volume = {10},
        number = {5},
        pages = {493--504},
        doi = {10.14778/3055540.3055542},
        url = {https://doi.org/10.14778/3055540.3055542},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 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.

Previous Page 1 / 1 Next

Semantically Similar Papers