Back to papers
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis]
Summary: Decouples indexing vs. enumeration in continuous subgraph matching and systematically benchmarks CSM index designs. Shows how index choice depends on workload/memory, identifies dispensable components under space pressure, and argues candidate-count is a misleading filter-quality metric.
(summarized by gpt-5.4-mini on Apr 11 2026)
- Paper ID
- 7449
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,139 | 29.47%
- DOI
-
10.1145/3786623
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 24 of 24 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 342 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026795977 |
| 613 |
Design and Implementation of the LogicBlox System |
2015 |
SIGMOD |
0.00019181325 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 690 |
An Analytical Study of Large SPARQL Query Logs |
2018 |
VLDB |
0.00018099792 |
| 764 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017018712 |
| 1,056 |
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates |
2017 |
SIGMOD |
0.0001441128 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,333 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012523806 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,720 |
Incremental Graph Pattern Matching |
2011 |
SIGMOD |
0.00010779343 |
| 1,756 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.00010664542 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 2,007 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.8081235e-05 |
| 2,196 |
gStore: Answering SPARQL Queries via Subgraph Matching |
2011 |
VLDB |
9.3089621e-05 |
| 2,228 |
Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs |
2014 |
VLDB |
9.2385241e-05 |
| 2,912 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9130459e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 5,499 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
5.4750222e-05 |
| 5,926 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.271318e-05 |
| 6,395 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0829204e-05 |
| 6,575 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
5.0052259e-05 |
| 7,307 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
4.7674113e-05 |
| 9,366 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
4.3493859e-05 |
| 9,730 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2942813e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,926 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.271318e-05 |
| 9,366 |
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework |
2024 |
SIGMOD |
4.3493859e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1945683e-05 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 2,438 |
Towards Graph Containment Search and Indexing |
2007 |
VLDB |
8.8214248e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 9,730 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2942813e-05 |
| 6,575 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
5.0052259e-05 |
| 6,281 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.128862e-05 |
| 6,395 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0829204e-05 |