A snappy b+-trees index reconstruction for main-memory storage systems

  • Authors:

  • Ig-hoon Lee;Junho Shim;Sang-goo Lee

  • Affiliations:

  • School of Computer Science & Engineering, Seoul National University, Seoul, Korea;Department of Computer Science, Sookmyung Women’s University, Seoul, Korea;School of Computer Science & Engineering, Seoul National University, Seoul, Korea

  • Venue:
  • ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.