A snappy B+-trees index reconstruction for main-memory storage systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Ig-hoon | - |
dc.contributor.author | Shim, Junho | - |
dc.contributor.author | Lee, Sang-goo | - |
dc.date.available | 2021-02-22T15:45:56Z | - |
dc.date.issued | 2006-05 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/15447 | - |
dc.description.abstract | A main memory system employs a main memory rather than a disk as a primary storage and efficiently supports various real time applications that require high performance. The time to recover the system from failure needs to be shortened for real time service, and fast index reconstruction is an essential step for data recovery. In this paper, we present a snappy B+-Tree reconstruction algorithm called Max-PL. The basic Max-PL (called Max) stores the max keys of the leaf nodes at backup time and reconstructs the B+-Tree index structure using the pre-stored max keys at restoration time. Max-PL employs a parallelism to Max in order to improve the performance. We analyze the time complexity of the algorithm, and perform the experimental evaluation to compare its performance with others. Using Max-PL, we achieve a speedup of 2 over Batch Construction and 6.7 over B+-tree Insertion at least. | - |
dc.format.extent | 9 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | A snappy B+-trees index reconstruction for main-memory storage systems | - |
dc.type | Article | - |
dc.publisher.location | 독일 | - |
dc.identifier.doi | 10.1007/11751540_113 | - |
dc.identifier.scopusid | 2-s2.0-33745944272 | - |
dc.identifier.wosid | 000237642900113 | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1, v.3980, pp 1036 - 1044 | - |
dc.citation.title | COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 1 | - |
dc.citation.volume | 3980 | - |
dc.citation.startPage | 1036 | - |
dc.citation.endPage | 1044 | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | DATABASE-SYSTEMS | - |
dc.identifier.url | https://link.springer.com/chapter/10.1007%2F11751540_113 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Sookmyung Women's University. Cheongpa-ro 47-gil 100 (Cheongpa-dong 2ga), Yongsan-gu, Seoul, 04310, Korea02-710-9127
Copyright©Sookmyung Women's University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.