Table of contents
Introduce B-tree
Satisfying the above two strategies is a B-tree:
- In the m-fork search tree, it is stipulated that any node except the root node must have at least ⌈ m / 2 ⌉ \lceil m/2 \rceil⌈ m /2 ⌉
bifurcation, that is, it contains at least⌈ m / 2 ⌉ \lceil m/2 \rceil⌈ m /2 ⌉ - 1 keyword - In an m-ary search tree, it is stipulated that for any node, the heights of all its subtrees must be the same (absolute balance).
B-tree definition and properties
Core characteristics of m-order B-tree
B+tree
B+ tree search
Search from the root:
Search from the pointer (sequential search):
