DBA bandits: Self-driving index tuning under ad-hoc, analytical workloads with safety guarantees
R. Malinga Perera, Bastian Oetomo, Benjamin I. P. Rubinstein, Renata, Borovica-Gajic

TL;DR
This paper introduces DBA bandits, a self-driving index tuning method that learns optimal physical database structures online without manual input, achieving significant performance improvements on dynamic and static workloads.
Contribution
It presents a novel bandit learning approach for online index tuning that eliminates the need for DBAs and query optimizer assumptions, ensuring adaptive and safe database performance optimization.
Findings
Achieves up to 75% speed-up on shifting workloads
Attains 28% speed-up on static workloads
Provides provable performance guarantees through bandit learning
Abstract
Automating physical database design has remained a long-term interest in database research due to substantial performance gains afforded by optimised structures. Despite significant progress, a majority of today's commercial solutions are highly manual, requiring offline invocation by database administrators (DBAs) who are expected to identify and supply representative training workloads. Unfortunately, the latest advancements like query stores provide only limited support for dynamic environments. This status quo is untenable: identifying representative static workloads is no longer realistic; and physical design tools remain susceptible to the query optimiser's cost misestimates (stemming from unrealistic assumptions such as attribute value independence and uniformity of data distribution). We propose a self-driving approach to online index selection that eschews the DBA and query…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
