balanced-tree

balanced-tree

[′bal·ənst ′trē]
(computer science)
A system of indexes that keeps track of stored data, and in which data keys are stored in a hierarchy that is continually modified in order to minimize access times. Abbreviated B-tree.