Pith. sign in

REVIEW 2 cited by

Bao: Learning to Steer Query Optimizers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.03814 v1 pith:NPGUXNBS submitted 2020-04-08 cs.DB

classification cs.DB
keywords querylearningoptimizationperformancechangesdataoptimizerstail
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Query optimization remains one of the most challenging problems in data management systems. Recent efforts to apply machine learning techniques to query optimization challenges have been promising, but have shown few practical gains due to substantive training overhead, inability to adapt to changes, and poor tail performance. Motivated by these difficulties and drawing upon a long history of research in multi-armed bandits, we introduce Bao (the BAndit Optimizer). Bao takes advantage of the wisdom built into existing query optimizers by providing per-query optimization hints. Bao combines modern tree convolutional neural networks with Thompson sampling, a decades-old and well-studied reinforcement learning algorithm. As a result, Bao automatically learns from its mistakes and adapts to changes in query workloads, data, and schema. Experimentally, we demonstrate that Bao can quickly (an order of magnitude faster than previous approaches) learn strategies that improve end-to-end query execution performance, including tail latency. In cloud environments, we show that Bao can offer both reduced costs and better performance compared with a sophisticated commercial system.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Selectivity Estimation for Linear Queries via Online Learning

    cs.DB 2026-07 accept novelty 7.0 of 10

    Online learning yields nearly tight regret bounds for histogram-based linear selectivity estimation under squared and absolute loss for both static and dynamic databases.

  2. JOB-Complex: A Challenging Benchmark for Traditional & Learned Query Optimization

    cs.DB 2025-07 conditional novelty 6.0 of 10

    The new JOB-Complex benchmark reveals that both PostgreSQL and learned cost models select plans up to 11x slower than the best known plans on queries with string and non-key joins and complex predicates.

Pith tools