Back to papers
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction
Summary: CaLiG tightens candidate maintenance to shrink backtracking in continuous subgraph matching over streaming graphs. KSS splits queries into kernel and shell vertices, enabling backtracking-free incremental matches by joining shell candidates; yields orders-of-magnitude speedups versus prior work.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6519
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 5.1234789e-05
- Overall Rank
- 6,283 | 56.34%
- DOI
-
10.1145/3588695
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 7,456 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.7205339e-05 |
| 9,375 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
4.3452177e-05 |
| 9,726 |
MatCo: Computing Match Cover of Subgraph Query over Graph Data |
2025 |
SIGMOD |
4.2901665e-05 |
| 9,729 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2901665e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,139 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,232 |
Efficient Temporal Subgraph Management: A New Interval Index |
2026 |
VLDB |
4.1905499e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
4.1905499e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1905499e-05 |
| 10,276 |
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs |
2026 |
VLDB |
4.1905499e-05 |
| 10,304 |
Aquila: A High-Concurrency System for Incremental Graph Query |
2026 |
VLDB |
4.1905499e-05 |
| 10,640 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.1905499e-05 |
| 10,715 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
4.1905499e-05 |
| 10,740 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 172 |
Algorithmics and Applications of Tree and Graph Searching |
2002 |
PODS |
0.00038837872 |
| 327 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027312381 |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,392 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012224015 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 1,715 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010776518 |
| 1,746 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.0001069135 |
| 1,806 |
Incremental Graph Pattern Matching |
2011 |
SIGMOD |
0.00010478244 |
| 2,178 |
Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs |
2014 |
VLDB |
9.3645765e-05 |
| 2,609 |
Graph Stream Summarization: From Big Bang to Big Crunch |
2016 |
SIGMOD |
8.4587236e-05 |
| 2,882 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9666138e-05 |
| 4,091 |
RisGraph: A Real-Time Streaming System for Evolving Graphs to Support Sub-millisecond Per-update Analysis at Millions Ops/s |
2021 |
SIGMOD |
6.4529617e-05 |
| 5,017 |
Event Pattern Matching over Graph Streams |
2015 |
VLDB |
5.7505967e-05 |
| 5,490 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
5.4788004e-05 |
| 5,573 |
iTurboGraph: Scaling and Automating Incremental Graph Analytics |
2021 |
SIGMOD |
5.4268881e-05 |
| 6,516 |
StreamWorks - A system for Dynamic Graph Search |
2013 |
SIGMOD |
5.0263759e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,806 |
Incremental Graph Pattern Matching |
2011 |
SIGMOD |
0.00010478244 |
| 7,456 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.7205339e-05 |
| 9,936 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
4.2441896e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1905499e-05 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 9,375 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
4.3452177e-05 |
| 6,391 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0780425e-05 |
| 10,139 |
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] |
2026 |
SIGMOD |
4.1905499e-05 |
| 5,921 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.2681722e-05 |
| 9,729 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2901665e-05 |