Definitions for "B*-tree"
Keywords:  nonroot, reiser, hfs, node, tree
(1) A method of organizing information into a collection of nodes. The nodes are arranged in a way that allows efficient access to the stored information. (2) A data structure used by the Dictionary Manager to organize dictionary index entries for fast searching.
A tree in which only the leaf nodes contain data as well as keys. All other nodes contain only keys. See element, key, leaf, node, tree.
A tree in which only the leaves contain whole elements. All other nodes contain keys.