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.9605343e-05
Overall Rank: 10,630 | 28.75%
DOI: 10.1145/3769774

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

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.00034749222
288	Graphs-at-a-time: Query Language and Access Methods for Graph Databases	2008	SIGMOD	0.00022009138
356	On Graph Query Optimization in Large Networks	2010	VLDB	0.00020086045
439	Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism	2008	VLDB	0.00018247958
440	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018235529
485	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017479773
658	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00015032442
815	The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates	2017	SIGMOD	0.00013682594
942	Real-time Constrained Cycle Detection in Large Dynamic Graphs	2018	VLDB	0.00012936571
952	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD	0.00012878316
1,049	Graphflow: An Active Graph Database	2017	SIGMOD	0.00012293903
1,090	CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching	2019	SIGMOD	0.00012062682
1,148	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00011777466
1,171	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00011677799
1,180	An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases	2013	VLDB	0.00011600363
1,323	Incremental Graph Pattern Matching	2011	SIGMOD	0.00011019578
1,502	Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs	2015	VLDB	0.00010431532
2,206	Monitoring Path Nearest Neighbor in Road Networks	2009	SIGMOD	8.850101e-05
2,226	TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data	2018	SIGMOD	8.7971869e-05
3,676	Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks	2022	SIGMOD	7.0882436e-05
4,601	Event Pattern Matching over Graph Streams	2015	VLDB	6.4964963e-05
4,658	Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice	2020	VLDB	6.468776e-05
4,801	Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming	2021	VLDB	6.3940913e-05
5,224	Efficient Streaming Subgraph Isomorphism with Graph Neural Networks	2021	VLDB	6.2100595e-05
5,995	An In-Depth Study of Continuous Subgraph Matching	2022	VLDB	5.903845e-05
6,061	PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration	2021	SIGMOD	5.8831543e-05
6,245	Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding	2024	VLDB	5.8210521e-05
9,500	SmartBench: Demonstrating Automatic Generation of Comprehensive Benchmarks for Question Answering Over Knowledge Graphs	2022	VLDB	5.153858e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	4,485	Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction	2023	SIGMOD
2	440	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB
3	10,281	Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query	2020	SIGMOD
4	10,101	TC-Match: Fast Time-constrained Continuous Subgraph Matching	2024	VLDB
5	5,486	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD
6	4,099	A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction	2024	SIGMOD
7	11,123	Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching	2026	VLDB
8	4,801	Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming	2021	VLDB
9	6,245	Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding	2024	VLDB
10	5,995	An In-Depth Study of Continuous Subgraph Matching	2022	VLDB