A B*-tree is a tree data structure, a variety of B-tree that is efficient for searching at the cost of a more expensive insertion. The term is not in general use today; most people use "B-tree" generically to refer to all the variations and refinements of the basic data structure.

See also

• B-tree