| 摘要: |
| 在对比传统的B树和B+树的定义和操作算法的基础上,定义了一种新的B+树:RFN-B+树,以获得更高的空间利用率和可用性.首先比较和分析了RFN-B+树与传统B+树的空间效率,然后讨论了RFN-B+树索引文件的有效性以及支持这种有效性的全链接指针结构和两个备用模块:基于虚拟根结点的随机检索算法和重构结点的算法. |
| 关键词: B+树,索引,有效性,算法. |
| DOI： |
| 分类号: |
| 基金项目: |
|
| RFN-B+-Tree Index File and Its Availability |
|
YAO Qing-da,YANG Gui-zhen,ZHANG Jun-xin
|
| Abstract: |
| Based on the comparison of the conventional definitions of B-tree and B+-tree, and their manipulating algorithms, a new definition of B+-tree: RFN-B+-tree is presented in order to achieve higher space efficiency and higher availability. Its space efficiency compared with conventional B+-tree is analyzed firstly. Then the availability of RFN-B+-tree index file in terms of its full-link pointer structure together with two modules that support this availability: random access algorithm based on virtual root node, and node restructuring algorithm are discussed. |
| Key words: B+-tree, index, availability, algorithm. |
