操作 增删改查

查找

查找以典型的方式进行，类似于二叉查找树。起始于根节点，自顶向下遍历树，选择其分离值在要查找值的任意一边的子指针。在节点内部典型的使用是二分查找来确定这个位置。

插入

Perform a search to determine what bucket the new record should go into.

If the bucket is not full(a most b - 1 entries after the insertion，b 是节点中的元素个数，一般是页的整数倍),add tht record.

Otherwise,before inserting the new record

split the bucket.
original node has 「(L+1)/2」items
new node has 「(L+1)/2」items
Move 「(L+1)/2」-th key to the parent,and insert the new node to the parent.
Repeat until a parent is found that need not split.
If the root splits,treat it as if it has an empty parent ans split as outline above.

B-trees grow as the root and not at the leaves.

删除

和插入类似，只不过是自下而上的合并操作。