Incremental Graph Pattern Matching
Summary: Incremental graph pattern matching for dynamic graphs: simulation, bounded simulation, subgraph isomorphism. With unit-updates, simulation is linear-time; other patterns are unbounded or intractable; multi-update methods outperform batch. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenfei Fan (Harbin Engineering University; University of Edinburgh)
- 2. Jianzhong Li (Harbin Engineering University)
- 3. Jizhou Luo (Harbin Engineering University)
- 4. Zijing Tan (Fudan University)
- 5. Xin Wang (University of Edinburgh)
- 6. Yinghui Wu (University of Edinburgh)
BibTeX Citation
@inproceedings{fan_sigmod11,
title = {{Incremental Graph Pattern Matching}},
author = {Fan, Wenfei and Li, Jianzhong and Luo, Jizhou and Tan, Zijing and Wang, Xin and Wu, Yinghui},
series = {{SIGMOD} '11},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/1989323.1989420},
url = {https://dl.acm.org/doi/10.1145/1989323.1989420},
year = {2011}
}
Incoming Citations (Sorted by Pagerank)
Showing 39 of 39 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00011809728 |
| 1,879 | Incremental Maintenance for Materialized Views over Semistructured Data | 1998 | VLDB | 9.4424426e-05 |
| 2,194 | Monitoring Path Nearest Neighbor in Road Networks | 2009 | SIGMOD | 8.8805644e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,984 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |
| 2 | 657 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 3 | 4,075 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 4 | 3,979 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB |
| 5 | 12,059 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 6 | 5,605 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB |
| 7 | 2,851 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD |
| 8 | 4,540 | Incrementalizing Graph Algorithms | 2021 | SIGMOD |
| 9 | 12,065 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 10 | 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |