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
- 2. Chunming Hu
- 3. Chao Tian
Incoming Citations (Sorted by Pagerank)
Showing 25 of 25 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 |
|---|---|---|---|---|
| 97 | Maintaining Views Incrementally | 1993 | SIGMOD | 0.00050863077 |
| 302 | BLINKS: Ranked Keyword Searches on Graphs | 2007 | SIGMOD | 0.00028343691 |
| 337 | Bidirectional Expansion For Keyword Search on Graph Databases | 2005 | VLDB | 0.00027002505 |
| 441 | Parallelizing Sequential Graph Computations | 2017 | SIGMOD | 0.00023172424 |
| 1,428 | Algorithms for Deferred View Maintenance | 1996 | SIGMOD | 0.00012030912 |
| 1,663 | Incremental Maintenance for Materialized Views over Semistructured Data | 1998 | VLDB | 0.00010961643 |
| 1,806 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00010478244 |
| 3,188 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD | 7.4142307e-05 |
| 3,478 | Functional Dependencies for Graphs | 2016 | SIGMOD | 7.0554625e-05 |
| 4,207 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3519481e-05 |
| 6,119 | Distributed Graph Simulation: Impossibility and Possibility | 2014 | VLDB | 5.1991813e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,195 | Incrementalization of Graph Partitioning Algorithms | 2020 | VLDB | 5.1583102e-05 |
| 10,717 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB | 4.1905499e-05 |
| 5,573 | iTurboGraph: Scaling and Automating Incremental Graph Analytics | 2021 | SIGMOD | 5.4268881e-05 |
| 7,179 | A Hierarchical Contraction Scheme for Querying Big Graphs | 2022 | SIGMOD | 4.803776e-05 |
| 2,852 | Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs | 2019 | SIGMOD | 8.0158741e-05 |
| 1,572 | Query Preserving Graph Compression | 2012 | SIGMOD | 0.00011296109 |
| 9,805 | Automating Incremental Graph Processing with Flexible Memoization | 2021 | VLDB | 4.2766788e-05 |
| 4,207 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3519481e-05 |
| 1,806 | Incremental Graph Pattern Matching | 2011 | SIGMOD | 0.00010478244 |
| 5,266 | Incrementalizing Graph Algorithms | 2021 | SIGMOD | 5.5949839e-05 |