B-tree
English
Noun
Wikipedia B-tree (plural B-trees)
- (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
- (indexed data structure): binary tree
Related terms
- B+-tree
Translations
indexed data structure suitable for storage of a large number of items in a balanced fashion