Back to Search Start Over

Morphtree: a polymorphic main-memory learned index for dynamic workloads.

Authors :
Luo, Yongping
Jin, Peiquan
Chu, Zhaole
Wang, Xiaoliang
Yuan, Yigui
Zhang, Zhou
Luo, Yun
Wu, Xufei
Zou, Peng
Source :
VLDB Journal International Journal on Very Large Data Bases; Jul2024, Vol. 33 Issue 4, p1065-1084, 20p
Publication Year :
2024

Abstract

Modern database systems rely on indexes to accelerate data access. The recently proposed learned indexes can offer higher search performance with lower space costs than traditional indexes like B+-tree. We observe that existing main-memory learned indexes are particularly optimized for read-heavy workloads. However, such an optimization comes at the cost of model training and handling out-of-range key insertions, which will worsen the overall performance. We argue that workloads are not always read-heavy in real applications, and it is more important and practical to make learned indexes work efficiently for dynamic workloads with changing access patterns and data distributions. In this paper, we aim to improve the practicality of learned indexes by making them adaptive to dynamic workloads. Specifically, we propose a new polymorphic learned index named Morphtree, which can adaptively change the index structure to provide stable and high performance for dynamic workloads. The novelty of Morphtree lies in three aspects: (1) a decoupled tree structure for separating the inner search tree from the data layer consisting of leaf nodes, (2) a read-optimized learned inner tree for improving the performance of index search, and (3) an evolving data layer for automatically transforming node layouts into read friendly or write friendly according to workload changes. We evaluate these new ideas of Morphtree on various datasets and workloads. The comparative results with six up-to-date learned indexes, including ALEX, PGM-index, FITing-tree, LIPP, FINEdex, and XIndex, show that Morphtree can achieve, on average, 0.56x and 3x improvements in lookup and insertion performance, respectively. Moreover, when evaluated on dynamic workloads with changing lookup ratios and data distributions, Morphtree can achieve a sustained high throughput across different real-world datasets and query patterns, owing to its ability to automatically adjust the index structure according to workload changes. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
10668888
Volume :
33
Issue :
4
Database :
Complementary Index
Journal :
VLDB Journal International Journal on Very Large Data Bases
Publication Type :
Academic Journal
Accession number :
178657129
Full Text :
https://doi.org/10.1007/s00778-023-00823-y