期刊
PROCEEDINGS OF THE VLDB ENDOWMENT
卷 14, 期 1, 页码 1-13出版社
ASSOC COMPUTING MACHINERY
DOI: 10.14778/3421424.3421425
关键词
-
资金
- Intel
- Microsoft as part of the MIT Data Systems and AI Lab (DSAIL) at MIT
- NSF [IIS 1900933]
- DARPA Award [16-43-D3M-FP040]
Recent advancements in learned index structures propose replacing existing index structures, like B -Trees, with approximate learned models. In this work, we present a unified benchmark that compares well-tuned implementations of three learned index structures against several state-of-the-art traditional baselines. Using four real-world datasets, we demonstrate that learned index structures can indeed outperform non-learned indexes in read-only in-memory workloads over a dense array. We investigate the impact of caching, pipelining, dataset size, and key size. We study the performance profile of learned index structures, and build an explanation for why learned models achieve such good performance. Finally, we investigate other important properties of learned index structures, such as their performance in multi-threaded systems and their build times.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据