Answers are grounded in this paper and cite their sources.
Learned indexes leverage machine learning models to approximate data distributions and predict key positions, offering better performance than traditional index structures such as B+Trees. As data in real-world applications evolve rapidly, the timely and efficient updating of learned indexes has become an increasingly important research problem, attracting growing attention in recent studies. However, under update-intensive workloads with frequent insertions and deletions, existing learned indexes cannot update the model in a timely manner. Moreover, they ignore the impact of deletions on model accuracy. These limitations lead to degraded prediction accuracy and increased query latency, undermining the core advantage of learned indexes. To fill in this gap, in this paper, we design a dynamic learned index (denoted as DynaMind) that is able to timely update the model with the frequent change of data. Specifically, we propose a novel score function to determine the appropriate timing at which a learned index should initiate an update by measuring the influence of updated data on the model accuracy. To enable efficient model updates, we devise a timely learned index update algorithm that implements both lightweight incremental learning for insertions and machine unlearning for deletions together, ensuring the model continuously evolves without full retraining. Extensive experiments on real-world and synthetic datasets show that DynaMind achieves competitive throughput compared to state-of-the-art works while improving the prediction accuracy. The proportion of keys with zero prediction error increases by more than 10% after updates.
No takes yet. Share an insight, caveat, or question.
Cheng et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: