Back to papers
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding
Summary: GNN-PE: a GNN-derived path embedding with a dominance relation guaranteeing that data path embeddings dominate query path embeddings iff a subgraph (including 1‑hop neighbors) match exists—enabling sound pruning with no false dismissals. Uses multidimensional path indexes, parallel partitioned index traversal, and a cost-based planner to efficiently enumerate exact subgraph isomorphisms.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13404
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 5.0603113e-05
- Overall Rank
- 6,441 | 55.20%
- DOI
-
10.14778/3654621.3654630
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,096 |
NeuSO: Neural Optimizer for Subgraph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,163 |
Enumerating Graph Pattern Matches with ML Oracles |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 10,308 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
4.1945683e-05 |
| 10,632 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,696 |
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics |
2025 |
VLDB |
4.1945683e-05 |
| 10,843 |
Machine Learning for Graph Data Management and Query Processing |
2025 |
VLDB |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 26 of 26 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 6 |
The R*-tree: An Efficient and Robust Access Method for Points and Rectangles |
1990 |
SIGMOD |
0.0016162015 |
| 129 |
The X-tree: An Index Structure for High-Dimensional Data |
1996 |
VLDB |
0.0004429571 |
| 171 |
Algorithmics and Applications of Tree and Graph Searching |
2002 |
PODS |
0.00038830709 |
| 203 |
Graph Indexing: A Frequent Structure-based Approach |
2004 |
SIGMOD |
0.00034889335 |
| 342 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026795977 |
| 461 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022499343 |
| 506 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021475362 |
| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 647 |
Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure |
2001 |
SIGMOD |
0.00018668224 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 764 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017018712 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,333 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012523806 |
| 1,526 |
Monitoring Path Nearest Neighbor in Road Networks |
2009 |
SIGMOD |
0.00011512916 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 1,953 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9665955e-05 |
| 2,007 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.8081235e-05 |
| 3,036 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6735171e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 4,193 |
Relative Subboundedness of Contraction Hierarchy and Hierarchical 2-Hop Index in Dynamic Road Networks |
2022 |
SIGMOD |
6.37019e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 6,081 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
5.2208051e-05 |
| 8,765 |
Efficient Query Answering in Probabilistic RDF Graphs |
2011 |
SIGMOD |
4.456315e-05 |
| 9,208 |
SmartBench: Demonstrating Automatic Generation of Comprehensive Benchmarks for Question Answering Over Knowledge Graphs |
2022 |
VLDB |
4.3731258e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 11,559 |
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees |
2020 |
SIGMOD |
4.1945683e-05 |
| 3,752 |
Computing Graph Edit Distance via Neural Graph Matching |
2023 |
VLDB |
6.7879009e-05 |
| 10,062 |
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings |
2026 |
SIGMOD |
4.1945683e-05 |
| 3,873 |
Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases |
2012 |
VLDB |
6.6779082e-05 |
| 5,521 |
Efficient Streaming Subgraph Isomorphism with Graph Neural Networks |
2021 |
VLDB |
5.4614637e-05 |
| 10,308 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
4.1945683e-05 |
| 10,696 |
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics |
2025 |
VLDB |
4.1945683e-05 |
| 6,281 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.128862e-05 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |