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.9793485e-05
Overall Rank: 10,555 | 29.04%
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.00034860244
288	Graphs-at-a-time: Query Language and Access Methods for Graph Databases	2008	SIGMOD	0.00021969641
355	On Graph Query Optimization in Large Networks	2010	VLDB	0.00020124083
438	Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism	2008	VLDB	0.00018286607
443	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018197688
490	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017438618
657	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.0001505607
812	The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates	2017	SIGMOD	0.00013729015
937	Real-time Constrained Cycle Detection in Large Dynamic Graphs	2018	VLDB	0.00012977594
960	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD	0.00012836554
1,045	Graphflow: An Active Graph Database	2017	SIGMOD	0.00012322402
1,100	CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching	2019	SIGMOD	0.00012013426
1,148	Graph Pattern Matching: From Intractable to Polynomial Time	2010	VLDB	0.00011809728
1,180	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00011627669
1,181	An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases	2013	VLDB	0.00011627329
1,317	Incremental Graph Pattern Matching	2011	SIGMOD	0.00011050011
1,506	Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs	2015	VLDB	0.00010452205
2,194	Monitoring Path Nearest Neighbor in Road Networks	2009	SIGMOD	8.8805644e-05
2,211	TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data	2018	SIGMOD	8.8237249e-05
3,687	Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks	2022	SIGMOD	7.0955331e-05
4,583	Event Pattern Matching over Graph Streams	2015	VLDB	6.5187824e-05
4,634	Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice	2020	VLDB	6.4933103e-05
4,779	Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming	2021	VLDB	6.4163774e-05
5,218	Efficient Streaming Subgraph Isomorphism with Graph Neural Networks	2021	VLDB	6.2231041e-05
5,984	An In-Depth Study of Continuous Subgraph Matching	2022	VLDB	5.926237e-05
6,045	PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration	2021	SIGMOD	5.9054678e-05
6,232	Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding	2024	VLDB	5.84313e-05
9,461	SmartBench: Demonstrating Automatic Generation of Comprehensive Benchmarks for Question Answering Over Knowledge Graphs	2022	VLDB	5.1734054e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	443	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB
2	4,587	Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction	2023	SIGMOD
3	10,245	Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query	2020	SIGMOD
4	10,062	TC-Match: Fast Time-constrained Continuous Subgraph Matching	2024	VLDB
5	5,477	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD
6	4,075	A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction	2024	SIGMOD
7	11,053	Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching	2026	VLDB
8	4,779	Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming	2021	VLDB
9	6,232	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