A highly write-optimized concurrent B plus -tree for persistent memory

doi:10.1016/j.future.2024.02.008

A highly write-optimized concurrent B plus -tree for persistent memory

2024-06-01

0

PRE

AI

DOI：10.1016/j.future.2024.02.008

原文链接

原文求助

摘要

En 中文

Writes to persistent memory are considered expensive for the limited naive write performance of the device and the implementation of persist primitives. Write -optimized strategies are widely adopted in designing B+ -Trees for persistent memory. In this paper, we concluded two major issues, including successive writes and recovery efficiency, on existing write -optimizing strategies. A highly write -optimized B+ -Tree, HW-tree, is proposed to address these issues. HW-tree is constructed with three novel designs including distributed validation, log -free split, and concurrent recovery. Experimental results show that HW-tree can outperform its counterparts by large margins in almost all test workloads. The recovery time for reconstructing the tree can also be reduced by 88%.

Keyword:

Persist memory

B plus -tree

Failure-atomicity

Concurrency

Write-optimizing

A highly write-optimized concurrent B plus -tree for persistent memory

摘要

期刊

机构