TC-Match: Fast Time-constrained Continuous Subgraph Matching
Summary: TC-Match tackles time-constrained continuous subgraph matching on streaming graphs, enforcing structural isomorphism plus query timing-order constraints for real-time apps. Core: CSS, an edge-centric k-partite index capturing partial embeddings/timing and an incremental node-merging matcher — up to 3 orders of magnitude faster and ~49–87% less memory. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jianye Yang (Guangdong University of Technology; Peng Cheng Laboratory)
- 2. Sheng Fang (Guangdong University of Technology)
- 3. Zhaoquan Gu (Harbin Engineering University; Peng Cheng Laboratory)
- 4. Ziyi Ma (Hebei University of Technology)
- 5. Xuemin Lin (Shanghai Jiao Tong University)
- 6. Zhihong Tian (Guangdong University of Technology)
BibTeX Citation
@article{yang_vldb24,
title = {{TC-Match: Fast Time-constrained Continuous Subgraph Matching}},
author = {Yang, Jianye and Fang, Sheng and Gu, Zhaoquan and Ma, Ziyi and Lin, Xuemin and Tian, Zhihong},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {2791--2804},
doi = {10.14778/3681954.3681963},
url = {https://doi.org/10.14778/3681954.3681963},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,689 | An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] | 2026 | SIGMOD | 4.9605343e-05 |
| 10,776 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 4.9605343e-05 |
| 11,349 | Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach | 2025 | VLDB | 4.9605343e-05 |
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 | 4,601 | Event Pattern Matching over Graph Streams | 2015 | VLDB |
| 2 | 440 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 3 | 2,202 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD |
| 4 | 10,689 | An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] | 2026 | SIGMOD |
| 5 | 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |
| 6 | 4,801 | Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming | 2021 | VLDB |
| 7 | 5,404 | RapidFlow: An Efficient Approach to Continuous Subgraph Matching | 2022 | VLDB |
| 8 | 2,226 | TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data | 2018 | SIGMOD |
| 9 | 5,995 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |
| 10 | 4,485 | Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction | 2023 | SIGMOD |