DBScholar

Back to papers

Sub-optimal Join Order Identification with L1-error

Summary: Introduces L1-error, a permutation distance over subplan cardinalities with the same join count, weighting errors by magnitude and prioritizing small multi-way joins. Used within a standard decision tree, L1-error accurately identifies sub-optimal plans across four benchmarks, with gains when combined with Q-error as a low-overhead composite feature. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6888
Venue
SIGMOD
Year
2024
Pagerank
5.093636e-05
Overall Rank
11,160 | 23.44%
DOI
10.1145/3639272

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{izenov_sigmod24,
        title = {{Sub-optimal Join Order Identification with L1-error}},
        author = {Izenov, Yesdaulet and Datta, Asoke and Tsan, Brian and Rusu, Florin},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3639272},
        url = {https://dl.acm.org/doi/10.1145/3639272},
        year = {2024}
}

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 26 of 26 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0024089429
18 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059284255
84 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00035838391
89 On the Propagation of Errors in the Size of Join Results 1991 SIGMOD 0.00035031529
290 An Overview of Query Optimization in Relational Systems 1998 PODS 0.0002227038
323 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00021264788
388 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019410042
401 Deep Unsupervised Cardinality Estimation 2020 VLDB 0.00019092557
513 NeuroCard: One Cardinality Estimator for All Tables 2021 VLDB 0.00017190574
697 Selectivity Estimation for Range Predicates using Lightweight Models 2019 VLDB 0.00014888851
698 Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques 1989 SIGMOD 0.00014879675
1,013 Dynamic Programming Strikes Back 2008 SIGMOD 0.00012652549
1,061 Are We Ready For Learned Cardinality Estimation? 2021 VLDB 0.00012369764
1,122 Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation 2022 VLDB 0.0001209124
1,298 Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products 2006 VLDB 0.00011259156
1,499 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010564536
1,727 Optimal Top-Down Join Enumeration 2007 SIGMOD 9.91063e-05
1,832 DSB: A Decision Support Benchmark for Workload-Driven and Traditional Database Systems 2021 VLDB 9.6607418e-05
1,876 Flow-Loss: Learning Cardinality Estimates That Matter 2021 VLDB 9.5717543e-05
1,988 FLAT: Fast, Lightweight and Accurate Method for Cardinality Estimation 2021 VLDB 9.3501502e-05
2,203 Estimating Join Selectivities using Bandwidth-Optimized Kernel Density Models 2017 VLDB 8.9610447e-05
2,275 Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs 2013 VLDB 8.8196821e-05
3,813 Query Simplification: Graceful Degradation for Join-Order Optimization 2009 SIGMOD 7.1051056e-05
4,900 COMPASS: Online Sketch-based Query Optimization for In-Memory Databases 2021 SIGMOD 6.4534715e-05
6,019 Robustness Metrics for Relational Query Execution Plans 2018 VLDB 6.0060149e-05
7,882 Efficiently Computing Join Orders with Heuristic Search 2023 SIGMOD 5.5237338e-05
Previous Page 1 / 1 Next

Semantically Similar Papers