Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings
Summary: DIVINE maps vertex neighborhoods to dynamic vertex-dominance embeddings for continuous subgraph matching with efficient incremental maintenance on streaming graphs. Degree grouping and DAS3 synopses with dominance/range pruning decompose high-degree stars and accelerate incremental query processing. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yutong Ye (East China Normal University; Kent State University)
- 2. Xiang Lian (Kent State University)
- 3. Nan Zhang (East China Normal University)
- 4. Mingsong Chen (East China Normal University)
BibTeX Citation
@inproceedings{ye_sigmod26,
title = {{Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings}},
author = {Ye, Yutong and Lian, Xiang and Zhang, Nan and Chen, Mingsong},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769774},
url = {https://dl.acm.org/doi/10.1145/3769774},
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 28 of 28 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,995 | Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction | 2023 | SIGMOD |
| 2 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 3 | 10,050 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD |
| 4 | 9,872 | TC-Match: Fast Time-constrained Continuous Subgraph Matching | 2024 | VLDB |
| 5 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 6 | 4,983 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 7 | 10,606 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB |
| 8 | 4,722 | Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming | 2021 | VLDB |
| 9 | 6,149 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 10 | 5,870 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |