Journal of Jilin University Science Edition

Previous Articles     Next Articles

Index Storage Based on B+ Tree

GENG Qingtian1,2, DI Jing3, CHANG Liang1, ZHAO Hongwei1   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China; 2. School of Computer Science and Technology, Changchun Normal University, Changchun 130032, China;3. Network Center, Changchun Normal University, Changchun 130032, China
  • Received:2013-05-21 Online:2013-11-26 Published:2013-11-21
  • Contact: ZHAO Hongwei E-mail:zhaohw@jlu.edu.cn

Abstract:

Since in the application of digit data index, establishing index needs a long time, B+ tree was applied to the index. The storage model was established based on B+ tree, then B+ tree node was stored in the storage medium with the help of the storage bitmap. Through the index storage, the data can be read according to the path when B+ tree is used. The time of building index is thus saved, and the stability of B+ tree is improved. The results of experiment show the theory of B+ tree can be applied to digit books data and indexing speed is greatly improved in accessing to key information.

Key words: computer application technology, data storage, efficiency index, B+ tree, bit map

CLC Number: 

  • TP311