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
5754
Venue
SIGMOD
Year
2019
Pagerank
0.00012699518
Overall Rank
1,006 | 93.10%
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 9 of 59 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
177 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00027100548
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
442 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018398144
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
1,036 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012499878
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001179597
1,246 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011504088
1,296 Incremental Graph Pattern Matching 2011 SIGMOD 0.00011269684
1,487 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010615297
1,552 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010379532
1,563 LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms 2016 VLDB 0.00010352314
1,774 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.7870727e-05
2,182 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 9.010121e-05
3,709 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 7.1780227e-05
3,908 Diversified Top-k Graph Pattern Matching 2013 VLDB 7.0262215e-05
4,748 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.5251089e-05
7,710 Mining Tree-Structured Data on Multicore Systems 2009 VLDB 5.5618769e-05
8,422 LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying 2007 VLDB 5.4278338e-05
Previous Page 1 / 1 Next

Semantically Similar Papers