BitE : Accelerating Learned Query Optimization in a Mixed-Workload Environment

2023-06-01 · Yuri Kim, Yewon Choi, Yujung Gil, Sanghee Lee, Heesik Shin, Jaehyok Chong

Although the many efforts to apply deep reinforcement learning to query optimization in recent years, there remains room for improvement as query optimizers are complex entities that require hand-designed tuning of workloads and datasets. Recent research present learned query optimizations results mostly in bulks of single workloads which focus on picking up the unique traits of the specific workload. This proves to be problematic in scenarios where the different characteristics of multiple workloads and datasets are to be mixed and learned together. Henceforth, in this paper, we propose BitE, a novel ensemble learning model using database statistics and metadata to tune a learned query optimizer for enhancing performance. On the way, we introduce multiple revisions to solve several challenges: we extend the search space for the optimal Abstract SQL Plan(represented as a JSON object called ASP) by expanding hintsets, we steer the model away from the default plans that may be biased by configuring the experience with all unique plans of queries, and we deviate from the traditional loss functions and choose an alternative method to cope with underestimation and overestimation of reward. Our model achieves 19.6% more improved queries and 15.8% less regressed queries compared to the existing traditional methods whilst using a comparable level of resources.

📄 PDF Abstract BibTeX arXiv:2306.00845

Code (0)

등록된 구현이 없습니다.

Tasks

Deep Reinforcement LearningEnsemble Learning

Methods 이 논문이 사용한 방법론

Focus 설명 없음

RELOAD: A Robust and Efficient Learned Query Optimizer for Database Systems

2026-04-16 · Seokwon Lee, Jaeyoung Sim, Sihyun Kim, Yuhsing Li 외 arxiv

Recent advances in query optimization have shifted from traditional rule-based and cost-based techniques towards machine learning-driven approaches. Among these, reinforcement learning (RL) has attracted significant atte…

Reinforcement Learning

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates

2023-07-17 · Kyle Mana, Fernando Acero, Stephen Mak, Parisa Zehtabi 외

Discrete optimization belongs to the set of $\mathcal{NP}$-hard problems, spanning fields such as mixed-integer programming and combinatorial optimization. A current standard approach to solving convex discrete optimizat…

Combinatorial Optimization Management reinforcement-learning Reinforcement Learning+1

Mixed variable structural optimization using mixed variable system Monte Carlo tree search formulation

2023-09-25 · Fu-Yao Ko, Katsuyuki Suzuki, Kazuo Yonekura

A novel method called mixed variable system Monte Carlo tree search (MVSMCTS) formulation is presented for optimization problems considering various types of variables with single and mixed continuous-discrete system. Th…

Accelerating Posterior Inference from Pulsar Light Curves via Learned Latent Representations and Local Simulator-Guided Optimization

2026-02-16 · Farhana Taiyebah, Abu Bucker Siddik, Indronil Bhattacharjee, Diane Oyen 외 arxiv

Posterior inference from pulsar observations in the form of light curves is commonly performed using Markov chain Monte Carlo methods, which are accurate but computationally expensive. We introduce a framework that accel…

Fourier-Mixed Window Attention: Accelerating Informer for Long Sequence Time-Series Forecasting

2023-07-02 · Nhat Thanh Tran, Jack Xin

We study a fast local-global window-based attention method to accelerate Informer for long sequence time-series forecasting. While window attention being local is a considerable computational saving, it lacks the ability…

Time Series Time Series Forecasting