Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3626246.3654755acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
short-paper

RobOpt: A Tool for Robust Workload Optimization Based on Uncertainty-Aware Machine Learning

Published: 09 June 2024 Publication History

Abstract

Relational database management systems (RDBMSs) employ query optimizers to search for execution plans deemed optimal for specific queries. Classical optimizers rely on inaccurate parameter estimates and assumptions that may not hold true in real-world scenarios. Consequently, suboptimal execution plans may be chosen, leading to poor query execution performance. Recent proposals of learned query optimizers that leverage Machine Learning suffer also from the selection of suboptimal plans. In order to fill this gap, we have created Robust Workload Optimization (RobOpt), a prototype tool that facilitates robust execution of a query workload in RDBMSs. It implements a novel technique that takes workload logs as input, generates training samples, and trains a risk-aware learned cost model. It optimizes risk-aware plan selection strategies to achieve a desired level of runtime performance and robustness. In addition, it analyzes a workload according to its training samples and determines an optimal plan selection strategy either at the workload or query level. Ultimately, it enables the robust execution of any workload by determining an optimal plan selection strategy per query. RobOpt can work on top of any RDBMS.

References

[1]
Shivnath Babu, Pedro Bizarro, and David DeWitt. 2005. Proactive re-optimization. In ACM SIGMOD. 107--118.
[2]
Francis Chu, Joseph Halpern, and Johannes Gehrke. 2002. Least expected cost query optimization: what can we expect?. In ACM PODS. 293--302.
[3]
Lyric Doshi, Vincent Zhuang, Gaurav Jain, Ryan Marcus, Haoyu Huang, Deniz Altinbüken, Eugene Brevdo, and Campbell Fraser. 2023. Kepler: Robust Learning for Parametric Query Optimization. 1, 1 (2023), 109:1--109:25.
[4]
Anshuman Dutt and Jayant R. Haritsa. 2016. Plan Bouquets: A Fragrant Approach to Robust Query Processing. 41, 2 (2016), 11:1--11:37.
[5]
Jakob et al Gawlikowski. 2023. A survey of uncertainty in deep neural networks. Artificial Intelligence Review 56, 1 (2023), 1513--1589.
[6]
Jayant R. Haritsa. 2020. Robust query processing: mission possible. 13, 12 (2020), 3425--3428.
[7]
Benjamin Hilprecht and Carsten Binnig. 2022. One Model to Rule them All: Towards Zero-Shot Learning for Databases. In CIDR.
[8]
Amin Kamali, Verena Kantere, Calisto Zuzarte, and Vincent Corvinelli. 2024. Roq: Robust Query Optimization Based on a Risk-aware Learned Cost Model. arXiv:2401.15210 [cs.DB]
[9]
Srinivas Karthik, Jayant R. Haritsa, Sreyash Kenkre, and Vinayaka Pandit. 2018. A concave path to low-overhead robust query processing. 11, 13 (2018), 2183--2195.
[10]
Alex Kendall and Yarin Gal. 2017. What uncertainties dowe need in Bayesian deep learning for computer vision?. In International Conference on Neural Information Processing Systems. 5580--5590.
[11]
Jie Liu, Wenqian Dong, Qingqing Zhou, and Dong Li. 2021. Fauce: Fast and Accurate Deep Ensembles with Uncertainty for Cardinality Estimation. (2021).
[12]
Ryan Marcus, Parimarjan Negi, Hongzi Mao, Nesime Tatbul, Mohammad Alizadeh, and Tim Kraska. 2024. Bao: Making Learned Query Optimization Practical. In Proceedings of ACM SIGMOD (2021-06--18). 1275--1288.
[13]
Ryan Marcus, Parimarjan Negi, Hongzi Mao, Chi Zhang, Mohammad Alizadeh, Tim Kraska, Olga Papaemmanouil, and Nesime Tatbul. 2019. Neo: a learned query optimizer. Proc. of VLDB Endow. 12, 11 (2019), 1705--1718.
[14]
Chiraz Moumen, Franck Morvan, and Abdelkader Hameurlain. 2016. Handling Estimation Inaccuracy in Query Optimization. InWeb Technologies and Applications (Cham). 355--367.
[15]
Florian Wolf, Michael Brendle, Norman May, Paul R. Willems, Kai-Uwe Sattler, and Michael Grossniklaus. 2018. Robustness metrics for relational query execution plans. 11, 11 (2018), 1360--1372.
[16]
Shaoyi Yin, Abdelkader Hameurlain, and Franck Morvan. 2015. Robust Query Optimization Methods With Respect to Estimation Errors: A Survey. 44, 3 (2015), 25--36.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGMOD/PODS '24: Companion of the 2024 International Conference on Management of Data
June 2024
694 pages
ISBN:9798400704222
DOI:10.1145/3626246
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2024

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. machine learning
  2. query optimization
  3. robust systems
  4. workload optimization

Qualifiers

  • Short-paper

Conference

SIGMOD/PODS '24
Sponsor:

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 144
    Total Downloads
  • Downloads (Last 12 months)144
  • Downloads (Last 6 weeks)15
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media