arrow
返回

Pivotal B plus tree for Byte-Addressable Persistent Memory

delete2022-01-01
delete0
delete
OA
AI
J
Jonghyeon Yoo
H
Hokeun Cha
W
Wook-Hee Kim
S
Sung‐Soon Park
B
Beomseok Nam *
DOI:10.1109/ACCESS.2022.3170916delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Over the past few years, various indexes have been redesigned for byte-addressable persistent memory. In this work, we design and implement PB+tree (Pivotal B+tree) that resolves the limitations of state-of-the-art fully persistent B+trees. First, PB+tree reduces the number of expensive shift operations by up to half by managing two sub-arrays separated by a pivot key. Second, PB+tree reads cachelines in ascending order, which makes PB+tree benefit from hardware prefetchers and run faster than state-of-the-art persistent B+trees that access cachelines in non-contiguous or descending order. Third, PB+tree employs an optimistic lock-free search algorithm to avoid repeatedly visiting the same tree node. Although the optimistic lock-free search algorithm involves a risk of visiting incorrect child nodes, PB+tree guarantees correct search results using the lazy correction algorithm using doubly linked sibling pointers. Our performance study shows that PB+tree outperforms the state-of-the-art fully persistent indexes by a large margin. A search algorithm without optimistic locking risks visiting the wrong child node, but PB+tree uses a lazy correction algorithm with doubly linked sibling pointers to ensure correct search results. Our performance studies show that PB+trees outperform state-of-the-art fully persistent indexes.
Keyword:
Tree data structures
fault tolerance
database concurrency operations

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

S
sungkyunkwan university (skku)
学者数:
3.7W
论文数: 3.6W
被引数: 49
U
university of wisconsin madison
学者数:
3.8W
论文数: 2.9W
被引数: 53
K
Konkuk University
学者数:
1.2W
论文数: 1.1W
被引数: 1.2W
University of Wisconsin System 封面图
University of Wisconsin System
学者数:
6.7W
论文数: 5.8W
被引数: 382
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Constriction Factor Particle Swarm Optimization based load balancing and cell association for 5G heterogeneous networks
err2021-12-01
err0
PREAI
errMohammad Kamrul Hasan; Teong Chee Chuah; Ayman A. El-Saleh; Muhammad Shafiq; Shoaib Ahmed Shaikh; Shayla Islam; Moez Krichen
err分享
err收藏
Carnivores, biases and Bergmann's rule
err2004-04-01
err0
PREAI
errSHAI MEIRI; TAMAR DAYAN; DANIEL SIMBERLOFF
err分享
err收藏
Survey: Self-Empowered Wireless Sensor Networks Security Taxonomy, Challenges, and Future Research Directions
err2023-09-15
err0
errOAAI
errMuhammad Adil; Varun G. Menon; Venki Balasubramanian; Sattam Rabia Alotaibi; Houbing Song; Zhanpeng Jin; Ahmed Farouk
err分享
err收藏
学者 查看更多内容