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
7665
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,452 | 28.30%
DOI
10.1145/3786648
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
BibTeX Citation
Copy BibTeX
@inproceedings{fan_sigmod26,
title = {{Enumerating Graph Pattern Matches with ML Oracles}},
author = {Fan, Wenfei and Luo, Yixuan and Lu, Ping and Zhu, Xiaoke},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786648},
url = {https://dl.acm.org/doi/10.1145/3786648},
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 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
43
The Case for Learned Index Structures
2018
SIGMOD
0.00046060254
659
Efficient Subgraph Matching by Postponing Cartesian Products
2016
SIGMOD
0.00015214062
1,006
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
2019
SIGMOD
0.00012699518
1,102
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching
2019
SIGMOD
0.00012166591
1,231
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
2010
VLDB
0.00011571594
1,563
LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms
2016
VLDB
0.00010352314
2,035
RapidMatch: A Holistic Approach to Subgraph Query Processing
2021
VLDB
9.2787188e-05
2,190
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
2021
SIGMOD
8.9804702e-05
2,607
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs
2020
SIGMOD
8.3489531e-05
2,973
Functional Dependencies for Graphs
2016
SIGMOD
7.9083516e-05
3,102
Efficient GPU-Accelerated Subgraph Matching
2023
SIGMOD
7.7568687e-05
3,194
GuP: Fast Subgraph Matching by Guard-based Pruning
2023
SIGMOD
7.6491858e-05
3,283
A Learned Sketch for Subgraph Counting
2021
SIGMOD
7.56675e-05
4,983
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
2024
SIGMOD
6.4127092e-05
6,149
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding
2024
VLDB
5.9581422e-05
6,341
Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks
2024
SIGMOD
5.9068986e-05
6,588
Lotan: Bridging the Gap between GNNs and Scalable Graph Analytics Engines
2023
VLDB
5.833338e-05
7,087
DAHA: Accelerating GNN Training with Data and Hardware Aware Execution Planning
2024
VLDB
5.7069166e-05
7,418
Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale
2022
VLDB
5.6236086e-05
8,871
MatCo: Computing Match Cover of Subgraph Query over Graph Data
2025
SIGMOD
5.35418e-05
9,118
Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs
2024
SIGMOD
5.3201316e-05
9,867
SPACE: Cardinality Estimation for Path Queries Using Cardinality-Aware Sequence-based Learning
2025
SIGMOD
5.2043672e-05
Semantically Similar Papers
#
Overall Rank
Paper
Year
Venue
1
10,294
Sublime: Selecting Subgraph Matching Algorithms via Machine Learning
2026
SIGMOD
2
1,487
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs
2015
VLDB
3
2,190
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
2021
SIGMOD
4
2,187
Subgraph Matching: on Compression and Computation
2018
VLDB
5
9,703
Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs
2017
SIGMOD
6
1,006
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
2019
SIGMOD
7
11,762
Simulation-based Approximate Graph Pattern Matching
2020
SIGMOD
8
4,983
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
2024
SIGMOD
9
1,128
Graph Pattern Matching: From Intractable to Polynomial Time
2010
VLDB
10
11,756
Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees
2020
SIGMOD