ZBTree: A Fast and Scalable B+-Tree for Persistent Memory

被引:0
|
作者
Che, Wenkui [1 ]
Chen, Zhiwen [2 ]
Hu, Daokun [1 ]
Sun, Jianhua [1 ]
Chen, Hao [1 ]
机构
[1] Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Peoples R China
[2] Xiangtan Univ, Sch Comp Sci, Sch Cyberspace Sci, Xiangtan 411105, Peoples R China
基金
美国国家科学基金会;
关键词
Indexes; Random access memory; Metadata; Hardware; Throughput; Costs; Concurrency control; Database; index; persistent memory;
D O I
10.1109/TKDE.2024.3421232
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we present the design and implementation of ZBTree, a hotness-aware B+ -Tree for persistent memory (PMem). ZBTree leverages the PMem+DRAM architecture, which is featured with a volatile operation layer to accelerate data access and an order-preserving persistent layer to achieve fast recovery and low-overhead consistency and persistence guarantees. The operation layer contains inner nodes for indexing and compacted leaf nodes (DLeaves) that hold metadata. Based on leaf node compaction, we present a data lodging method, which supports to load hot data into fast DRAM dynamically, avoiding PMem accesses for subsequent reads of hot data and achieving improved read performance without incurring extra DRAM usage. In addition, we present a lightweight node splitting mechanism with constant persistence overhead that does not vary with node size. Our extensive evaluations show that ZBTree achieves higher throughput by a factor of 1.4x-6.3x compared to state-of-the-art tree indexes under a wide range of workloads. Meanwhile, ZBTree achieves comparable or faster recovery speed compared to existing designs.
引用
收藏
页码:9547 / 9563
页数:17
相关论文
共 50 条
  • [41] Probabilistic model and optimal reorganization of B+-tree with physical clustering
    Univ of Iowa, Iowa City, United States
    IEEE Trans Knowl Data Eng, 5 (826-832):
  • [42] A B+-tree based indexing technique for fuzzy numerical data
    Barranco, C. D.
    Campana, J. R.
    Medina, J. M.
    FUZZY SETS AND SYSTEMS, 2008, 159 (12) : 1431 - 1449
  • [43] B3-Tree: Byte-Addressable Binary B-Tree for Persistent Memory
    Cha, Hokeun
    Nam, Moohyeon
    Jin, Kibeom
    Seo, Jiwon
    Nam, Beomseok
    ACM TRANSACTIONS ON STORAGE, 2020, 16 (03)
  • [44] 并行B+-tree的存储结构及其操作
    孙文隽
    黑龙江大学自然科学学报, 1999, (02) : 47 - 50
  • [45] 并行B+-tree的存储结构及其操作
    孙文隽
    黑龙江大学自然科学学报, 1999, (03) : 39 - 43
  • [46] Probabilistic model and optimal reorganization of B+-tree with physical clustering
    Park, JS
    Sridhar, V
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1997, 9 (05) : 826 - 832
  • [47] Circ-Tree: A B plus -Tree Variant With Circular Design for Persistent Memory
    Wang, Chundong
    Brihadiswarn, Gunavaran
    Jiang, Xingbin
    Chattopadhyay, Sudipta
    IEEE TRANSACTIONS ON COMPUTERS, 2022, 71 (02) : 296 - 308
  • [48] Dash: Scalable Hashing on Persistent Memory
    Lu, Baotong
    Hao, Xiangpeng
    Wang, Tianzheng
    Lo, Eric
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2020, 13 (08): : 1147 - 1161
  • [49] A restructuring method for the concurrent B+-tree based on semantic consistency
    Lim, SC
    Lee, YJ
    Kim, MH
    6TH INTERNATIONAL CONFERENCE ON DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 1999, : 229 - 236
  • [50] Pivotal B plus tree for Byte-Addressable Persistent Memory
    Yoo, Jonghyeon
    Cha, Hokeun
    Kim, Wonbae
    Kim, Wook-Hee
    Park, Sung-Soon
    Nam, Beomseok
    IEEE ACCESS, 2022, 10 : 46725 - 46737