期刊
SOFTWARE-PRACTICE & EXPERIENCE
卷 53, 期 2, 页码 318-346出版社
WILEY
DOI: 10.1002/spe.3150
关键词
algorithms with prediction; binary search variants; learned index structures; search on sorted data platform
Learned Indexes use a model to restrict the search range of a sorted table, and using the SOSD benchmarking software, this study demonstrates that k-ary search is more efficient in certain computer architectures. This research provides guidelines for selecting the search routine within the learned indexing framework.
Learned Indexes use a model to restrict the search of a sorted table to a smaller interval. Typically, a final binary search is done using the lower_bound routine of the Standard C++ library. Recent studies have shown that on current processors other search approaches (such as k-ary search) can be more efficient in some applications. Using the SOSD learned indexing benchmarking software, we extend these results to show that k-ary search is indeed a better choice when using learned indexes. We highlight how such a choice may be dependent on the computer architecture used, for example, Intel I7 or Apple M1, and provide guidelines for the selection of the Search routine within the learned indexing framework.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据