B | 3 | Dictionary of Computer Science, Engineering and Technology

ABSTRACT

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