Back to papers
TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing
Summary: TopoX uses topology refactorization (TR) to decouple comms and load balancing. Fusion merges low-degree neighborhoods into supernodes; fission splits hub nodes for better comm., enabling a pipeline beating PowerLyra by up to 78% on real graphs.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12014
- Venue
- VLDB
- Year
- 2019
- Pagerank
- 6.5174688e-05
- Overall Rank
- 4,025 | 72.03%
- DOI
-
10.14778/3324301.3324306
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 18 of 18 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 4 |
Pregel: A System for Large-Scale Graph Processing |
2010 |
SIGMOD |
0.0019040811 |
| 39 |
Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud |
2012 |
VLDB |
0.00075263552 |
| 330 |
An Architecture for Parallel Topic Models |
2010 |
VLDB |
0.00027271063 |
| 441 |
Parallelizing Sequential Graph Computations |
2017 |
SIGMOD |
0.00023172424 |
| 570 |
From "Think Like a Vertex" to "Think Like a Graph" |
2014 |
VLDB |
0.00019895021 |
| 773 |
Local Graph Sparsification for Scalable Clustering |
2011 |
SIGMOD |
0.00016788213 |
| 1,170 |
Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs |
2014 |
VLDB |
0.00013526297 |
| 1,876 |
Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation |
2015 |
VLDB |
0.00010242818 |
| 1,971 |
An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing |
2017 |
VLDB |
9.898018e-05 |
| 1,977 |
Towards Effective Partition Management for Large Graphs |
2012 |
SIGMOD |
9.8780062e-05 |
| 2,439 |
gSketch: On Query Estimation in Graph Streams |
2012 |
VLDB |
8.8181328e-05 |
| 2,596 |
LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs |
2016 |
VLDB |
8.4690558e-05 |
| 3,234 |
Managing Large Dynamic Graphs Efficiently |
2012 |
SIGMOD |
7.3302974e-05 |
| 3,239 |
Weaver: A High-Performance, Transactional Graph Database Based on Refinable Timestamps |
2016 |
VLDB |
7.3284186e-05 |
| 4,472 |
LogGP: A Log-based Dynamic Graph Partitioning Method |
2014 |
VLDB |
6.1486739e-05 |
| 4,487 |
On the Embeddability of Random Walk Distances |
2013 |
VLDB |
6.1412716e-05 |
| 5,014 |
TurboGraph++: A Scalable and Fast Graph Analytics System |
2018 |
SIGMOD |
5.7519428e-05 |
| 7,033 |
Vertex and Hyperedge Connectivity in Dynamic Graph Streams |
2015 |
PODS |
4.8514885e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 9,070 |
GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations |
2015 |
VLDB |
4.3982218e-05 |
| 11,031 |
FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition |
2024 |
VLDB |
4.1905499e-05 |
| 10,915 |
Topology-aware Parallel Joins |
2024 |
PODS |
4.1905499e-05 |
| 2,497 |
Streaming Graph Partitioning: An Experimental Study |
2018 |
VLDB |
8.6427191e-05 |
| 5,014 |
TurboGraph++: A Scalable and Fast Graph Analytics System |
2018 |
SIGMOD |
5.7519428e-05 |
| 570 |
From "Think Like a Vertex" to "Think Like a Graph" |
2014 |
VLDB |
0.00019895021 |
| 5,951 |
Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints |
2021 |
SIGMOD |
5.2547916e-05 |
| 6,443 |
Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning |
2024 |
SIGMOD |
5.0540558e-05 |
| 8,458 |
Topology-aware Parallel Data Processing: Models, Algorithms and Systems at Scale |
2020 |
CIDR |
4.5013189e-05 |
| 1,971 |
An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing |
2017 |
VLDB |
9.898018e-05 |