B-tree
Jump to navigation
Jump to search
English[edit]
Noun[edit]
- (computing) An indexed data structure suitable for storage of a large number of items in a balanced fashion, with very few disk accesses required for locating the correct record block.
Usage notes[edit]
- Not to be confused with binary tree.
Related terms[edit]
Translations[edit]
indexed data structure suitable for storage of a large number of items in a balanced fashion
|