Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lee, Seokwon, Sim, Jaeyoung, Kim, Sihyun, Li, Yuhsing, Zhu, Yiwen, Park, Kwanghyun
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2604.14725
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866914479280750592
author Lee, Seokwon
Sim, Jaeyoung
Kim, Sihyun
Li, Yuhsing
Zhu, Yiwen
Park, Kwanghyun
author_facet Lee, Seokwon
Sim, Jaeyoung
Kim, Sihyun
Li, Yuhsing
Zhu, Yiwen
Park, Kwanghyun
contents 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 attention due to its ability to optimize long-term performance by learning policies over query planning. However, existing RL-based query optimizers often exhibit unstable performance at the level of individual queries, including severe performance regressions, and require prolonged training to reach the plan quality of expert, cost-based optimizers. These shortcomings make learned query optimizers difficult to deploy in practice and remain a major barrier to their adoption in production database systems. To address these challenges, we present RELOAD, a robust and efficient learned query optimizer for database systems. RELOAD focuses on (i) robustness, by minimizing query-level performance regressions and ensuring consistent optimization behavior across executions, and (ii) efficiency, by accelerating convergence to expert-level plan quality. Through extensive experiments on standard benchmarks, including Join Order Benchmark, TPC-DS, and Star Schema Benchmark, RELOAD demonstrates up to 2.4x higher robustness and 3.1x greater efficiency compared to state-of-the-art RL-based query optimization techniques.
format Preprint
id arxiv_https___arxiv_org_abs_2604_14725
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle RELOAD: A Robust and Efficient Learned Query Optimizer for Database Systems
Lee, Seokwon
Sim, Jaeyoung
Kim, Sihyun
Li, Yuhsing
Zhu, Yiwen
Park, Kwanghyun
Databases
Machine Learning
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 attention due to its ability to optimize long-term performance by learning policies over query planning. However, existing RL-based query optimizers often exhibit unstable performance at the level of individual queries, including severe performance regressions, and require prolonged training to reach the plan quality of expert, cost-based optimizers. These shortcomings make learned query optimizers difficult to deploy in practice and remain a major barrier to their adoption in production database systems. To address these challenges, we present RELOAD, a robust and efficient learned query optimizer for database systems. RELOAD focuses on (i) robustness, by minimizing query-level performance regressions and ensuring consistent optimization behavior across executions, and (ii) efficiency, by accelerating convergence to expert-level plan quality. Through extensive experiments on standard benchmarks, including Join Order Benchmark, TPC-DS, and Star Schema Benchmark, RELOAD demonstrates up to 2.4x higher robustness and 3.1x greater efficiency compared to state-of-the-art RL-based query optimization techniques.
title RELOAD: A Robust and Efficient Learned Query Optimizer for Database Systems
topic Databases
Machine Learning
url https://arxiv.org/abs/2604.14725