B-tree

== English == === Noun === B-tree (plural B-trees) (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 ==== Not to be confused with binary tree. ==== Related terms ==== B+ tree 2-3 tree 2-3-4 tree ==== Translations ==== === Anagrams === Ebert, beret, Berte, béret