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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xiangyang Gou (University of New South Wales)
- 2. Lei Zou (Peking University)
- 3. Jeffrey Xu Yu (Hong Kong University of Science and Technology)
- 4. Wenjie Zhang (University of New South Wales)
BibTeX Citation
@inproceedings{gou_sigmod26,
title = {{An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments \& Analysis]}},
author = {Gou, Xiangyang and Zou, Lei and Yu, Jeffrey Xu and Zhang, Wenjie},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786623},
url = {https://dl.acm.org/doi/10.1145/3786623},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,404 | RapidFlow: An Efficient Approach to Continuous Subgraph Matching | 2022 | VLDB |
| 2 | 9,179 | In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework | 2024 | SIGMOD |
| 3 | 10,630 | Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings | 2026 | SIGMOD |
| 4 | 440 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 5 | 2,387 | Towards Graph Containment Search and Indexing | 2007 | VLDB |
| 6 | 10,289 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD |
| 7 | 10,101 | TC-Match: Fast Time-constrained Continuous Subgraph Matching | 2024 | VLDB |
| 8 | 4,485 | Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction | 2023 | SIGMOD |
| 9 | 4,099 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 10 | 5,995 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |