Most often used in
databases and
file systems, B-trees are
tree structures (a type of
data structure) that are optimized for
situations when all or part of the tree must be maintained on a secondary
storage device such as an
optical disk or
tape. A
B-tree is designed to minimize the number of disk accesses.
See also tree structure.