← recall

B-tree term

balanced sorted tree — default DB index structure

Optimized for read-heavy workloads. Logarithmic point lookups, fast range scans. Pages updated in place, which means writes can fragment.

topics: databases, internals, data-structures

references:

• Use the Index, Luke! — Anatomy of an index
• DDIA Ch. 3 — B-Trees