Metraipolis › archive › dc_8a4fcc3ddf36
When Is One Query per Template Enough? Adapting Learned Cost Models to New Hardware — arXiv:2611.05892
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05892
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:19:49.830Z
- SHA-256 of the archived text
f16efeef303993c03db40da5e250e4559360f9d66566e38813534dabae59b6dc- Stable URL of this page
https://metraipolis.com/documento/dc_8a4fcc3ddf36
How to cite
When Is One Query per Template Enough? Adapting Learned Cost Models to New Hardware — arXiv:2611.05892 — arXiv (en), https://arxiv.org/abs/2611.05892 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8a4fcc3ddf36 (Metraipolis archive dc_8a4fcc3ddf36, sha256 f16efeef303993c03db40da5e250e4559360f9d66566e38813534dabae59b6dc)
BibTeX
@misc{dc8a4fcc3ddf36,
title = {When Is One Query per Template Enough? Adapting Learned Cost Models to New Hardware — arXiv:2611.05892},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05892},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8a4fcc3ddf36; sha256 f16efeef303993c03db40da5e250e4559360f9d66566e38813534dabae59b6dc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05892. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A learned cost model that predicts query runtimes is trained on measurements from one machine. When the database moves to other hardware, its plans stay the same but their runtimes change, each by its own factor. We ask how to adapt such a model from k queries measured on the new machine: which queries to run, how to use their runtimes, and how many are enough. On PostgreSQL we timed the same plans of 1,162 TPC-H and TPC-DS queries in six environments: a laptop and a server, each with all its processors or pinned to one, the server also pinned to two, and the laptop also with a small buffer pool. No single factor describes the slowdown between two environments: most of its variance lies between query templates, so a speed factor stops improving after a few queries. A correction that fits separate lines for serial and parallel plans and adds an offset for every measured template brings the moved model, with one measured query per template, to an error (geometric mean over templates of the median Q-error) of 1.10 on TPC-H and 1.19 on TPC-DS, close to the same correction on a model trained on the new machine; fine-tuning a DACE-style neural cost model on the same queries gains at most 2%. On templates never measured, no correction we tried is on average more than 2% better than the speed factor. We then fixed hypotheses and timed new data. On TPC-H at ten times the scale the errors follow these results, but two of five repeated tests miss. On the Join Order Benchmark, whose queries differ widely within a template, the model errs by 2.36 even when retrained on the new machine, no correction gains much, and only the test on new templates holds; boosted trees and a neural model fit these queries better, and correcting the neural model works as well as fine-tuning it. We report every test as registered. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.PF, nuovi lavori del giorno). Categorie arXiv: Databases (cs.DB) ; Machine Learning (cs.LG); Performance (cs.PF). Pagina del lavoro: https://arxiv.org/abs/2611.05892 — 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-11-05T18:13:48.991Z dalla pagina https://arxiv.org/list/cs.PF/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).