Architect's Guide
Mar 25, 2024 · Fundamentals
B‑Tree, B+Tree, B*Tree and R‑Tree: Structures, Operations, and Applications in External Memory Indexing
This article provides a comprehensive overview of B‑tree, B+‑tree, B*‑tree and R‑tree data structures, explaining their definitions, node layouts, height analysis, insertion and deletion algorithms with examples, and their roles in external‑memory indexing for databases and file systems.
B-treeB-treeDatabase Indexing
0 likes · 46 min read