DBScholar

Back to papers

NeuSO: Neural Optimizer for Subgraph Queries

Summary: Fixes poor heuristic vertex-orderings for subgraph enumeration with NeuSO, a learned optimizer for heterogeneous, schema-flexible graphs. It uses a compact query-graph encoder, multi-task cardinality+cost estimation, and a top-down enumerator to produce faster, higher-quality plans. (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7596
Venue
SIGMOD
Year
2026
Pagerank
5.2434488e-05
Overall Rank
9,617 | 34.02%
DOI
10.1145/3769810

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{yang_sigmod26,
        title = {{NeuSO: Neural Optimizer for Subgraph Queries}},
        author = {Yang, Linglin and Zou, Lei and Zhao, Chunshan},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3769810},
        url = {https://dl.acm.org/doi/10.1145/3769810},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,294 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 49 of 49 cited papers.

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

Rank Cited Paper Year Venue Pagerank
18 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059284255
84 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00035838391
264 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00022980015
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
323 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00021264788
378 Bao: Making Learned Query Optimization Practical 2021 SIGMOD 0.00019638121
426 The LDBC Social Network Benchmark: Interactive Workload 2015 SIGMOD 0.00018692185
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
465 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.0001803934
513 NeuroCard: One Cardinality Estimator for All Tables 2021 VLDB 0.00017190574
530 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.0001709169
547 Cypher: An Evolving Query Language for Property Graphs 2018 SIGMOD 0.00016731552
563 Plan-Structured Deep Neural Network Models for Query Performance Prediction 2019 VLDB 0.0001650812
593 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00016027871
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
697 Selectivity Estimation for Range Predicates using Lightweight Models 2019 VLDB 0.00014888851
737 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00014490983
747 Querying Graph Databases 2013 PODS 0.00014400452
802 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013907725
809 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00013874588
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,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
1,241 Balsa: Learning a Query Optimizer Without Expert Demonstrations 2022 SIGMOD 0.00011521639
1,774 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.7870727e-05
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,126 Kuzu* Graph Database Management System 2023 CIDR 9.1329991e-05
2,190 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.9804702e-05
2,452 A Learned Query Rewrite System using Monte Carlo Tree Search 2022 VLDB 8.5584e-05
2,553 LLM-R^2: A Large Language Model Enhanced Rule-based Rewrite System for Boosting Query Efficiency 2025 VLDB 8.4283807e-05
2,731 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1959181e-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
3,342 High-Performance Dynamic Pattern Matching over Disordered Streams 2010 VLDB 7.4999147e-05
3,516 LOGER: A Learned Optimizer towards Generating Efficient and Robust Query Execution Plans 2023 VLDB 7.3524442e-05
3,649 Query Planning for Evaluating SPARQL Property Paths 2016 SIGMOD 7.2251335e-05
4,349 ALECE: An Attention-based Learned Cardinality Estimator for SPJ Queries on Dynamic Workloads 2024 VLDB 6.7504619e-05
4,363 GenRewrite: Query Rewriting via Large Language Models 2026 SIGMOD 6.7423909e-05
4,563 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6291459e-05
4,748 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.5251089e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
5,712 Sample-Efficient Cardinality Estimation Using Geometric Deep Learning 2024 VLDB 6.1123894e-05
5,942 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.0334209e-05
6,149 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.9581422e-05
6,325 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9125893e-05
6,341 Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks 2024 SIGMOD 5.9068986e-05
8,975 Materialized View Selection & View-Based Query Planning for Regular Path Queries 2024 SIGMOD 5.3412433e-05
9,761 AvantGraph Query Processing Engine 2022 VLDB 5.2238304e-05
Previous Page 1 / 1 Next

Semantically Similar Papers