
TL;DR
This paper introduces a novel learned adaptive indexing method that builds indexes dynamically during query processing, leveraging workload prediction to improve performance in changing environments.
Contribution
It presents the first learned adaptive index that constructs itself on the fly, combining machine learning with adaptive indexing techniques for dynamic workloads.
Findings
Achieves 1.2x to 5.6x faster query performance
Outperforms existing adaptive indexes in most tested scenarios
Utilizes workload prediction to enhance index effectiveness
Abstract
Indexes can significantly improve search performance in relational databases. However, if the query workload changes frequently or new data updates occur continuously, it may not be worthwhile to build a conventional index upfront for query processing. Adaptive indexing is a technique in which an index gets built on the fly as a byproduct of query processing. In recent years, research in database indexing has taken a new direction where machine learning models are employed for the purpose of indexing. These indexes, known as learned indexes, can be more efficient compared to traditional indexes such as B+-tree in terms of memory footprints and query performance. However, a learned index has to be constructed upfront and requires training the model in advance, which becomes a challenge in dynamic situations when workload changes frequently. To the best of our knowledge, no learned…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
