Metraipolis › archive › dc_2efa68294dc6
CATune: Structural Constraint-Aware Bayesian Optimization for DBMS Configuration Tuning — arXiv:2610.09276
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.09276
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:36:48.381Z
- SHA-256 of the archived text
bc5e910626ccc49bf0564e652c9aee4e06537db638c387da8142cd53f08bd203- Stable URL of this page
https://metraipolis.com/documento/dc_2efa68294dc6
How to cite
CATune: Structural Constraint-Aware Bayesian Optimization for DBMS Configuration Tuning — arXiv:2610.09276 — arXiv (en), https://arxiv.org/abs/2610.09276 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2efa68294dc6 (Metraipolis archive dc_2efa68294dc6, sha256 bc5e910626ccc49bf0564e652c9aee4e06537db638c387da8142cd53f08bd203)
BibTeX
@misc{dc2efa68294dc6,
title = {CATune: Structural Constraint-Aware Bayesian Optimization for DBMS Configuration Tuning — arXiv:2610.09276},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.09276},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2efa68294dc6; sha256 bc5e910626ccc49bf0564e652c9aee4e06537db638c387da8142cd53f08bd203},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09276. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Modern DBMSs expose hundreds of configuration knobs, resulting in a high-dimensional and heterogeneous search space that makes automated tuning costly. Existing ML-based tuning systems typically treat the configuration domain as box-constrained and rely on workload feedback to implicitly capture inter-knob relationships. However, DBMS documentation specifies deterministic knob dependency constraints, particularly ordering constraints, that characterize structurally valid regions of the configuration space. We present CATune, a constraint-aware Bayesian optimization (BO) framework that models deterministic inter-knob ordering constraints as structural components of the search domain. Instead of learning feasibility boundaries through sampled violations, CATune performs optimization within a constraint-consistent subspace. We develop a topology-aware sampling strategy that respects dependency structure during exploration and avoids the inefficiencies of post-hoc constraint handling. To enable automated constraint discovery, we further design a precision-first extraction pipeline that combines LLM-based parsing with reliability safeguards to mitigate hallucinated dependencies. Experiments on PostgreSQL and MySQL using TPC-C and TPC-H workloads show that CATune substantially improves both sample efficiency and final tuning quality across surrogate models and BO frameworks. Under default ranges, CATune reaches the baseline optimum up to 12.5x faster and improves throughput by up to 63.37%. The improvements persist under knowledge-guided reduced ranges and alternative optimization implementations. These results demonstrate that explicitly modeling system-defined deterministic ordering constraints enhances optimization robustness and system stability. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Databases (cs.DB) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.09276 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T12:14:15.384Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).