b-plus-tree · shipping · also B+Tree, B plus tree

B+ tree

A B+ tree is a balanced ordered search tree whose application records or record references reside at the leaves, with internal nodes routing searches.

Related Observatory article: B+ tree on hesela.com

Leaves share a common depth; sibling links commonly support ordered traversal. Internal separators guide searches and need not be complete copies of current leaf keys. This leaf-oriented layout is a variant within the broader B-tree family, not an exact synonym for every implementation called B-tree. [1]

A page-layout label alone does not specify transaction visibility or crash recovery; those are additional implementation contracts. PostgreSQL's documented B-Tree structure, for example, separates leaf row references from internal downlinks. [2]

Relations

related
B-tree, B-epsilon tree, LMDB

Citations

  1. Carnegie Mellon 15-445/645, Fall 2024: Indexes & Filters I, sections 2 and 4.5 (accessed 2026-10-22)
  2. PostgreSQL 18: B-Tree indexes, structure and page splits (accessed 2026-10-22)

Further reading

  1. Hesela: B-epsilon trees, B-tree foundations and observed page placement (accessed 2026-10-22)

JSON: /data/terms/b-plus-tree.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. B+ tree. Hesela. 2026-10-22. https://hesela.dev/terms/b-plus-tree/