Corpus ID: 236134468

Learned Sorted Table Search and Static Indexes in Small Space: Methodological and Practical Insights via an Experimental Study

  title={Learned Sorted Table Search and Static Indexes in Small Space: Methodological and Practical Insights via an Experimental Study},
  author={Domenico Amato and Raffaele Giancarlo and Giosu{\`e} Lo Bosco},
Sorted Table Search Procedures are the quintessential query-answering tool, still very useful, e.g, Search Engines (Google Chrome). Speeding them up, in small additional space with respect to the table being searched into, is still a quite significant achievement. Static Learned Indexes have been very successful in achieving such a speed-up, but leave open a major question: To what extent one can enjoy the speed-up of Learned Indexes while using constant or nearly constant additional space. By… Expand


An Eight-Dimensional Systematic Evaluation of Optimized Search Algorithms on Modern Processors
This paper evaluates a large set of optimized sequential, binary and k-ary search algorithms on a modern processor, considering hardware-sensitive optimization strategies as well as algorithmic variations resulting in an eight-dimensional evaluation space, and gives insights on expected interactions between search algorithms and optimizations on modern hardware. Expand
Array Layouts for Comparison-Based Searching
After extensive testing and tuning on a wide variety of modern hardware, the conclusion that, for small values of n, sorted order, combined with a good implementation of binary search, is best is arrived at. Expand
SOSD: A Benchmark for Learned Indexes
A new benchmarking framework is proposed that comes with a variety of real-world datasets and baseline implementations to compare against, and it is found that learned models indeed often outperform state-of-the-art implementations, and are therefore a promising direction for future research. Expand
CDFShop: Exploring and Optimizing Learned Index Structures
This demonstration showcases CDFShop, a tool to explore and optimize recursive model indexes (RMIs), a type of learned index structure, and allows audience members to gain an intuition about various tuning parameters of RMIs and why learned index structures can greatly accelerate search. Expand
The Case for Learned Index Structures
The idea of replacing core components of a data management system through learned models has far reaching implications for future systems designs and that this work provides just a glimpse of what might be possible. Expand
Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search?
This paper introduces SIP (Slope reuse Interpolation), an optimized implementation ofInterpolation Search, and TIP (Three point Interpolations), a new search algorithm that uses linear fractions to interpolate on non-uniform distributions that is evaluated against a similarly optimized Binary Search method. Expand
Cache Conscious Indexing for Decision-Support in Main Memory
A new indexing technique called \Cache-Sensitive Search Trees" (CSS-trees) is proposed, to provide faster lookup times than binary search by paying attention to reference locality and cache behavior, without using substantial extra space. Expand
Time-space trade-offs for predecessor search
The first lower bound for an explicit problem which breaks this communication complexity barrier is given, and it is implied that van Emde Boas' classic data structure from [FOCS'75] is optimal in this case. Expand
RadixSpline: a single-pass learned index
RadixSpline is introduced, a learned index that can be built in a single pass over the data and is competitive with state-of-the-art learned index models, like RMI, in size and lookup performance. Expand
Sorting and searching