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

Index Storage Based on B+ Tree

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

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.