On the Costs and Benefits of Learned Indexing for Dynamic High-Dimensional Data: Extended Version

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Slanináková, Terézia, Olha, Jaroslav, Procházka, David, Antol, Matej, Dohnal, Vlastislav
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866915738732724224
author Slanináková, Terézia
Olha, Jaroslav
Procházka, David
Antol, Matej
Dohnal, Vlastislav
author_facet Slanináková, Terézia
Olha, Jaroslav
Procházka, David
Antol, Matej
Dohnal, Vlastislav
contents One of the main challenges within the growing research area of learned indexing is the lack of adaptability to dynamically expanding datasets. This paper explores the dynamization of a static learned index for complex data through operations such as node splitting and broadening, enabling efficient adaptation to new data. Furthermore, we evaluate the trade-offs between static and dynamic approaches by introducing an amortized cost model to assess query performance in tandem with the build costs of the index structure, enabling experimental determination of when a dynamic learned index outperforms its static counterpart. We apply the dynamization method to a static learned index and demonstrate that its superior scaling quickly surpasses the static implementation in terms of overall costs as the database grows. This is an extended version of the paper presented at DAWAK 2025.
format Preprint
id arxiv_https___arxiv_org_abs_2507_05865
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle On the Costs and Benefits of Learned Indexing for Dynamic High-Dimensional Data: Extended Version
Slanináková, Terézia
Olha, Jaroslav
Procházka, David
Antol, Matej
Dohnal, Vlastislav
Information Retrieval
Databases
One of the main challenges within the growing research area of learned indexing is the lack of adaptability to dynamically expanding datasets. This paper explores the dynamization of a static learned index for complex data through operations such as node splitting and broadening, enabling efficient adaptation to new data. Furthermore, we evaluate the trade-offs between static and dynamic approaches by introducing an amortized cost model to assess query performance in tandem with the build costs of the index structure, enabling experimental determination of when a dynamic learned index outperforms its static counterpart. We apply the dynamization method to a static learned index and demonstrate that its superior scaling quickly surpasses the static implementation in terms of overall costs as the database grows. This is an extended version of the paper presented at DAWAK 2025.
title On the Costs and Benefits of Learned Indexing for Dynamic High-Dimensional Data: Extended Version
topic Information Retrieval
Databases
url https://arxiv.org/abs/2507.05865