摘要
本文给出一个新的2-3树插入算法ZZ.算法ZZ以top-down方式实现关键字的插入及所需的分裂.与算法Z相比,本算法的时间因子有所改进.然后,本文给出算法Z的两个反例,并对算法ZZ的正确性加以证明.
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.
出处
《计算机学报》
EI
CSCD
北大核心
1992年第7期514-521,共8页
Chinese Journal of Computers
关键词
2-3树
算法
插入
B-cree, 2-3 trees, algorithm, top-down, insertion, index, database.
