Learned Offline Query Planning via Bayesian Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917916825354240 |
|---|---|
| author | Tao, Jeffrey Maus, Natalie Jones, Haydn Zeng, Yimeng Gardner, Jacob R. Marcus, Ryan |
| author_facet | Tao, Jeffrey Maus, Natalie Jones, Haydn Zeng, Yimeng Gardner, Jacob R. Marcus, Ryan |
| contents | Analytics database workloads often contain queries that are executed repeatedly. Existing optimization techniques generally prioritize keeping optimization cost low, normally well below the time it takes to execute a single instance of a query. If a given query is going to be executed thousands of times, could it be worth investing significantly more optimization time? In contrast to traditional online query optimizers, we propose an offline query optimizer that searches a wide variety of plans and incorporates query execution as a primitive. Our offline query optimizer combines variational auto-encoders with Bayesian optimization to find optimized plans for a given query. We compare our technique to the optimal plans possible with PostgreSQL and recent RL-based systems over several datasets, and show that our technique finds faster query plans. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_05256 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Learned Offline Query Planning via Bayesian Optimization Tao, Jeffrey Maus, Natalie Jones, Haydn Zeng, Yimeng Gardner, Jacob R. Marcus, Ryan Databases Analytics database workloads often contain queries that are executed repeatedly. Existing optimization techniques generally prioritize keeping optimization cost low, normally well below the time it takes to execute a single instance of a query. If a given query is going to be executed thousands of times, could it be worth investing significantly more optimization time? In contrast to traditional online query optimizers, we propose an offline query optimizer that searches a wide variety of plans and incorporates query execution as a primitive. Our offline query optimizer combines variational auto-encoders with Bayesian optimization to find optimized plans for a given query. We compare our technique to the optimal plans possible with PostgreSQL and recent RL-based systems over several datasets, and show that our technique finds faster query plans. |
| title | Learned Offline Query Planning via Bayesian Optimization |
| topic | Databases |
| url | https://arxiv.org/abs/2502.05256 |