Application Driven Graph Partitioning
Summary: Application-driven hybrid partitioning learns a cost model for A via poly regression to refine edge-cut/vertex-cut into a hybrid partition. Identifies a condition for partition transparency; yields up to 22.5x speedups on real/synthetic graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan (Beihang University; Shenzhen University; University of Edinburgh)
- 2. Ruochun Jin (University of Edinburgh)
- 3. Muyang Liu (University of Edinburgh)
- 4. Ping Lu (Beihang University)
- 5. Xiaojian Luo (Alibaba)
- 6. Ruiqi Xu (University of Edinburgh)
- 7. Qiang Yin (Alibaba)
- 8. Wenyuan Yu (Alibaba)
- 9. Jingren Zhou (Alibaba)
BibTeX Citation
@inproceedings{fan_sigmod20,
title = {{Application Driven Graph Partitioning}},
author = {Fan, Wenfei and Jin, Ruochun and Liu, Muyang and Lu, Ping and Luo, Xiaojian and Xu, Ruiqi and Yin, Qiang and Yu, Wenyuan and Zhou, Jingren},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3389745},
url = {https://dl.acm.org/doi/10.1145/3318464.3389745},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 956 | Parallelizing Sequential Graph Computations | 2017 | SIGMOD | 0.0001297452 |
| 1,803 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD | 9.724402e-05 |
| 2,332 | LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs | 2016 | VLDB | 8.7410236e-05 |
| 3,109 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD | 7.7482727e-05 |
| 3,225 | A Scalable Distributed Graph Partitioner | 2015 | VLDB | 7.6245396e-05 |
| 3,601 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 7.27018e-05 |
| 4,697 | Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent | 2019 | VLDB | 6.5575113e-05 |
| 6,599 | Adaptive Asynchronous Parallelization of Graph Algorithms | 2018 | SIGMOD | 5.8250554e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,892 | Dynamic Scaling for Parallel Graph Computations | 2019 | VLDB |
| 2 | 7,362 | A Study of Partitioning Policies for Graph Analytics on Large-scale Distributed Platforms | 2019 | VLDB |
| 3 | 3,752 | Distributed Edge Partitioning for Trillion-edge Graphs | 2019 | VLDB |
| 4 | 3,362 | Experimental Analysis of Streaming Algorithms for Graph Partitioning | 2019 | SIGMOD |
| 5 | 3,616 | Parallel Local Graph Clustering | 2016 | VLDB |
| 6 | 5,811 | Incrementalization of Graph Partitioning Algorithms | 2020 | VLDB |
| 7 | 5,610 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD |
| 8 | 2,221 | Streaming Graph Partitioning: An Experimental Study | 2018 | VLDB |
| 9 | 4,697 | Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent | 2019 | VLDB |
| 10 | 1,865 | An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing | 2017 | VLDB |