| 摘要: |
| 本文提出一种新的多叉树——紧凑(a,b)树。它通过一种整编操作对树中内结点的儿子和孙子个数之间建立制约关系。在元素个数n→∞,树结点的最大儿子个数b>>4时,使树在最坏情况下的高度和空间利用率都接近最优。它的查找运算比B类树都快,它的更新运算(插入和删除)在折算意义下,即在以整个运算序列的最坏时间为代价下,与B类树的性能相同。 |
| 关键词: |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金 |
|
| A COMPACT (a, b) TREE |
|
Zhang Xi,Li Wanxue
|
| Abstract: |
| In this paper, a new type of multiway height balance trees-Compact (a, b) tree is presented. In such a tree, the nearly optimal storage utilization and nearly optimal height are guaranted by intruducing a constrain between number of children and gradchildren with a Reorganize operation. It s seach opertion is quicker than the B*-trees and B-trees. It s update operations (insert, delete) are the same performance as B-trees on the amortized computational complexity. |
| Key words: |
