fan-out

The number of children each node of a tree can have.

In more detail

A binary tree has fan-out two, so its height is about log2 n. A B-tree node with a fan-out of a thousand shrinks the height to about log1000 n: three levels cover a billion rows. High fan-out is the reason databases use B-trees rather than binary trees.

Example

Every Kafka consumer group reads the whole topic independently.

Related terms

Taught in

References