Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 서지원 | - |
dc.date.accessioned | 2022-03-23T00:34:53Z | - |
dc.date.available | 2022-03-23T00:34:53Z | - |
dc.date.issued | 2020-07 | - |
dc.identifier.citation | ACM TRANSACTIONS ON STORAGE, v. 16, no. 3, article no. 17 | en_US |
dc.identifier.issn | 1553-3077 | - |
dc.identifier.issn | 1553-3093 | - |
dc.identifier.uri | https://dl.acm.org/doi/10.1145/3394025 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/169323 | - |
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. | en_US |
dc.description.sponsorship | This research was supported by National Research Foundation of Korea (No. 2018R1A2B3006681, Improving Data Processing Performance with Byte-Addressable Non-Volatile Memory) and National Research Foundation of Korea (No. 2016M3C4A7952587, PF Class Heterogeneous High Performance Computer Development), and Institute for Information & Communications Technology Promotion (IITP) (grant No. 2018-0-00549, Extremely Scalable Order-preserving Operating System for Manycore and Non-volatile Memory) funded by Ministry of Science and ICT, Korea, and NST (B551179-12-04-00, ETRI R&D grant 19ZS1220). | en_US |
dc.language.iso | en | en_US |
dc.publisher | ASSOC COMPUTING MACHINERY | en_US |
dc.subject | Non-volatile memory | en_US |
dc.subject | data structure | en_US |
dc.subject | persistent indexing | en_US |
dc.title | B3-Tree: Byte-Addressable Binary B-Tree for Persistent Memory | en_US |
dc.type | Article | en_US |
dc.relation.no | 3 | - |
dc.relation.volume | 16 | - |
dc.identifier.doi | 10.1145/3394025 | - |
dc.relation.page | 1-27 | - |
dc.relation.journal | ACM TRANSACTIONS ON STORAGE | - |
dc.contributor.googleauthor | Cha, Hokeun | - |
dc.contributor.googleauthor | Nam, Moohyeon | - |
dc.contributor.googleauthor | Jin, Kibeom | - |
dc.contributor.googleauthor | Seo, Jiwon | - |
dc.contributor.googleauthor | Nam, Beomseok | - |
dc.relation.code | 2020051324 | - |
dc.sector.campus | S | - |
dc.sector.daehak | COLLEGE OF ENGINEERING[S] | - |
dc.sector.department | SCHOOL OF COMPUTER SCIENCE | - |
dc.identifier.pid | seojiwon | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.