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
- 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.
- 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.
- height — The number of edges on the longest path from a tree's root down to a leaf; a node's depth is its number of edges from the root.
- consumer group — A set of consumers sharing one group ID that divide a topic's partitions between them so each partition is read by only one member at a time.
- request-reply — An interaction where the caller sends a request and waits for a single reply before continuing.
- message queue — A store that holds messages from producers until consumers are ready to process them, decoupling the rate of arrival from the rate of work.
Taught in
- B-Trees: The Structure Behind Every Database Index — Algorithms & Data Structures for Working Engineers
- When Kafka Is The Wrong Tool — Apache Kafka & Event Streaming