DBScholar

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
h6c4535587887601f
Venue
SIGMOD
Year
2019
Pagerank
0.00012836554
Overall Rank
960 | 93.55%
DOI
10.1145/3299869.3319880

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{han_sigmod19,
        title = {{Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together}},
        author = {Han, Myoungji and Kim, Hyunjoon and Gu, Geonmo and Park, Kunsoo and Han, Wook-Shin},
        series = {{SIGMOD} '19},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3299869.3319880},
        url = {https://dl.acm.org/doi/10.1145/3299869.3319880},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 61 citing papers.

Previous Page 2 / 2 Next

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
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026700508
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020124083
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018197688
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
1,046 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012319866
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011627329
1,249 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011340141
1,317 Incremental Graph Pattern Matching 2011 SIGMOD 0.00011050011
1,486 LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms 2016 VLDB 0.00010522557
1,506 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010452205
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010197978
1,804 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.6025094e-05
2,211 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.8237249e-05
3,767 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 7.0315534e-05
3,979 Diversified Top-k Graph Pattern Matching 2013 VLDB 6.8802947e-05
4,817 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3985024e-05
7,815 Mining Tree-Structured Data on Multicore Systems 2009 VLDB 5.448188e-05
8,548 LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying 2007 VLDB 5.3171525e-05
Previous Page 1 / 1 Next

Semantically Similar Papers