A Study of Partitioning Policies for Graph Analytics on Large-scale Distributed Platforms
Summary: Large-scale KNL/Skylake experiments show Cartesian Vertex-Cut outscales Edge-Cut despite higher replication and communication, because communication topology matters beyond volume. Advocates multi-policy systems and a computation/cluster-driven selection tree. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Gurbinder Gill (University of Texas)
- 2. Roshan Dathathri (University of Texas)
- 3. Loc Hoang (University of Texas)
- 4. Keshav Pingali (University of Texas)
BibTeX Citation
@article{gill_vldb19,
title = {{A Study of Partitioning Policies for Graph Analytics on Large-scale Distributed Platforms}},
author = {Gill, Gurbinder and Dathathri, Roshan and Hoang, Loc and Pingali, Keshav},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {4},
pages = {321--334},
doi = {10.14778/3297753.3297754},
url = {https://doi.org/10.14778/3297753.3297754},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,262 | Single Machine Graph Analytics on Massive Datasets Using Intel Optane DC Persistent Memory | 2020 | VLDB | 7.469821e-05 |
| 7,036 | Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study | 2025 | VLDB | 5.5993909e-05 |
| 9,942 | Scalable Graph Convolutional Network Training on Distributed-Memory Systems | 2023 | VLDB | 5.0923288e-05 |
| 10,528 | FaaSBoard: Efficient Graph Processing with a Disaggregated Architecture on Serverless Services | 2026 | SIGMOD | 4.9605343e-05 |
| 10,747 | R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization | 2026 | SIGMOD | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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.0012089097 |
| 392 | One Trillion Edges: Graph Processing at Facebook-Scale | 2015 | VLDB | 0.0001917435 |
| 1,409 | State Management in Apache Flink: Consistent Stateful Distributed Stream Processing | 2017 | VLDB | 0.00010732706 |
| 1,904 | An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing | 2017 | VLDB | 9.3826079e-05 |
| 2,253 | Streaming Graph Partitioning: An Experimental Study | 2018 | VLDB | 8.743011e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,857 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 2 | 3,837 | Distributed Edge Partitioning for Trillion-edge Graphs | 2019 | VLDB |
| 3 | 4,445 | Application Driven Graph Partitioning | 2020 | SIGMOD |
| 4 | 3,167 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD |
| 5 | 1,847 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD |
| 6 | 5,743 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD |
| 7 | 11,594 | Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query Processing | 2024 | SIGMOD |
| 8 | 3,381 | Experimental Analysis of Streaming Algorithms for Graph Partitioning | 2019 | SIGMOD |
| 9 | 2,253 | Streaming Graph Partitioning: An Experimental Study | 2018 | VLDB |
| 10 | 1,904 | An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing | 2017 | VLDB |