B-Tree Properties‡
- Properties
- maximum branching factor of M
- the root has between 2 and M children or at most L keys
- other internal nodes have between ?M/2? and M children
- internal nodes contain only search keys (no data)
- smallest datum between search keys x and y equals x
- each (non-root) leaf contains between ?L/2? and L keys
- all leaves are at the same depth
- Result
- tree is ?(log n) deep
- all operations run in ?(log n) time
- operations pull in about M or L items at a time
‡These are technically B+-Trees