Learned Index with Dynamic

Abstract

Index structure is a fundamental component in database and facilitates broad data retrieval applications. Recent learned index methods show superior performance by learning hidden yet useful data distribution with the help of machine learning, and provide a guarantee that the prediction error is no more than a pre-defined . However, existing learned index methods adopt a fixed for all the learned segments, neglecting the diverse characteristics of different data localities. In this paper, we propose a mathematically-grounded learned index framework with dynamic , which is efficient and pluggable to existing learned index methods. We theoretically analyze prediction error bounds that link with data characteristics for an illustrative learned index method. Under the guidance of the derived bounds, we learn how to vary and improve the index performance with a better space-time trade-off. Experiments with real-world datasets and several state-of-the-art methods demonstrate the efficiency, effectiveness and usability of the proposed framework.

Tasks

Reproductions