| 全链接模块化B*树算法设计 |
| |
| 引用本文： | 袁向阳,尹建,殷建平. 全链接模块化B*树算法设计[J]. 计算机应用, 2005, 25(3): 617-619. DOI: 10.3724/SP.J.1087.2005.0617 |
| |
| 作者姓名： | 袁向阳 尹建 殷建平 |
| |
| 作者单位： | 西北核技术研究所,情报资料室,陕西,西安,710024;国防科学技术大学,计算机学院,湖南,长沙,410073 |
| |
| 摘 要： | 针对自行设计的全链接模块化B*树(FLPM B*树),充分利用FLPM B*树的模块化结构等特点,设计出模块插入算法、重构算法和分割算法等,这些算法实现了FLPM B*树的操作功能,对于提高系统的性能也至关重要。
|
| 关 键 词： | B*树 算法 全文检索 |
| 文章编号： | 1001-9081(2005)03-0617-03 |
Algorithm design for full link pointer module B* tree |
| |
| YUAN Xiang-yang,YIN Jian,YIN Jian-ping. Algorithm design for full link pointer module B* tree[J]. Journal of Computer Applications, 2005, 25(3): 617-619. DOI: 10.3724/SP.J.1087.2005.0617 |
| |
| Authors: | YUAN Xiang-yang YIN Jian YIN Jian-ping |
| |
| Affiliation: | 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 |
| |
| 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. |
| |
| Keywords: | B* tree algorithm full text retrieval |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
