Automating Incremental Graph Processing with Flexible Memoization
Summary: Ingress automates incrementalization of batch vertex-centric algorithms into incremental counterparts without user redesign. It offers four memoization policies with applicability conditions and auto-selects the best policy, delivering ~16x average speedup (up to 147x) over prior systems. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shufeng Gong (Northeastern University)
- 2. Chao Tian (Alibaba)
- 3. Qiang Yin (Alibaba)
- 4. Wenyuan Yu (Alibaba)
- 5. Yanfeng Zhang (Northeastern University)
- 6. Liang Geng (Alibaba)
- 7. Song Yu (Northeastern University)
- 8. Ge Yu (Northeastern University)
- 9. Jingren Zhou (Alibaba)
BibTeX Citation
@article{gong_vldb21,
title = {{Automating Incremental Graph Processing with Flexible Memoization}},
author = {Gong, Shufeng and Tian, Chao and Yin, Qiang and Yu, Wenyuan and Zhang, Yanfeng and Geng, Liang and Yu, Song and Yu, Ge and Zhou, Jingren},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {9},
pages = {1613--1625},
doi = {10.14778/3461535.3461550},
url = {https://doi.org/10.14778/3461535.3461550},
year = {2021}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,857 | RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing | 2024 | VLDB | 5.7525746e-05 |
| 9,593 | GraphScope Flex: LEGO-like Graph Computing Stack | 2024 | SIGMOD | 5.2511057e-05 |
| 9,738 | GeaFlow: A Graph Extended and Accelerated Dataflow System | 2023 | SIGMOD | 5.227679e-05 |
| 10,950 | Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,749 | Auto-Approximation of Graph Computing | 2014 | VLDB |
| 2 | 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD |
| 3 | 2,243 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD |
| 4 | 10,950 | Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing | 2025 | VLDB |
| 5 | 10,954 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB |
| 6 | 1,911 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB |
| 7 | 1,296 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 8 | 5,567 | iTurboGraph: Scaling and Automating Incremental Graph Analytics | 2021 | SIGMOD |
| 9 | 2,798 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD |
| 10 | 4,443 | Incrementalizing Graph Algorithms | 2021 | SIGMOD |