Linked from

The 8 pages that link to B-tree, each with the reason it gives.

• Data structureBroader topic: B-trees reduce disk accesses in database and filesystem indexes.

• Database indexRelated: B-trees organize many database indexes into searchable pages suited to storage devices.

• Hash tableCompared with: Its ordered access and block-friendly structure suit workloads where hashing is insufficient.

• Binary search treeCompared with: Its high branching factor reduces disk accesses in external storage.

• Binary treeCompared with: B-trees trade binary branching for shallow height in storage systems.

• Red–black treeCompared with: B-trees reduce storage-access depth and suit disks better than pointer-based binary trees.

• MySQLRelated: InnoDB indexes commonly use B-tree structures to speed up searches and sorting.

• HFS PlusNarrower topic: HFS Plus uses B-trees to index catalogs, extents, and attributes.