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

Taught in

References