Back to papers
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming
Summary: SymBi enables symmetric continuous subgraph matching on dynamic graphs with bidirectional dynamic programming. It replaces the spanning-tree filter with a DAG-based auxiliary structure, enabling stronger pruning and up to three orders of magnitude faster performance than TurboFlux on real and synthetic datasets.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12321
- Venue
- VLDB
- Year
- 2021
- Pagerank
- 5.4788004e-05
- Overall Rank
- 5,490 | 61.85%
- DOI
-
10.14778/3457390.3457395
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 5,921 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.2681722e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 6,283 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
5.1234789e-05 |
| 6,391 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0780425e-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,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
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,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1905499e-05 |
| 10,304 |
Aquila: A High-Concurrency System for Incremental Graph Query |
2026 |
VLDB |
4.1905499e-05 |
| 10,478 |
AJOSC: Adaptive Join Order Selection for Continuous Queries |
2025 |
SIGMOD |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 20 of 20 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 502 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021528261 |
| 616 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00019068362 |
| 749 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017193776 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,334 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012543633 |
| 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 |
| 1,906 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010135267 |
| 2,021 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.7730473e-05 |
| 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 |
| 5,017 |
Event Pattern Matching over Graph Streams |
2015 |
VLDB |
5.7505967e-05 |
| 6,516 |
StreamWorks - A system for Dynamic Graph Search |
2013 |
SIGMOD |
5.0263759e-05 |
| 7,057 |
EAGr: Supporting Continuous Ego-centric Aggregate Queries over Large Dynamic Graphs |
2014 |
SIGMOD |
4.841817e-05 |
| 7,566 |
Extending Graph Patterns with Conditions |
2020 |
SIGMOD |
4.7047078e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 11,569 |
Simulation-based Approximate Graph Pattern Matching |
2020 |
SIGMOD |
4.1905499e-05 |
| 1,806 |
Incremental Graph Pattern Matching |
2011 |
SIGMOD |
0.00010478244 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 1,419 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012072488 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-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 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1905499e-05 |
| 6,391 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0780425e-05 |
| 2,882 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9666138e-05 |