B-tree

EnglishEdit

NounEdit

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.

AntonymsEdit

Related termsEdit

  • B+-tree

TranslationsEdit

AnagramsEdit

Last modified on 8 October 2013, at 21:29