B-tree

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Noun[edit]

Wikipedia has an article on:

Wikipedia

B-tree (plural B-trees)

  1. (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.

Antonyms[edit]

Related terms[edit]

Translations[edit]

Anagrams[edit]