B-tree
(Redirected from B-Trees)
General information
Abstract data structure: Sorted sequence
Implementation Invariant:
- There is a number [math]M\in\mathbb{N}[/math], [math]M\gt 1[/math], which is specific for the B-tree object and is constant throughout the life time of the B-tree object. This value [math]M[/math] is called the order of the B-tree.
- A B-tree of order [math]M[/math] is a multi-way search tree with [math]2M-1[/math] slots for keys and, consequently, [math]2M[/math] slots for children pointers, in each node.
- The slots for keys are denoted keys[math][1],\ldots,[/math]keys[math][2M\!-\!1][/math].
- The slots for children are denoted children[math][0],\ldots,[/math]children[math][2M-1][/math].
- The attribute [math]n[/math] of a node stores the number of filled key slots in this node.
- In each tree node except for the root, it is [math]n\geq M-1[/math]; for the root, it is [math]n\geq 1[/math].
- The filled key slots are the ones at positions [math]1,\ldots,n[/math]; the filled children slots are the ones at positions [math]0,\ldots,n[/math] (except for leaves, of course, where no child slot is filled at all).
- The keys appear in ascending order in a B-tree node, that is, keys[math][i]\leq[/math] keys[math][i\!+\!1][/math] for all [math]i\in\{1,\ldots,n-1\}[/math].
- The children pointers appear in the order as used in the definition of multi-way search trees. In other words, for [math]R[/math] the range of the considered node and for [math]i\in\{0,\ldots,n\}[/math], the range of the node to which children points is
- [math]R\cap\{K\in\mathcal{K}\,|\,K\leq[/math] keys[math][1]\,\}[/math] for [math]i=0[/math];
- [math]R\cap\{K\in\mathcal{K}\,|\,[/math] keys[math][i\!-\!1]\leq K\leq[/math] keys[math][i]\,\}[/math] for [math]i\in\{1,\ldots,n-1\}[/math];
- [math]R\cap\{K\in\mathcal{K}\,|\,K\geq[/math] keys[math][n]\,\}[/math] for [math]i=n[/math].
- All leaves of a B-tree are on the same height level.
Depth of a B-tree
Statement: The height of a B-tree of order [math]M[/math] with [math]N[/math] currently stored keys is [math]\lceil\log_M(N/(2\cdot(M-1))) \rceil+1\in\Theta(\log N)[/math] in the worst case.
Proof: It suffices to show that the minimum total number of keys on height level [math]i\gt 0[/math] is [math]2\cdot M^{i-1}\cdot(M-1)[/math]. We apply an induction on [math]i[/math].
- Induction basis: Since the root contains at least one key, there are at least two tree nodes on height level [math]i=1[/math], each containing at least [math]M-1[/math] keys.
- Induction step: As all leaves are on the same height level, the minimum number of tree nodes on level [math]i[/math] is [math]M[/math] times the minimum number of tree nodes on level [math]i-1[/math]. Therefore, the minimum number of keys on height level [math]i[/math] is [math]M[/math] times the minimum number of keys on height level [math]i-1[/math].