Affiliation:
1. The Chinese University of Hong Kong
2. Simon Fraser University
Abstract
Recently, numerous promising results have shown that updatable learned indexes can perform better than traditional indexes with much lower memory space consumption. But it is unknown how these learned indexes compare against each other and against the traditional ones under realistic workloads with changing data distributions and concurrency levels. This makes practitioners still wary about how these new indexes would actually behave in practice. To fill this gap, this paper conducts the first comprehensive evaluation on updatable learned indexes. Our evaluation uses ten real datasets and various workloads to challenge learned indexes in three aspects: performance, memory space efficiency and robustness. Based on the results, we give a series of takeaways that can guide the future development and deployment of learned indexes.
Publisher
Association for Computing Machinery (ACM)
Subject
General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development
Reference64 articles.
1. R. Bayer and M. Schkolnick. 1977. Concurrency of Operations on B-Trees. Acta Inf. (1977). R. Bayer and M. Schkolnick. 1977. Concurrency of Operations on B-Trees. Acta Inf. (1977).
2. Towards a Benchmark for Learned Systems
3. Timo Bingmann . 2013. STX B+ Tree 0.9. https://panthema.net/2007/stx-btree/, retrieved Sep. 1, 2021 . Timo Bingmann. 2013. STX B+ Tree 0.9. https://panthema.net/2007/stx-btree/, retrieved Sep. 1, 2021.
4. Robert Binna and et al. 2018. HOT: A Height Optimized Trie Index for Main-Memory Database Systems . In Proceedings of the 2018 International Conference on Management of Data. Robert Binna and et al. 2018. HOT: A Height Optimized Trie Index for Main-Memory Database Systems. In Proceedings of the 2018 International Conference on Management of Data.
5. A Learned Approach to Design Compressed Rank/Select Data Structures
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. LITS: An Optimized Learned Index for Strings;Proceedings of the VLDB Endowment;2024-07
2. Making In-Memory Learned Indexes Efficient on Disk;Proceedings of the ACM on Management of Data;2024-05-29
3. Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction;Proceedings of the ACM on Management of Data;2024-05-29
4. Can Learned Indexes be Built Efficiently? A Deep Dive into Sampling Trade-offs;Proceedings of the ACM on Management of Data;2024-05-29
5. A Fully On-Disk Updatable Learned Index;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13