A Snappy B+-Trees Index Reconstruction for Main-Memory Storage Systems

  • Ig-hoon Lee
  • Junho Shim
  • Sang-goo Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3980)


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.


Leaf Node Index Structure Reconstruction Time Node Split Restoration Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Garcia-Molina, H., Salem, K.: Main memory database systems: an overview. IEEE Trans. on Knowledge and Data Engineering 4(6), 509–516 (1992)CrossRefGoogle Scholar
  2. 2.
    IBM Corporation,, JFS overview (January 2000)
  3. 3.
    Jagadish, H.V., Lieuwen, D., Rastogi, R., Silberschatz, A.: Dali: A High Performance Main Memory Storage Manager. In: Proc. 20th conf. on Very Large Databases (1994)Google Scholar
  4. 4.
    Jagadish, H.V., Silberschatz, A., Sudarshan, S.: Recovering from Main Memory Lapses. In: Proc. 19th Intl. Conf. on Very Large Databases, pp. 391–404 (1993)Google Scholar
  5. 5.
    Kim, S.W., Won, H.S.: Batch-Construction of B+-Trees. In: Proc. 2001 ACM Symposium on Applied Computing, pp. 231–235 (2001)Google Scholar
  6. 6.
    Lee, J.C., Kim, K.H., Cha, S.K.: Differential Logging: A Commutative and Associative Logging Scheme for Highly Parallel Main Memory Database. In: 17th Intl. Conf. on Data Engineering, pp. 173–182 (2001)Google Scholar
  7. 7.
    Lee, S.S., Yoon, Y.I.: An Index Recovery Method For Real-Time DBMS in Client-Server Architecture. In: Proc. 4th Intl. Workshop on Real-Time Computing Systems and Applications, pp. 110–117 (1997)Google Scholar
  8. 8.
    Lehman, T.J., Carey, M.J.: A Study of Index Structures for Main Memory Database Management Systems. In: Proc. 12th Intl. Conf. on Very Large Databases, pp. 294–303 (1986)Google Scholar
  9. 9.
    Levy, E., Silberschatz, A.: Incremental recovery in main memory database Systems. IEEE Trans. on Knowledge and Data Engineering 4(6), 529–540 (1992)CrossRefGoogle Scholar
  10. 10.
    Lomet, D., Salzberg, B.: Concurrency and recovery for index trees. VLDB Journal 6(3), 224–240 (1997)CrossRefGoogle Scholar
  11. 11.
    Lu, H.J., Ng, Y.Y., Tang, Z.P.: T-Tree or B-Tree: Main Memory Database Index Structure Revisited. In: Proc. 11th Australasian Database Conference (2000)Google Scholar
  12. 12.
    Park, J.H., Kwon, Y.S., Kim, K.H., Lee, S.H., Park, B.D., Cha, S.K.: Xmas: An Extensible Main-Memory Storage System for High-Performance Applications. In: Proc. 1998 ACM SIGMOD, pp. 578–580 (1998)Google Scholar
  13. 13.
    Ramakrishnan, R., Gehrke, J.: Database Management Systems, 3rd edn. McGraw-Hill, New York (2003)MATHGoogle Scholar
  14. 14.
    Rao, J., Ross, K.A.: Making B +  Trees Cache Conscious in Main Memory. In: Proc. 2000 ACM SIGMOD, pp. 475–486 (2000)Google Scholar
  15. 15.
    Salem, K., Garcia-Molina, H.: Checkpointing memory-resident databases. In: Proc. 5th Intl. Conf. on Data Engineering, pp. 452–462 (1989)Google Scholar
  16. 16.
    Silberschatz, A., Korth, H.F., Sudarshan, S.: Database system concepts. The McGraw-Hill Companies, Inc., New York (1997)MATHGoogle Scholar
  17. 17.
    Silicon Graphics, Inc.,, XFS: A high-performance journaling file system (July 2005)

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ig-hoon Lee
    • 1
  • Junho Shim
    • 2
  • Sang-goo Lee
    • 1
  1. 1.School of Computer Science & EngineeringSeoul National UniversitySeoulKorea
  2. 2.Department of Computer ScienceSookmyung Women’s UniversitySeoulKorea

Personalised recommendations