Back to papers
Enumerating Graph Pattern Matches with ML Oracles
Summary: ML-guided SubIso enumeration: revise VF3 with an oracle that ranks candidate matches, then verify to prune backtracking. Establish EnumP-completeness plus sharp tradeoffs among output-polynomiality, consistency, and robustness; empirically up to 21x speedup.
(summarized by gpt-5-mini on Apr 11 2026)
- Paper ID
- 7475
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,163 | 29.37%
- DOI
-
10.1145/3786648
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 22 of 22 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 101 |
The Case for Learned Index Structures |
2018 |
SIGMOD |
0.00049778866 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,444 |
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs |
2010 |
VLDB |
0.00011941836 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 1,715 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010776518 |
| 2,201 |
LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms |
2016 |
VLDB |
9.3042485e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 3,478 |
Functional Dependencies for Graphs |
2016 |
SIGMOD |
7.0554625e-05 |
| 3,488 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
7.0460627e-05 |
| 3,781 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
6.7691344e-05 |
| 4,326 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.2772512e-05 |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 6,436 |
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding |
2024 |
VLDB |
5.0554554e-05 |
| 6,715 |
Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks |
2024 |
SIGMOD |
4.9464666e-05 |
| 6,885 |
Lotan: Bridging the Gap between GNNs and Scalable Graph Analytics Engines |
2023 |
VLDB |
4.8908367e-05 |
| 7,286 |
DAHA: Accelerating GNN Training with Data and Hardware Aware Execution Planning |
2024 |
VLDB |
4.7701372e-05 |
| 7,674 |
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale |
2022 |
VLDB |
4.677258e-05 |
| 9,086 |
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs |
2024 |
SIGMOD |
4.3947639e-05 |
| 9,726 |
MatCo: Computing Match Cover of Subgraph Query over Graph Data |
2025 |
SIGMOD |
4.2901665e-05 |
| 9,727 |
SPACE: Cardinality Estimation for Path Queries Using Cardinality-Aware Sequence-based Learning |
2025 |
SIGMOD |
4.2901665e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1905499e-05 |
| 2,021 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.7730473e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 2,963 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.8061004e-05 |
| 9,564 |
Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs |
2017 |
SIGMOD |
4.3212967e-05 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 11,569 |
Simulation-based Approximate Graph Pattern Matching |
2020 |
SIGMOD |
4.1905499e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 1,419 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012072488 |
| 11,563 |
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees |
2020 |
SIGMOD |
4.1905499e-05 |