Incremental Graph Computations: Doable and Undoable
Summary: Incremental graph computations: for standard queries such as traversal, connectivity, and pattern matching the incremental problem is unbounded. Introduces localizable and bounded-by-batch notions; gives algorithms that localize updates or reuse batch checks, validated on real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan (Beihang University; University of Edinburgh)
- 2. Chunming Hu (Beihang University)
- 3. Chao Tian (Beihang University; University of Edinburgh)
BibTeX Citation
@inproceedings{fan_sigmod17,
title = {{Incremental Graph Computations: Doable and Undoable}},
author = {Fan, Wenfei and Hu, Chunming and Tian, Chao},
series = {{SIGMOD} '17},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3055918.3055944},
url = {https://dl.acm.org/doi/10.1145/3055918.3055944},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 26 of 26 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 62 | Maintaining Views Incrementally | 1993 | SIGMOD | 0.00039045511 |
| 270 | BLINKS: Ranked Keyword Searches on Graphs | 2007 | SIGMOD | 0.00022599109 |
| 293 | Bidirectional Expansion For Keyword Search on Graph Databases | 2005 | VLDB | 0.00021943678 |
| 947 | Parallelizing Sequential Graph Computations | 2017 | SIGMOD | 0.00012914714 |
| 1,150 | Algorithms for Deferred View Maintenance | 1996 | SIGMOD | 0.00011809311 |
| 1,317 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00011050011 |
| 1,879 | Incremental Maintenance for Materialized Views over Semistructured Data | 1998 | VLDB | 9.4424426e-05 |
| 3,026 | Functional Dependencies for Graphs | 2016 | SIGMOD | 7.7387829e-05 |
| 3,066 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.6877117e-05 |
| 4,551 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.5401646e-05 |
| 5,953 | Distributed Graph Simulation: Impossibility and Possibility | 2014 | VLDB | 5.9359492e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,926 | Incrementalization of Graph Partitioning Algorithms | 2020 | VLDB |
| 2 | 11,341 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB |
| 3 | 5,684 | iTurboGraph: Scaling and Automating Incremental Graph Analytics | 2021 | SIGMOD |
| 4 | 7,015 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD |
| 5 | 1,375 | Query Preserving Graph Compression | 2012 | SIGMOD |
| 6 | 2,285 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD |
| 7 | 10,157 | Automating Incremental Graph Processing with Flexible Memoization | 2021 | VLDB |
| 8 | 4,551 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD |
| 9 | 1,317 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 10 | 4,540 | Incrementalizing Graph Algorithms | 2021 | SIGMOD |