Back to papers
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)
Paper ID
hf9c44cca52aaa850
Venue
SIGMOD
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,566 | 28.99%
DOI
10.1145/3769774
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
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
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.
Rank
Cited Paper
Year
Venue
Pagerank
90
The X-tree: An Index Structure for High-Dimensional Data 1996
VLDB
0.00034847854
289
Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008
SIGMOD
0.00021960834
355
On Graph Query Optimization in Large Networks 2010
VLDB
0.00020116134
438
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008
VLDB
0.00018278591
443
Efficient Subgraph Matching on Billion Node Graphs 2012
VLDB
0.00018190518
489
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013
SIGMOD
0.00017440023
659
Efficient Subgraph Matching by Postponing Cartesian Products 2016
SIGMOD
0.00015048943
813
The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017
SIGMOD
0.00013722638
937
Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018
VLDB
0.00012971451
961
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019
SIGMOD
0.00012830477
1,046
Graphflow: An Active Graph Database 2017
SIGMOD
0.00012316579
1,100
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019
SIGMOD
0.00012007739
1,150
Graph Pattern Matching: From Intractable to Polynomial Time 2010
VLDB
0.00011804185
1,180
In-Memory Subgraph Matching: An In-depth Study 2020
SIGMOD
0.00011622165
1,181
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013
VLDB
0.00011621825
1,318
Incremental Graph Pattern Matching 2011
SIGMOD
0.00011044781
1,507
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015
VLDB
0.00010447258
2,196
Monitoring Path Nearest Neighbor in Road Networks 2009
SIGMOD
8.8763791e-05
2,212
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018
SIGMOD
8.8195478e-05
3,689
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks 2022
SIGMOD
7.0921741e-05
4,585
Event Pattern Matching over Graph Streams 2015
VLDB
6.5156965e-05
4,637
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice 2020
VLDB
6.4902365e-05
4,783
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021
VLDB
6.4133399e-05
5,223
Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021
VLDB
6.2201582e-05
5,984
An In-Depth Study of Continuous Subgraph Matching 2022
VLDB
5.9234316e-05
6,047
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021
SIGMOD
5.9026722e-05
6,235
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024
VLDB
5.8403639e-05
9,470
SmartBench: Demonstrating Automatic Generation of Comprehensive Benchmarks for Question Answering Over Knowledge Graphs 2022
VLDB
5.1709564e-05
Semantically Similar Papers
#
Overall Rank
Paper
Year
Venue
1
443
Efficient Subgraph Matching on Billion Node Graphs 2012
VLDB
2
4,589
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023
SIGMOD
3
10,251
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query 2020
SIGMOD
4
10,067
TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024
VLDB
5
4,077
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024
SIGMOD
6
5,481
Diversified Top-k Subgraph Querying in a Large Graph 2016
SIGMOD
7
11,062
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026
VLDB
8
4,783
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021
VLDB
9
6,235
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024
VLDB
10
5,984
An In-Depth Study of Continuous Subgraph Matching 2022
VLDB