b-tree

Computing Dictionary

B-tree definition

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].
[Example algorithm?]
(2000-01-10)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: b-toolkit
Next Definition: b-w
Words Near: B-tree
More from Thesaurus.com
Synonyms and Antonyms for B-tree
More from Reference.com
Search for articles containing B-tree
More from Dictionary.com Translator
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature