There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.number | 3 | - |
dc.citation.title | ACM TRANSACTIONS ON STORAGE | - |
dc.citation.volume | 16 | - |
dc.contributor.author | Cha, Hokeun | - |
dc.contributor.author | Nam, Moohyeon | - |
dc.contributor.author | Jin, Kibeom | - |
dc.contributor.author | Seo, Jiwon | - |
dc.contributor.author | Nam, Beomseok | - |
dc.date.accessioned | 2023-12-21T17:08:47Z | - |
dc.date.available | 2023-12-21T17:08:47Z | - |
dc.date.created | 2020-11-20 | - |
dc.date.issued | 2020-08 | - |
dc.description.abstract | In this work, we propose B-3-tree, a hybrid index for persistent memory that leverages the byte-addressability of the in-memory index and the page locality of B-trees. As in the byte-addressable in-memory index, B-3-tree is updated by 8-byte store instructions. Also, as in disk-based index, B-3-tree is failure-atomic since it makes every 8-byte store instruction transform a consistent index into another consistent index without the help of expensive logging. Since expensive logging becomes unnecessary, the number of cacheline flush instructions required for B-3-tree is significantly reduced. Our performance study shows that B-3-tree outperforms other state-of-the-art persistent indexes in terms of insert and delete performance. While B-3-tree shows slightly worse performance for point query performance, the range query performance of B-3-tree is 2x faster than FAST and FAIR B-tree because the leaf page size of B-3-tree can be set to 8x larger than that of FAST and FAIR B-tree without degrading insertion performance. We also show that read transactions can access B-3- tree without acquiring a shared lock because B-3-tree remains always consistent while a sequence of 8-byte write operations are making changes to it. As a result, B-3-tree provides high concurrency level comparable to FAST and FAIR B-tree. | - |
dc.identifier.bibliographicCitation | ACM TRANSACTIONS ON STORAGE, v.16, no.3 | - |
dc.identifier.doi | 10.1145/3394025 | - |
dc.identifier.issn | 1553-3077 | - |
dc.identifier.scopusid | 2-s2.0-85092349191 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/48803 | - |
dc.identifier.wosid | 000583743600003 | - |
dc.language | 영어 | - |
dc.publisher | ASSOC COMPUTING MACHINERY | - |
dc.title | B-3-Tree: Byte-Addressable Binary B-Tree for Persistent Memory | - |
dc.type | Article | - |
dc.description.isOpenAccess | FALSE | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture; Computer Science, Software Engineering | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.type.docType | Article | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Non-volatile memory | - |
dc.subject.keywordAuthor | data structure | - |
dc.subject.keywordAuthor | persistent indexing | - |
dc.subject.keywordPlus | PERFORMANCE | - |
dc.subject.keywordPlus | STORAGE | - |
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.