Browse Teach Curate

B-Tree

A B-tree is a balanced, high-fanout search tree whose nodes are disk pages, keeping millions of sorted keys reachable in three or four page reads; leaves are chained so range scans are sequential. Its sorted order is why B-tree indexes serve equality, ranges, prefix matches, and ORDER BY, but not arbitrary predicates.

jeremy Video

B Trees and B+ Tree Implementation using Multi-Level Indexing in Disk-Backed Databases

B-trees and B+-trees are height-balanced m-way search trees (generalizing binary search trees to more than two children per node and more than one key per node) designed for efficient disk-based mult…