Skip to content
DKKB

B-tree

Section titled “B-tree”

A B-tree is a balanced ordered tree that stores many keys per node and keeps all leaves at the same depth.

Its high branching factor reduces the number of storage pages that a lookup must visit. This makes B-tree variants common for database indexes.

A B-tree is not the only index structure. Hash, inverted, spatial, and other indexes fit different access patterns.

Used in DKKB

Indexes and query planningUse indexes to turn scans into targeted lookups, and understand how the query planner decides whether an index helps.
Indexes and query planningUse indexes to turn scans into targeted lookups, and understand how the query planner decides whether an index helps.