Paper Info
Title
A snappy b+-trees index reconstruction for main-memory storage systems
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.
Year
DOI
Venue
2006
10.1007/11751540_113
Lecture Notes in Computer Science
Keywords
Field
DocType
basic max-pl,backup time,snappy b,trees index reconstruction,real time service,time complexity,various real time application,restoration time,tree index structure,high performance,tree insertion,main-memory storage system,storage system,batch process,tree structure,real time,indexation
Computer science,Computer data storage,Tree (data structure),Algorithm,Reconstruction algorithm,Tree structure,Data recovery,Time complexity,Backup,Speedup
Conference
Volume
ISSN
ISBN
3980
0302-9743
3-540-34070-X
Citations 
PageRank 
References 
0
0.34
15
Authors
3
Name
Order
Citations
PageRank
Ig-hoon Lee1535.43
Junho Shim255977.12
Sang-goo Lee3832151.04