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

Translations

indexed data structure suitable for storage of a large number of items in a balanced fashion

Finnish: B-puu
French: arbre B (fr) m
Icelandic: jafnmælistré n, jafnmælishrísla f

Anagrams

Ebert, beret

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.