Back to papers
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
Summary: Proposes DAF, combining DAG-based dynamic programming, adaptive matching order, and failing-set pruning for subgraph matching. Outperforms CFL-Match/Turboiso by orders of magnitude in recursive calls and runtime, showing the value of learned search.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5692
- Venue
- SIGMOD
- Year
- 2019
- Pagerank
- 0.00011358946
- Overall Rank
- 1,561 | 89.15%
- DOI
-
10.1145/3299869.3319880
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 6 of 56 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 21 of 21 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 203 |
Graph Indexing: A Frequent Structure-based Approach |
2004 |
SIGMOD |
0.00034889335 |
| 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 |
| 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,500 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011674394 |
| 1,635 |
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases |
2013 |
VLDB |
0.0001105793 |
| 1,720 |
Incremental Graph Pattern Matching |
2011 |
SIGMOD |
0.00010779343 |
| 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 |
| 2,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-05 |
| 2,196 |
gStore: Answering SPARQL Queries via Subgraph Matching |
2011 |
VLDB |
9.3089621e-05 |
| 2,200 |
LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms |
2016 |
VLDB |
9.3075881e-05 |
| 2,912 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9130459e-05 |
| 4,494 |
Multi-Query Optimization for Subgraph Isomorphism Search |
2017 |
VLDB |
6.1414196e-05 |
| 4,807 |
Diversified Top-k Graph Pattern Matching |
2013 |
VLDB |
5.9092289e-05 |
| 5,877 |
Taming Subgraph Isomorphism for RDF Query Processing |
2015 |
VLDB |
5.2916612e-05 |
| 7,790 |
Mining Tree-Structured Data on Multicore Systems |
2009 |
VLDB |
4.650649e-05 |
| 8,397 |
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying |
2007 |
VLDB |
4.527474e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 2,007 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.8081235e-05 |
| 1,414 |
Graph Pattern Matching: From Intractable to Polynomial Time |
2010 |
VLDB |
0.00012118275 |
| 7,307 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
4.7674113e-05 |
| 4,470 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.1557462e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,733 |
Subgraph Matching: A New Decomposition Based Approach |
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 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |