In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework
Summary: Unified delta-query compilation framework for continuous subgraph matching, mapping diverse CSM methods to logical/physical plans over stacked views for apples-to-apples comparison. Comprehensive re-evaluation exposes prior misleading benchmarks and shows an older method can beat CaLiG by up to 48.6x. (summarized by gpt-5.4-mini on May 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yukyoung Lee (Pohang University of Science and Technology)
- 2. Kyoungmin Kim (Pohang University of Science and Technology)
- 3. Wonseok Lee (Pohang University of Science and Technology)
- 4. Wook-Shin Han (Pohang University of Science and Technology)
BibTeX Citation
@inproceedings{lee_sigmod24,
title = {{In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework}},
author = {Lee, Yukyoung and Kim, Kyoungmin and Lee, Wonseok and Han, Wook-Shin},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3654950},
url = {https://dl.acm.org/doi/10.1145/3654950},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,428 | An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] | 2026 | SIGMOD | 5.093636e-05 |
| 10,558 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 33 of 33 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 | 1,237 | In-Memory Subgraph Matching: An In-depth Study | 2020 | SIGMOD |
| 2 | 10,050 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD |
| 3 | 10,103 | Optimizing Differentially-Maintained Recursive Queries on Dynamic Graphs | 2022 | VLDB |
| 4 | 10,204 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD |
| 5 | 10,354 | Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings | 2026 | SIGMOD |
| 6 | 10,428 | An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] | 2026 | SIGMOD |
| 7 | 5,275 | RapidFlow: An Efficient Approach to Continuous Subgraph Matching | 2022 | VLDB |
| 8 | 9,872 | TC-Match: Fast Time-constrained Continuous Subgraph Matching | 2024 | VLDB |
| 9 | 4,995 | Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction | 2023 | SIGMOD |
| 10 | 5,870 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |