B-tree


Also found in: Acronyms, Wikipedia.

B-tree

[′bē ‚trē]
(computer science)

B-tree

(algorithm)
A multi-way balanced tree.

The "B" in B-tree has never been officially defined. It could stand for "balanced" or "Bayer", after one of the original designers of the algorithms and structure. A B-tree is _not_ (necessarily?) a "binary tree".

A B+-tree (as used by IBM's VSAM) is a B-tree where the leaves are also linked sequentially, thus allowing both fast random access and sequential access to data.

[Knuth's Art of Computer Programming].

B-tree

(Balanced-tree) A technique for organizing indexes. In order to keep access time to a minimum, B-tree stores the data keys in a balanced hierarchy that continually realigns itself as items are inserted and deleted. Thus, all nodes always have a similar number of keys.

B+tree is a version of B-tree that maintains a hierarchy of indexes while also linking the data sequentially, providing fast direct access and fast sequential access. The IBM mainframe VSAM access method uses the B-tree method. See Btrfs and VSAM.
References in periodicals archive ?
Companies that use B-Tree technology automatically fulfill requirements imposed by standards, such as ISO-9001.
Joseph comes to B-Tree with extensive embedded industry experience.
The motivation of embedding the B-tree in the HB-tree distinguishes from the idea of adopting the B+-tree for the MB-tree.
The structural features of common indexes, such as the B-tree or hashed table enforce highly precise localisation to achieve the best possible search efficiency.
For "range/point/-" queries, the ST-tree must be combined with a B-tree as its time subindex.
The tree on W2 and the b-tree on W3, though they do not share their "coexistence properties" (properties having to do with coexisting or not coexisting with some other tree and all the properties that come along with these) and though they cannot, without begging the question, be assumed to share their "identity properties" (properties like being identical to t), do share all their other properties.
There is a pointer to connect a B-tree, which stores the temporal aggregation data about each R-tree's node [15][16].
In looking to bring the data warehouse into a harmonious relationship with the operational system, these indexes provide a compelling alternative to conventional B-tree indexes, hash indexes and bit maps.
Examples for such one-dimensional access methods (also called single key structures, although that term is somewhat misleading) include the B-tree [Bayer and McCreight 1972] and extendible hashing [Fagin et al.
Virtually all modern-day file search techniques use some sort of B-Tree structure.
Optimized System Performance: Significant enhancements have been made to the cache manager, B-tree, and table page structure, resulting in performance improvements of up to 15 percent for insert, select, and delete functions and 30 percent for update functions.
For large tables with dynamic data, such as a fact table, B-Tree indexes and hashed clusters are unsuitable.