0%

b-tree

B b

Transcription

    • US Pronunciation
    • US IPA
    • US Pronunciation
    • US IPA

Definitions of b-tree word

  • noun Technical meaning of 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. 1
  • noun b-tree (computing) An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk hits required for locating the correct record block. 0
See all 2 definitions of b-tree

Information block about the term

Parts of speech for B-tree

noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation
Full grammatical hierarchy of B-tree

See also

Matching words

Was this page helpful?
Yes No
Thank you for your feedback! Tell your friends about this page
Tell us why?