B-tree: insert and rearrange

General Information

Algorithmic problem: Text here

Type of algorithm: Text

Auxiliary data:

1. Three pointers [math]\displaystyle{ p, p_1, p_2 }[/math] or type "pointer to B-tree node".
2. A current key [math]\displaystyle{ K' \in K }[/math]

Abstract View

Invariant: Before and after each iteration, [math]\displaystyle{ p }[/math] points to a node [math]\displaystyle{ N }[/math] such that the following holds:

1. In the case [math]\displaystyle{ p.n \lt 2M }[/math], all implementation invariants of B-trees are maintained if the following [math]\displaystyle{ K' }[/math] can be inserted at some position in [math]\displaystyle{ N }[/math] such that after insertion.
2. In the case [math]\displaystyle{ p.n = 2M }[/math], imagine that we could extend [math]\displaystyle{ p }[/math].keys by one more slot (and, consequently, extend .successors by one more slot). Then [math]\displaystyle{ K' }[/math] can be inserted in [math]\displaystyle{ N }[/math] at a position such that - except for the statement about the size of [math]\displaystyle{ N }[/math] - all implementation invariants of B-trees are again maintained after insertion.

Variant: The height level of the node to which [math]\displaystyle{ p }[/math] points is decreased by [math]\displaystyle{ 1 }[/math].

Break condition: [math]\displaystyle{ p.N \lt 2M }[/math] or (that is, inclusive-or) [math]\displaystyle{ p }[/math] points to the root.

Induction Basis

Abstract view:

1. [math]\displaystyle{ p }[/math] is set to the input pointer.
2. [math]\displaystyle{ p_1 }[/math] and [math]\displaystyle{ p_2 }[/math] are void initially.

Implementation: Obvious.

Proof: The requirement on the input pointer immediately implies the invariants.

Induction Step

Abstract view:

1. If the node is not full, the key can be inserted, and we are done.
   1. If the new key is larger than all keys stored in the node, it can be appended.
   2. Otherwise, is must override one specific slot. For that, first the contents of this slot and of each slot to its right must be moved one position further right (the corresponding values and successor pointers have to be moved as well). Then the new (key,value)-pair may be safely inserted.
2. On the other hand, if the node is indeed full, the key cannot be inserted. In this case:
   1. The current node [math]\displaystyle{ N }[/math] will be split into two nodes, [math]\displaystyle{ N_1 }[/math] and [math]\displaystyle{ N_2 }[/math].
   2. [math]\displaystyle{ N_1 }[/math] will contain all keys strictly less than the median of { [math]\displaystyle{ p }[/math].keys[math]\displaystyle{ [1], ... , p. }[/math]keys[math]\displaystyle{ [p.n], K' }[/math] }
   3. Analogously, [math]\displaystyle{ N_2 }[/math] will contain all keys strictly greater than the median of { [math]\displaystyle{ p }[/math].keys[math]\displaystyle{ [1], ... , p }[/math].keys [math]\displaystyle{ [p.n], K' }[/math] }.
   4. Next we try to
   5. If [math]\displaystyle{ K' }[/math] is that median itself, nothing is to be done on the current node.
   6. Otherwise, the median of [math]\displaystyle{ \{p }[/math].keys[math]\displaystyle{ [1], \dots , p }[/math].keys [math]\displaystyle{ [p.n], K'\} }[/math] is in one of the slots of the node. This slot is overridden (by moving the contents of each slot to the right one position further left). The previous contents of this slot is the new [math]\displaystyle{ K' }[/math] . If the current node is the root, which we next try to insert in the predecessor of

Implementation:

1. If [math]\displaystyle{ p.n = 2M }[/math]
   1. If [math]\displaystyle{ p.keys[M] \lt K' \lt p.keys[M + 1] }[/math], break the iteration and continue the loop.
   2. Otherwise: [math]\displaystyle{ x:= M }[/math] if [math]\displaystyle{ K' \lt p.keys[M] }[/math], and [math]\displaystyle{ x:= M+1 }[/math] otherwise.
   3. Set [math]\displaystyle{ K'' := p.keys[x] }[/math].
   4. For [math]\displaystyle{ j \in \{x+1, \dots, p.n \} }[/math] (in this order), set [math]\displaystyle{ p.keys [j-1]:= p.keys[j] }[/math] and [math]\displaystyle{ p. successor[j-1]:= p.successors[j] }[/math].
2. If [math]\displaystyle{ p.keys[p.n] \lt K' }[/math], insert the new (key, value)-pair at position [math]\displaystyle{ p.keys[p.n+1 }[/math]
3. Otherwise:
   1. Let [math]\displaystyle{ i \in \{ 1, \dots , p.n \} }[/math] be minimal subject to [math]\displaystyle{ K' \lt p.keys[i] }[/math]
   2. For [math]\displaystyle{ j \in \{ p.n, \dots , i \} }[/math] (in this order), set [math]\displaystyle{ p.keys[j+1]:= p.keys[j]. }[/math]
4. If [math]\displaystyle{ p.n \lt 2M }[/math], set [math]\displaystyle{ p.n:= p.n+1 }[/math] and terminate the algorithm.
5. Otherwise, set [math]\displaystyle{ K':= K'' }[/math].

Complexity

Statement: The asymptotic complexity is in [math]\displaystyle{ \Theta(\log n) }[/math] in the worst case.

Proof: Follows immediately from the fact that the height of B-tree with n nodes is in [math]\displaystyle{ \Theta(\log n) }[/math] (cf. the remark clause of the B-Trees page).