B-tree
Definition from Wiktionary, the free dictionary
Contents |
English[edit]
Noun[edit]
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[edit]
- (indexed data structure): binary tree
Related terms[edit]
Translations[edit]
indexed data structure suitable for storage of a large number of items in a balanced fashion
|
