ALEX: An Updatable Adaptive Learned Index
Authors:
Open Access
- 31 May 2020
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 969-984
Abstract
Recent work on "learned indexes" has changed the way we look at the decades-old field of DBMS indexing. The key idea is that indexes can be thought of as "models" that predict the position of a key in a dataset. Indexes can, thus, be learned. The original work by Kraska et al. shows that a learned index beats a B+ tree by a factor of up to three in search time and by an order of magnitude in memory footprint. However, it is limited to static, read-only workloads. In this paper, we present a new learned index called ALEX which addresses practical issues that arise when implementing learned indexes for workloads that contain a mix of point lookups, short range queries, inserts, updates, and deletes. ALEX effectively combines the core insights from learned indexes with proven storage and indexing techniques to achieve high performance and low memory footprint. On read-only workloads, ALEX beats the learned index from Kraska et al. by up to 2.2X on performance with up to 15X smaller index size. Across the spectrum of read-write workloads, ALEX beats B+ trees by up to 4.1X while never performing worse, with up to 2000X smaller index size. We believe ALEX presents a key step towards making learned indexes practical for a broader class of database workloads with dynamic updates.Keywords
All Related Versions
Funding Information
- National Science Foundation (1900933)
- Defense Advanced Research Projects Agency (16-43-D3M-FP040)
This publication has 16 references indexed in Scilit:
- The adaptive radix tree: ARTful indexing for main-memory databases2013
- Cache craftiness for fast multicore key-value storage2012
- Benchmarking cloud serving systems with YCSB2010
- FAST2010
- An adaptive packed-memory arrayACM Transactions on Database Systems, 2007
- Insertion Sort is O(n log n)Theory of Computing Systems, 2006
- B-tree indexes, interpolation search, and skew2006
- PLOP-hashing: A grid file without directory2003
- Improving index performance through prefetchingACM SIGMOD Record, 2001
- Partial expansions for file organizations with an indexACM Transactions on Database Systems, 1987