| 一个2—3树的top—down式插入算法 |
| |
| 引用本文： | 张亚南,徐洁磐.一个2—3树的top—down式插入算法[J].计算机学报,1992,15(7):514-521. |
| |
| 作者姓名： | 张亚南 徐洁磐 |
| |
| 作者单位： | 南京航空学院计算机系，南京大学计算机科学系 南京 210016，南京 210008 |
| |
| 摘 要： | 本文给出一个新的2-3树插入算法ZZ.算法ZZ以top-down方式实现关键字的插入及所需的分裂.与算法Z相比,本算法的时间因子有所改进.然后,本文给出算法Z的两个反例,并对算法ZZ的正确性加以证明.
|
| 关 键 词： | 2－3树 算法 插入 |
A TOP-DOWN INSERTION ALGORITHM OF 2-3 TREES |
| |
| Zhang Yanan.A TOP-DOWN INSERTION ALGORITHM OF 2-3 TREES[J].Chinese Journal of Computers,1992,15(7):514-521. |
| |
| Authors: | Zhang Yanan |
| |
| Abstract: | This paper presents a new 2-3 tree insertion algorithm ZZ. The insertion and related splits in algorithm ZZ are achieved in a top-down way. Compared with algorithm Z. algorithm ZZ has a coefficient reduction in time complexity. Two contradictory cases of algorithm Z are given and the correctness of algorithm ZZ is shown in this paper. |
| |
| Keywords: | B-cree 2-3 trees algorithm top-down insertion index database |
| 本文献已被 CNKI 维普 等数据库收录！ |
