Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Fast Rebuilding B+-Trees for Index Recovery Ig-hoon LEE Junho SHIM Sang-goo LEE Publication IEICE TRANSACTIONS on Information and Systems Vol.E89-D No.7 pp.2223-2233 Publication Date: 2006/07/01 Online ISSN: 1745-1361 DOI: 10.1093/ietisy/e89-d.7.2223 Print ISSN: 0916-8532 Type of Manuscript: PAPER Category: Database Keyword: B+-Trees, index rebuilding, index reconstruction, index recovery, Full Text: PDF(2.2MB)>>
Summary: 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. | ||||||||||
| ||||||||||
