Insertion index records for new data tuples is similar to insertion in a B-tree in that new index records are added to the leaves, nodes that overflow are split, and splits propagate up the tree.

• 为新元组插入索引记录的方式与向B树的插入方式大致相同，新的索引记录加入到叶子中，如果节点满了则需要分裂，而分裂则会使树增殖。