Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing
Summary: Hybrid push/pull for I/O-efficient distributed and iterative graph computing on disk-resident data. Proposes b-pull, a block-centric pull that clusters vertices and edges to shift I/O from receivers to senders, coupled with a seamless push/pull switch and a performance predictor to adapt to workloads. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhigang Wang (Northeastern University)
- 2. Yu Gu (Northeastern University)
- 3. Yubin Bao (Northeastern University)
- 4. Ge Yu (Northeastern University)
- 5. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{wang_sigmod16,
title = {{Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing}},
author = {Wang, Zhigang and Gu, Yu and Bao, Yubin and Yu, Ge and Yu, Jeffrey Xu},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2882938},
url = {https://dl.acm.org/doi/10.1145/2882903.2882938},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,323 | TurboGraph++: A Scalable and Fast Graph Analytics System | 2018 | SIGMOD | 6.7608401e-05 |
| 9,478 | Parallel Query Processing: To Separate Communication from Computation | 2022 | SIGMOD | 5.2634238e-05 |
| 11,963 | My Weak Consistency is Strong: When Bad Things Do Not Come in Threes | 2017 | CIDR | 5.093636e-05 |
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 |
| 20 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00056944564 |
| 372 | HaLoop: Efficient Iterative Data Processing on Large Clusters | 2010 | VLDB | 0.0001981521 |
| 436 | Trinity: A Distributed Graph Engine on a Memory Cloud | 2013 | SIGMOD | 0.00018504439 |
| 487 | From "Think Like a Vertex" to "Think Like a Graph" | 2014 | VLDB | 0.00017645653 |
| 937 | Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs | 2014 | VLDB | 0.00013091546 |
| 1,116 | Large Graph Processing in the Cloud | 2010 | SIGMOD | 0.0001210972 |
| 1,983 | Pregelix: Big(ger) Graph Analytics on A Dataflow Engine | 2015 | VLDB | 9.3544951e-05 |
| 5,675 | MOCgraph: Scalable Distributed Graph Processing Using Message Online Computing | 2015 | VLDB | 6.1252874e-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 | 9,624 | RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries | 2025 | VLDB |
| 3 | 9,616 | ACGraph: An Efficient Asynchronous Out-of-Core Graph Processing Framework | 2026 | SIGMOD |
| 4 | 1,246 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 5 | 10,207 | Bw-Graph: An Efficient Graph Storage System Harmonizing Topology-Aware Tree with Paged CSR | 2026 | SIGMOD |
| 6 | 9,218 | GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations | 2015 | VLDB |
| 7 | 7,201 | An I/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs | 2022 | VLDB |
| 8 | 1,875 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 9 | 1,911 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB |
| 10 | 3,109 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD |