b-trees

A form of b-tree — 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.

Meanings

b-trees1

noun
  1. pluralplural of b-tree

B-trees2

noun
  1. pluralplural of B-tree
Cite this entry
APA

b-trees. (n.d.). In WatkinsX Dictionary. Retrieved November 3, 2026, from https://dictionary.watkinsx.com/word/b-trees

MLA

“b-trees.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/b-trees. Accessed November 3, 2026.

Chicago

WatkinsX Dictionary, s.v. “b-trees,” accessed November 3, 2026, https://dictionary.watkinsx.com/word/b-trees.

Source: b-trees on Wiktionary, CC BY-SA 4.0.