计算机应用 ›› 2005, Vol. 25 ›› Issue (03): 617-619.DOI: 10.3724/SP.J.1087.2005.0617

• 软件技术 • 上一篇    下一篇

全链接模块化B*树算法设计

袁向阳1，尹建1，殷建平2   

  1. 1.西北核技术研究所情报资料室； 2.国防科学技术大学计算机学院
  • 发布日期:2005-03-01 出版日期:2005-03-01

Algorithm design for full link pointer module B* tree

YUAN Xiang-yang1,YIN Jian1,YIN Jian-ping2   

  1. 1. Department of Information & Documents, Northwest Institute of Nuclear Technology, Xi’an Shaanxi 710024, China; 2. School of Computer Science, National University of Defense Technology, Changsha Hunan 410073, China
  • Online:2005-03-01 Published:2005-03-01

PDF

摘要：

针对自行设计的全链接模块化B*树(FLPM B*树),充分利用FLPM B*树的模块化结构等特点,设计出模块插入算法、重构算法和分割算法等,这些算法实现了FLPM B*树的操作功能,对于提高系统的性能也至关重要。

关键词:  B*树, 算法, 全文检索

Abstract:

To improve the storage efficiency of syntax, FLPM-B* tree, a full link pointer module B* tree, was designed. According to its structure characteristics, some algorithms such as module insert algorithm, reconstruction algorithm, and partition algorithm, were put forward. These algorithms make the FLPM-B* tree manipulated and efficient.

Key words: B* tree, algorithm, full text retrieval

中图分类号: 

版权所有 © 2021 四川计算机应用杂志社有限公司
蜀ICP备 05010208 号-3　新出网证(川)字026号
技术支持：北京玛格泰克科技发展有限公司
访问总数：
今日访问：