Fast rebuilding B+-Trees for index recovery
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:18:34Z | - |
dc.date.issued | 2006-07 | - |
dc.identifier.issn | 0916-8532 | - |
dc.identifier.uri | https://scholarworks.sookmyung.ac.kr/handle/2020.sw.sookmyung/15108 | - |
dc.description.abstract | Rebuilding an index is an essential step for database recovery. Fast recovery of the index is a necessary condition for fast database recovery. The B+-Tree is the most popular index structure in database systems. In this paper, we present a fast B+-Tree rebuilding algorithm called Max-PL. The main idea of Max-PL is that at first it constructs a B+-Tree index structure using the pre-stored max keys of the leaf nodes, and then inserts the keys and data pointers into the index. The algorithm employs a pipelining mechanism for reading the data records and inserting the keys into the index. It also exploits parallelisms in several phases to boost the overall performance. We analyze the time complexity and space requirement of the algorithm, and perform the experimental study to compare its performance to other B+-Trees rebuilding algorithms; Sequential Insertion and Batch-Construction. The results show that our algorithm runs on average at least 670% faster than Sequential Insertion and 200% faster than Batch-Construction. | - |
dc.format.extent | 11 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.title | Fast rebuilding B+-Trees for index recovery | - |
dc.type | Article | - |
dc.publisher.location | 일본 | - |
dc.identifier.doi | 10.1093/ietisy/e89-d.7.2223 | - |
dc.identifier.scopusid | 2-s2.0-33747875568 | - |
dc.identifier.wosid | 000238961900031 | - |
dc.identifier.bibliographicCitation | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E89D, no.7, pp 2223 - 2233 | - |
dc.citation.title | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | - |
dc.citation.volume | E89D | - |
dc.citation.number | 7 | - |
dc.citation.startPage | 2223 | - |
dc.citation.endPage | 2233 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.subject.keywordPlus | MEMORY DATABASE-SYSTEMS | - |
dc.subject.keywordAuthor | B plus -Trees | - |
dc.subject.keywordAuthor | index rebuilding | - |
dc.subject.keywordAuthor | index reconstruction | - |
dc.subject.keywordAuthor | index recovery | - |
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.