CAWBT: NVM-Based B plus Tree Index Structure Using Cache Line Sized Atomic Write

被引：0

作者：

Lee, Dokeun ^{[1
]}

Lee, Seongjin ^{[2
]}

Won, Youjip ^{[3
]}

机构：

[1] Hanyang Univ, Dept Comp Software, Seoul, South Korea

[2] Gyeongsang Natl Univ, Dept Aerosp & Software Engn, Jinju, South Korea

[3] Korea Adv Inst Sci & Technol, Sch Elect Engn, Daejeon, South Korea

来源：

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2019年 / E102D卷 / 12期

基金：

新加坡国家研究基金会;

关键词：

non-volatile memory; key-value store; index structure; B plus tree;

D O I：

10.1587/transinf.2019EDP7034

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Indexing is one of the fields where the non-volatile memory (NVM) has the advantages of byte-addressable characteristics and fast read/write speed. The existing index structures for NVM have been developed based on the fact that the size of cache line and the atomicity guarantee unit of NVM are different and they tried to overcome the weakness of consistency from the difference. To overcome the weakness, an expensive flush operation is required which results in a lower performance than a basic B+tree index. Recent studies have shown that the I/O units of the NVM can be matched with the atomicity guarantee units under limited circumstances. In this paper, we propose a Cache line sized Atomic Write B+tree (CAWBT), which is a minimal B+tree structure that shows higher performance than a basic b+ tree and designed for NVM. CAWBT has almost same performance compared to basic B+tree without consistency guarantee and shows remarkable performance improvement compared to other B+tree indexes for NVM.

引用

页码：2441 / 2450

页数：10