Skip to content
Tagged articles

B+ tree

1 articles · Page 1 of 1
Architect's Guide
Architect's Guide
Nov 20, 2026 · Fundamentals

B-Tree, B+ Tree, B* Tree & R-Tree: From Disk-Based Indexing to Spatial Search

This article explains B-tree, B+ tree, and B* tree structures for efficient disk-based indexing, detailing their properties, insertion/deletion algorithms with step-by-step examples, height analysis, and extends to R-trees for multi-dimensional spatial search using minimum bounding rectangles with search, insert, and delete pseudocode.

B* treeB+ treeB-tree
0 likes · 61 min read
B-Tree, B+ Tree, B* Tree & R-Tree: From Disk-Based Indexing to Spatial Search