ConceptB+树索引 / B-Tree
B+ Tree
A balanced multi-way search tree data structure widely used for indexes in relational databases. It performs excellently in point lookup scenarios and is well suited to OLTP workloads.
Timeline (last 90 days)
Sep 11
In a B+ tree, all actual data is stored in leaf nodes, internal nodes store only routing keys, and leaf nodes are linked together through pointers into an ordered linked list, supporting efficient range queries.
Unverified50%