Contents

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 accesses required for locating the correct record block.

Usage notesEdit

Related termsEdit

TranslationsEdit

AnagramsEdit