Aug 2026· Proceedings of the VLDB Endowment· Vol 19, pp. 4303-4315· 0 citations· 33 references
TL;DR
A KL-divergence-driven model fine-tuning and plan updating strategy that dynamically adapts to workload changes is introduced, demonstrating improved scalability and robustness for industrial-scale PQO.
Abstract
Parametric Query Optimization (PQO) is crucial for efficiently executing parametrized queries (PQ) in modern industrial database systems. This paper addresses two key challenges overlooked by existing PQO techniques: large-scale template generalization and online adaptability. For large-scale workloads, maintaining one model per template is impractical, while sharing a single model across all templates leads to degraded performance. To overcome this issue, we propose a representation-based clustering strategy coupled with hierarchical model training, which significantly reduces model cost while preserving accuracy. For online adaptability, we observe that query parameter distributions shift over time, rendering fixed plan caches suboptimal. To address this, we introduce a KL-divergence-driven model fine-tuning and plan updating strategy that dynamically adapts to workload changes. Our approach is implemented on OceanBase and extensively evaluated on six workloads. Results show that it achieves up to 1.62× acceleration over the OceanBase optimizer and outperforms RankPQO, a state-of-the-art PQO method, by up to 1.23×, demonstrating improved scalability and robustness for industrial-scale PQO.
Slow queries frequently cause severe performance bottlenecks in database management systems. Diagnosing their root causes online risks exacerbating resource contention, while data privacy regulations often prohibit copying production data to test environments. Synthesizing a proxy database from non-intrusive metadata t...
Zhao-Yang Zhang, Shuang Liu, Deng-Feng Xu et al.· 0 citations
Modern information retrieval increasingly employs both embedding and generative models to handle complex queries. However, current serving systems suffer from low throughput and poor GPU utilization because they execute these models in isolation. Coarse-grained partitioning, such as dedicating GPUs to specific tasks, f...
Dohyun Park, Hubertus Franke, Daniel G. Waddington et al.· 0 citations
Learned Query Optimization (LQO) has emerged as a promising paradigm for improving database performance, with reported speedups of 2× to over 10× on standard benchmarks. Existing evaluations, however, remain largely latency-centric and leave the energy debt from data collection, model training, and online inference l...
Zi-Bo Liang, Quan-Qing Xu, Xu Chen et al.· Proceedings of the ACM on Ma...· 0 citations
Zeroth-order optimization (ZOO) estimates updates from function evaluations, making perturbation queries a primary cost. Fixed budgets spend the same number of queries at every step, while adaptive controllers may offset their savings by using additional oracle calls to test estimator reliability. We introduce ZoAQ, an...
TaskPress is introduced, a framework for task-guided, query-agnostic KV cache eviction, instead of optimizing the cache for a single query, which constructs a reusable memory representation conditioned on a high-level task guide.
This work adapts Balsa to DuckDB, a vectorized analytical database that lacks both plan hinting and statement-level timeout support, and introduces lightweight portability mechanisms based on SQL-level plan forcing and timeout management for safe exploration.
Wangshu Hong, Ryan Marcus· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.