B-tree

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Noun[edit]

English 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 notes[edit]

Related terms[edit]

Translations[edit]

Anagrams[edit]