(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.
An indexing structure used by the ORACLE Server to create and store indexes. The structure is named after the indexing algorithm used.
A B*-tree is a tree data structure, a variety of B-tree used in the HFS and Reiser4 file systems, which requires nonroot nodes to be at least 2/3 full instead of 1/2. To maintain this, instead of immediately splitting up a node when it gets full, its keys are shared with the node next to it. When both are full, then the two of them are split into three.