Noun
English Wikipedia has an article on:B-treeWikipedia
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.
A B-tree is kept balanced by requiring that all leaf nodes be at the same depth. Source: Internet
A B-tree can handle an arbitrary number of insertions and deletions. Source: Internet
Deletion There are two popular strategies for deletion from a B-tree. Source: Internet
For example, in a 2-3 B-tree (often simply referred to as a 2-3 tree), each internal node may have only 2 or 3 child nodes. Source: Internet
Advantages of B-tree usage for databases The B-tree uses all of the ideas described above. Source: Internet
Analogy to B-trees of order 4 The same red–black tree as in the example above, seen as a B-tree. Source: Internet