Superseding traditional indexes by orchestrating learning and geometry

03/01/2019
by   Paolo Ferragina, et al.
0

We design the first learned index that solves the dictionary problem with time and space complexity provably better than classic data structures for hierarchical memories, such as B-trees, and modern learned indexes. We call our solution the Piecewise Geometric Model index (PGM-index) because it turns the indexing of a sequence of keys into the coverage of a sequence of 2D-points via linear models (i.e. segments) suitably learned to trade query time vs space efficiency. This idea comes from some known heuristic results which we strengthen by showing that the minimal number of such segments can be computed via known and optimal streaming algorithms. Our index is then obtained by recursively applying this geometric idea that guarantees a smoothed adaptation to the "geometric complexity" of the input data. Finally, we propose a variant of the index that adapts not only to the distribution of the dictionary keys but also to their access frequencies, thus obtaining the first distribution-aware learned index. The second main contribution of this paper is the proposal and study of the concept of Multicriteria Data Structure, namely one that asks a data structure to adapt in an automatic way to the constraints imposed by the application of use. We show that our index is a multicriteria data structure because its significant flexibility in storage and query time can be exploited by a properly designed optimisation algorithm that efficiently finds its best design setting in order to match the input constraints. A thorough experimental analysis shows that our index and its multicriteria variant improve uniformly, over both time and space, classic and learned indexes up to several orders of magnitude.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2019

The PGM-index: a multicriteria, compressed and learned approach to data indexing

The recent introduction of learned indexes has shaken the foundations of...
research
06/19/2023

On Distribution Dependent Sub-Logarithmic Query Time of Learned Indexing

A fundamental problem in data management is to find the elements in an a...
research
06/24/2022

Learning Augmented Binary Search Trees

A treap is a classic randomized binary search tree data structure that i...
research
11/04/2019

Nearly Optimal Static Las Vegas Succinct Dictionary

Given a set S of n (distinct) keys from key space [U], each associated w...
research
05/24/2022

NFL: Robust Learned Index via Distribution Transformation

Recent works on learned index open a new direction for the indexing fiel...
research
08/29/2023

SALI: A Scalable Adaptive Learned Index Framework based on Probability Models

The growth in data storage capacity and the increasing demands for high ...
research
06/09/2020

Dynamic Interleaving of Content and Structure for Robust Indexing of Semi-Structured Hierarchical Data (Extended Version)

We propose a robust index for semi-structured hierarchical data that sup...

Please sign up or login with your details

Forgot password? Click here to reset