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)
Incoming Non-self Citations Over Time
Authors
- 1. Yutong Ye (East China Normal University)
- 2. Xiang Lian (Kent State University)
- 3. Mingsong Chen (East China Normal University)
BibTeX Citation
@article{ye_vldb24,
title = {{Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding}},
author = {Ye, Yutong and Lian, Xiang and Chen, Mingsong},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {7},
pages = {1628--1641},
doi = {10.14778/3654621.3654630},
url = {https://doi.org/10.14778/3654621.3654630},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,461 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |
| 2 | 10,817 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 3 | 10,630 | Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings | 2026 | SIGMOD |
| 4 | 3,612 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB |
| 5 | 5,224 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB |
| 6 | 11,123 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB |
| 7 | 9,601 | S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB |
| 8 | 4,099 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 9 | 658 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 10 | 440 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |