SALI: A Scalable Adaptive Learned Index Framework based on Probability Models

Author:

Ge Jiake1ORCID,Zhang Huanchen2ORCID,Shi Boyu1ORCID,Luo Yuanhui1ORCID,Guo Yunda1ORCID,Chai Yunpeng1ORCID,Chen Yuxing3ORCID,Pan Anqun3ORCID

Affiliation:

1. Renmin University of China, Beijing, China

2. Tsinghua University & Shanghai Qi Zhi Institute, Beijing, China

3. Tencent Inc., Beijing, China

Abstract

The growth in data storage capacity and the increasing demands for high performance have created several challenges for concurrent indexing structures. One promising solution is the learned index, which uses a learning-based approach to fit the distribution of stored data and predictively locate target keys, significantly improving lookup performance. Despite their advantages, prevailing learned indexes exhibit constraints and encounter issues of scalability on multi-core data storage. This paper introduces SALI, the Scalable Adaptive Learned Index framework, which incorporates two strategies aimed at achieving high scalability, improving efficiency, and enhancing the robustness of the learned index. Firstly, a set of node-evolving strategies is defined to enable the learned index to adapt to various workload skews and enhance its concurrency performance in such scenarios. Secondly, a lightweight strategy is proposed to maintain statistical information within the learned index, with the goal of further improving the scalability of the index. Furthermore, to validate their effectiveness, SALI applied the two strategies mentioned above to the learned index structure that utilizes fine-grained write locks, known as LIPP. The experimental results have demonstrated that SALI significantly enhances the insertion throughput with 64 threads by an average of 2.04x compared to the second-best learned index. Furthermore, SALI accomplishes a lookup throughput similar to that of LIPP+.

Funder

National Natural Science Foundation of China

Publisher

Association for Computing Machinery (ACM)

Reference44 articles.

1. Adaptive Hybrid Indexes

2. Yifan Dai , Yien Xu , Aishwarya Ganesan , Ramnatthan Alagappan , Brian Kroth , Andrea C Arpaci-Dusseau , and Remzi H Arpaci-Dusseau . 2020 . From wisckey to bourbon: A learned index for log-structured merge trees . In Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation. 155--171 . Yifan Dai, Yien Xu, Aishwarya Ganesan, Ramnatthan Alagappan, Brian Kroth, Andrea C Arpaci-Dusseau, and Remzi H Arpaci-Dusseau. 2020. From wisckey to bourbon: A learned index for log-structured merge trees. In Proceedings of the 14th USENIX Conference on Operating Systems Design and Implementation. 155--171.

3. ALEX: An Updatable Adaptive Learned Index

4. Tsunami

5. The PGM-index

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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