B*-tree

B-tree in which nodes are kept 2/3 full by redistributing keys to fill two child nodes, then splitting them into three nodes