吉林大学学报(理学版)

• 计算机科学 • 上一篇    下一篇

基于B+树的数据索引存储

耿庆田1,2, 狄婧3, 常亮1, 赵宏伟1   

  1. 1. 吉林大学 计算机科学与技术学院, 长春 130012;2. 长春师范大学 计算机科学与技术学院, 长春 130032; 3. 长春师范大学 网络中心, 长春 130032
  • 收稿日期:2013-05-21 出版日期:2013-11-26 发布日期:2013-11-21
  • 通讯作者: 赵宏伟 E-mail:zhaohw@jlu.edu.cn

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

摘要:

针对传统索引算法在数字数据索引应用中存在的索引建立时间开销较大问题, 提出一种将B+树理论和算法应用于索引的设计方案. 在对B+树索引基础上, 建立了索引存储模型, 结合位图存储方式将B+树节点存储在存储介质上, 实现索引存储. 实验结果表明, 使用B+树, 可按路径读取, 节省了建立索引时间, 同时提高了B+树的稳定性, 在B+树节点存储的情况下访问键值信息, 索引速度得到较大提升.

关键词: 计算机应用技术, 数据存储, 索引效率, B+树, 位图

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

中图分类号: 

  • TP311