B-树/B+树的批量插入算法

“Bulk-Insertion”Algorithm for B-Tree/ B+ Tree

本文对传统的B -树 /B +树插入算法进行改进 ,提出了B -树 /B +树的批量插入的算法 ,在理论上估计了该算法的复杂度 ,并进行了比较实验 .实验结果表明 :本算法在对大批量的关键字建立索引时 ,大大提高了B -树 /B +树的插入效率 。

A new algorithm is presented in this paper to improve the performance of “Bulk\|Insertion” of B\|Tree and B+ Tree. Experimental results of the new algorithm are also provided with analysis. The experiments prove that this new algorithm improves the performance greatly when building the index for database or structured texts, at the same time it could also be applied to index updating.