Are updatable learned indexes ready?

Author:

Wongkham Chaichon1,Lu Baotong1,Liu Chris1,Zhong Zhicong1,Lo Eric1,Wang Tianzheng2

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3