minimum degree
The parameter t of a B-tree that sets how full its nodes are: at least t minus one and at most 2t minus one keys, except at the root.
In more detail
Bigger t means wider nodes and a shallower tree: the height is at most about log base t of n. The course computes that with t of 512 a million keys fit in two levels.
Related terms
- B-tree — A balanced search tree whose nodes each hold many sorted keys and have many children, so the tree is very wide and very shallow.
- fan-out — The number of children each node of a tree can have.
Taught in
- B-Trees: The Structure Behind Every Database Index — Algorithms & Data Structures for Working Engineers