 B+ tree

A balanced search tree used for database indexes. Records occur at the leaves; internal nodes direct searches using separator keys. A B+ tree with maximum fan-out $f$ has at most $f$ children per internal node.