FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition
Summary: Proposes FSM, a two-phase fine-grained splitting-and-merging framework that minimizes cut size while enforcing dual-balance (vertex and edge) and can integrate with existing single-balanced partitioners. Introduces Fast and Precise Merging for efficiency/quality trade-offs and reports SOTA cut reduction with up to ~18% downstream runtime savings on PageRank/CC/diameter. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Chengjun Liu (Fudan University)
- 2. Zhuo Peng (Fudan University)
- 3. Weiguo Zheng (Fudan University)
- 4. Lei Zou (Peking University)
BibTeX Citation
@article{liu_vldb24,
title = {{FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition}},
author = {Liu, Chengjun and Peng, Zhuo and Zheng, Weiguo and Zou, Lei},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {9},
pages = {2378--2391},
doi = {10.14778/3665844.3665864},
url = {https://doi.org/10.14778/3665844.3665864},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 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 |
| 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015081844 |
| 1,865 | An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing | 2017 | VLDB | 9.5915721e-05 |
| 2,332 | LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs | 2016 | VLDB | 8.7410236e-05 |
| 3,601 | TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing | 2019 | VLDB | 7.27018e-05 |
| 3,752 | Distributed Edge Partitioning for Trillion-edge Graphs | 2019 | VLDB | 7.15217e-05 |
| 4,365 | Application Driven Graph Partitioning | 2020 | SIGMOD | 6.740899e-05 |
| 4,697 | Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent | 2019 | VLDB | 6.5575113e-05 |
| 5,610 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD | 6.1508076e-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 | 6,566 | Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning | 2024 | SIGMOD |
| 4 | 3,752 | Distributed Edge Partitioning for Trillion-edge Graphs | 2019 | VLDB |
| 5 | 5,252 | Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner | 2017 | VLDB |
| 6 | 4,697 | Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent | 2019 | VLDB |
| 7 | 3,362 | Experimental Analysis of Streaming Algorithms for Graph Partitioning | 2019 | SIGMOD |
| 8 | 3,225 | A Scalable Distributed Graph Partitioner | 2015 | VLDB |
| 9 | 5,610 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD |
| 10 | 2,221 | Streaming Graph Partitioning: An Experimental Study | 2018 | VLDB |