🇬🇧 en fr 🇫🇷

B-tree noun

  • (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.
 arbre B
B*-tree
arbre B*
B+-tree
arbre B+
K-D-B-tree
arbre k-d-B
Wiktionary Links