|
|
Definition of B-tree
1. Noun. (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. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of B-tree
Other Resources:
