Cuckoo index
<jats:p>In modern data warehousing, data skipping is essential for high query performance. While index structures such as B-trees or hash tables allow for precise pruning, their large storage requirements make them impractical for indexing secondary columns. Therefore, many systems rely on app...
Main Authors: | Kipf, Andreas, Chromejko, Damian, Hall, Alexander, Boncz, Peter, Andersen, David G. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Published: |
VLDB Endowment
2021
|
Online Access: | https://hdl.handle.net/1721.1/136700 |
Similar Items
-
Adaptive Hybrid Indexes
by: Anneser, Christoph, et al.
Published: (2022) -
Benchmarking learned indexes
by: Marcus, Ryan, et al.
Published: (2022) -
LSI: A Learned Secondary Index Structure
by: Kipf, Andreas, et al.
Published: (2022) -
Hardness-Preserving Reductions via Cuckoo Hashing
by: Berman, Itay, et al.
Published: (2021) -
RadixSpline: a single-pass learned index
by: Kipf, Andreas, et al.
Published: (2021)