Streaming Graph Partitioning: An Experimental Study
Summary: Taxonomy and experiments on online streaming graph partitioning using a unified Flink runtime. Findings: low-cut partitioners excel for communication-heavy workloads but incur higher costs; model-agnostic approaches favor locality with lower costs in data-parallel graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zainab Abbas (KTH Royal Institute of Technology)
- 2. Vasiliki Kalavri (ETH Zurich)
- 3. Paris Carbone (KTH Royal Institute of Technology)
- 4. Vladimir Vlassov (KTH Royal Institute of Technology)
BibTeX Citation
@article{abbas_vldb18,
title = {{Streaming Graph Partitioning: An Experimental Study}},
author = {Abbas, Zainab and Kalavri, Vasiliki and Carbone, Paris and Vlassov, Vladimir},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {11},
pages = {1590--1603},
doi = {10.14778/3236187.3236208},
url = {https://doi.org/10.14778/3236187.3236208},
year = {2018}
}
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012092602 |
| 394 | One Trillion Edges: Graph Processing at Facebook-Scale | 2015 | VLDB | 0.00019191286 |
| 1,402 | State Management in Apache Flink: Consistent Stateful Distributed Stream Processing | 2017 | VLDB | 0.00010771949 |
| 1,907 | An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing | 2017 | VLDB | 9.397856e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,249 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 2 | 11,571 | FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition | 2024 | VLDB |
| 3 | 3,286 | A Scalable Distributed Graph Partitioner | 2015 | VLDB |
| 4 | 4,455 | Application Driven Graph Partitioning | 2020 | SIGMOD |
| 5 | 6,541 | A Holistic View of Stream Partitioning Costs | 2017 | VLDB |
| 6 | 5,730 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD |
| 7 | 6,687 | Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning | 2024 | SIGMOD |
| 8 | 7,476 | A Study of Partitioning Policies for Graph Analytics on Large-scale Distributed Platforms | 2019 | VLDB |
| 9 | 1,907 | An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing | 2017 | VLDB |
| 10 | 3,390 | Experimental Analysis of Streaming Algorithms for Graph Partitioning | 2019 | SIGMOD |