Back to papers
RapidFlow: An Efficient Approach to Continuous Subgraph Matching
Summary: RapidFlow turns CSM into batch subgraph matching by enumerating all results in the region affected by an update, enabling better matching orders. It removes automorphism-driven duplicates via dual matching with Q-G duality, delivering up to two orders of magnitude speedups over TurboFlux and SymBi.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12734
- Venue
- VLDB
- Year
- 2022
- Pagerank
- 5.2681722e-05
- Overall Rank
- 5,921 | 58.85%
- DOI
-
10.14778/3551793.3551803
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-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 |
| 9,935 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
4.2456012e-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,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 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 341 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026850764 |
| 502 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021528261 |
| 610 |
Design and Implementation of the LogicBlox System |
2015 |
SIGMOD |
0.00019204048 |
| 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,419 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012072488 |
| 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,882 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9666138e-05 |
| 2,963 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.8061004e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 4,536 |
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice |
2020 |
VLDB |
6.099154e-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,809 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
5.3175972e-05 |
| 6,207 |
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration |
2021 |
SIGMOD |
5.1519085e-05 |
Semantically Similar Papers