The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
인덱싱은 비휘발성 메모리(NVM)가 바이트 주소 지정 가능 특성과 빠른 읽기/쓰기 속도라는 장점을 갖는 분야 중 하나입니다. 기존 NVM의 인덱스 구조는 캐시라인의 크기와 NVM의 원자성 보장 단위가 다르다는 점을 기반으로 개발되었으며, 그 차이로 인한 일관성의 약점을 극복하려고 노력했습니다. 이러한 약점을 극복하기 위해서는 비용이 많이 드는 플러시 작업이 필요하며 이는 기본 B+트리 인덱스보다 성능이 저하됩니다. 최근 연구에 따르면 NVM의 I/O 장치는 제한된 상황에서 원자성 보장 장치와 일치할 수 있습니다. 본 논문에서는 NVM용으로 설계된 기본 b+ 트리보다 높은 성능을 보이는 최소 B+ 트리 구조인 CAWBT(Cache Line size Atomic Write B+ tree)를 제안한다. CAWBT는 일관성 보장이 없는 기본 B+트리와 거의 동일한 성능을 가지며, NVM의 다른 B+트리 인덱스에 비해 눈에 띄는 성능 향상을 보여줍니다.
Dokeun LEE
Hanyang University
Seongjin LEE
Gyeongsang National University
Youjip WON
KAIST
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Dokeun LEE, Seongjin LEE, Youjip WON, "CAWBT: NVM-Based B+Tree Index Structure Using Cache Line Sized Atomic Write" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 12, pp. 2441-2450, December 2019, doi: 10.1587/transinf.2019EDP7034.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2019EDP7034/_p
부
@ARTICLE{e102-d_12_2441,
author={Dokeun LEE, Seongjin LEE, Youjip WON, },
journal={IEICE TRANSACTIONS on Information},
title={CAWBT: NVM-Based B+Tree Index Structure Using Cache Line Sized Atomic Write},
year={2019},
volume={E102-D},
number={12},
pages={2441-2450},
abstract={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.},
keywords={},
doi={10.1587/transinf.2019EDP7034},
ISSN={1745-1361},
month={December},}
부
TY - JOUR
TI - CAWBT: NVM-Based B+Tree Index Structure Using Cache Line Sized Atomic Write
T2 - IEICE TRANSACTIONS on Information
SP - 2441
EP - 2450
AU - Dokeun LEE
AU - Seongjin LEE
AU - Youjip WON
PY - 2019
DO - 10.1587/transinf.2019EDP7034
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2019
AB - 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.
ER -