向B树插入关键字

B树的创建：

B-TREE-CREATE(T)

1  x ← ALLOCATE-NODE()

2  leaf[x] ← TRUE

3  n[x] ← 0

4  DISK-WRITE(x)

5  root[T] ← x

 

B树中节点的分裂：

B-TREE-SPLIT-CHILD(x, i, y)

 1  z ← ALLOCATE-NODE()

 2  leaf[z] ← leaf[y]

 3  n[z] ← t - 1

 4  for j ← 1 to t - 1

 5       do keyj[z] ← keyj+t[y]

 6  if not leaf [y]

 7     then for j ← 1 to t

 8              do cj[z] ← cj+t[y]

 9  n[y] ← t - 1

10  for j ← n[x] + 1 downto i + 1

11       do cj+1[x] ← cj [x]

12  ci+1[x] ← z

13  for j ← n[x] downto i

14       do keyj+1[x] ← keyj[x]

15  keyi[x] ← keyt[y]

16  n[x] ← n[x] + 1

17  DISK-WRITE(y)

18  DISK-WRITE(z)

19  DISK-WRITE(x)

 

B树的插入：

B-TREE-INSERT(T, k)

 1  r ← root[T]

 2  if n[r] = 2t - 1

 3     then s ← ALLOCATE-NODE()

 4         root[T] ← s

 5         leaf[s] ← FALSE

 6         n[s] ← 0

 7         c1[s] ← r

 8         B-TREE-SPLIT-CHILD(s, 1, r)

 9         B-TREE-INSERT-NONFULL(s, k)

10    else B-TREE-INSERT-NONFULL(r, k)

 

B树插入的子过程（根节点不满情况）：

 

B-TREE-INSERT-NONFULL(x, k)

 1  i ← n[x]

 2  if leaf[x]

 3     then while i ≥ 1 and k < keyi[x]

 4            do keyi+1[x] ← keyi[x]

 5                   i ← i - 1

 6             keyi+1[x] ← k

 7             n[x] ← n[x] + 1

 8             DISK-WRITE(x)

 9     else while i ≥ 1 and k < keyi[x]

10             do i ← i - 1

11           i ← i + 1

12           DISK-READ(ci[x])

13           if n[ci[x]] = 2t - 1

14             then B-TREE-SPLIT-CHILD(x, i, ci[x])

15                    if k> keyi[x]

16                      then i ← i + 1

17           B-TREE-INSERT-NONFULL(ci[x], k)