B-tree indexing
The self-balancing multi-way search tree that keeps every lookup, insertion, and deletion within a guaranteed, small number of disk accesses, no matter how much the data grows.
10 min readUpdated 2026-09-04dbmsindexingb-tree
The self-balancing multi-way search tree that keeps every lookup, insertion, and deletion within a guaranteed, small number of disk accesses, no matter how much the data grows.