Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 46737 | - |
dc.citation.startPage | 46725 | - |
dc.citation.title | IEEE ACCESS | - |
dc.citation.volume | 10 | - |
dc.contributor.author | Yoo, Jonghyeon | - |
dc.contributor.author | Cha, Hokeun | - |
dc.contributor.author | Kim, Wonbae | - |
dc.contributor.author | Kim, Wook-Hee | - |
dc.contributor.author | Park, Sung-Soon | - |
dc.contributor.author | Nam, Beomseok | - |
dc.date.accessioned | 2023-12-21T14:15:11Z | - |
dc.date.available | 2023-12-21T14:15:11Z | - |
dc.date.created | 2022-05-19 | - |
dc.date.issued | 2022-04 | - |
dc.description.abstract | 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. | - |
dc.identifier.bibliographicCitation | IEEE ACCESS, v.10, pp.46725 - 46737 | - |
dc.identifier.doi | 10.1109/ACCESS.2022.3170916 | - |
dc.identifier.issn | 2169-3536 | - |
dc.identifier.scopusid | 2-s2.0-85129618111 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/58564 | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9764757/ | - |
dc.identifier.wosid | 000791711700001 | - |
dc.language | 영어 | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.title | Pivotal B plus tree for Byte-Addressable Persistent Memory | - |
dc.type | Article | - |
dc.description.isOpenAccess | TRUE | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications | - |
dc.relation.journalResearchArea | Computer Science; Engineering; Telecommunications | - |
dc.type.docType | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Tree data structures | - |
dc.subject.keywordAuthor | fault tolerance | - |
dc.subject.keywordAuthor | database concurrency operations | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.