Automatically Finding Optimal Index Structure

08/07/2022
by   Supawit Chockchowwat, et al.
0

Existing learned indexes (e.g., RMI, ALEX, PGM) optimize the internal regressor of each node, not the overall structure such as index height, the size of each layer, etc. In this paper, we share our recent findings that we can achieve significantly faster lookup speed by optimizing the structure as well as internal regressors. Specifically, our approach (called AirIndex) expresses the end-to-end lookup time as a novel objective function, and searches for optimal design decisions using a purpose-built optimizer. In our experiments with state-of-the-art methods, AirIndex achieves 3.3x-7.7x faster lookup for the data stored on local SSD, and 1.4x-3.0x faster lookup for the data on Azure Cloud Storage.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2023

AirIndex: Versatile Index Tuning Through Data and Storage

The end-to-end lookup latency of a hierarchical index – such as a B-tree...
research
12/26/2021

Airphant: Cloud-oriented Document Indexing

Modern data warehouses can scale compute nodes independently of storage....
research
04/30/2020

RadixSpline: A Single-Pass Learned Index

Recent research has shown that learned models can outperform state-of-th...
research
12/03/2019

Learning Multi-dimensional Indexes

Scanning and filtering over multi-dimensional tables are key operations ...
research
10/16/2022

End-to-End Learning to Index and Search in Large Output Spaces

Extreme multi-label classification (XMC) is a popular framework for solv...
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
12/13/2017

Applying the Residue Number System to Network Inference

This work explores the lesser studied objective of optimizing the multip...

Please sign up or login with your details

Forgot password? Click here to reset