B-tree

(redirected from B-trees)
Also found in: 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 ?
As we have already seen, the precision of B-trees and hashed tables are similar and exhibit similar maintenance costs despite having very different clustering characteristics.
Coyne said that customers appreciate the many product features, including built-in B-trees, true-compiled FlashBASIC(R) language, Access Query Language (AQL(TM)) for speed and ease-of-use, unlimited views of information, business rule support, triggers, OSFI/ODBC and SQL connectivity.
Hash organised tables are, in short, for static data, while B-trees might be used more appropriately for both systems as they provide good concurrency and flexible queries.
Additional features include built-in B-trees, true-compiled FlashBASIC(R) language, Access Query Language (AQL(TM)) for speed and ease-of-use, unlimited views of information, business rule support, triggers, OSFI/ODBC and SQL connectivity.
Chapter 9 on balanced trees has expanded coverage of B-trees and a new section on Java 6 SkipList.
B-trees, on the other hand, can be appropriate to both applications offering both good concurrency and flexible queries; but they must be used with care on heavily updated tables of significant size, since they can become rapidly disk I0 bound and can cause excessive database checkpoint activity.
Additional features include built-in B-trees, true-compiled FlashBASIC(TM) language, Access Query Language (AQL(TM)) for speed and ease-of-use, unlimited views of information, business rule support, triggers, OSFI/ODBC and SQL connectivity.
Mac Analysis: Many new capabilities, such as processing B-Trees attributes for metadata, decrypting Sparse Images or Sparse Bundles, PLIST support, SQLite support and more.
Additional features include built-in B-trees, true-compiled FlashBASIC(TM) language, Access Query Language (AQL)(TM) with speed and ease-of-use, unlimited views of information, business rule support, triggers, ODBC and SQL connectivity.
Additional features include built-in B-trees, true-compiled FlashBASIC(TM) language, Access Query Language (AQL(R)) with speed and ease-of-use, unlimited views of information, business rule support, triggers, ODBC and SQL connectivity.
Additional features include built-in B-trees, true-compiled FlashBASIC language, Access Query Language (AQL) with speed and ease-of-use, unlimited views of information, business rule support, triggers, ODBC and SQL connectivity.
Additional features include built-in B-trees, true-compiled FlashBASIC(TM) language, Access Query Language (AQL(TM)) with speed and ease-of-use, unlimited views of information, business rule support, triggers, ODBC and SQL connectivity.