DBScholar

Back to papers

Sublime: Selecting Subgraph Matching Algorithms via Machine Learning

Summary: Sublime replaces brittle hand-crafted algorithm-selection rules for subgraph matching with learned selection from query/data features and labeled performance observations. It improves embeddings/sec by up to 36% and coverage by 46.3% over baselines. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
hc6ddfb04e87d12c5
Venue
SIGMOD
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,506 | 29.37%
DOI
10.1145/3802115

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{kuraya_sigmod26,
        title = {{Sublime: Selecting Subgraph Matching Algorithms via Machine Learning}},
        author = {Kuraya, Genryu and Skitsas, Konstantinos and Mottin, Davide and Karras, Panagiotis and Amagata, Daichi and Sasaki, Yuya},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802115},
        url = {https://dl.acm.org/doi/10.1145/3802115},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
937 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012977594
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011627329
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
2,014 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1832045e-05
2,019 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.1750421e-05
2,702 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.1177147e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
4,587 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5161686e-05
4,817 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3985024e-05
9,030 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.2340466e-05
9,797 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1257999e-05
11,432 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Semantically Similar Papers