| 释义 |
B-tree, n. Computing.|ˈbiː triː|
[f. the letter B, repr. balanced or binary, + tree n.]
A tree in which all the terminal nodes are the same distance from the root and all the non-terminal nodes have between n and 2 n subtrees or pointers, where n is an integer greater than or equal to one. (See also quot. 1968.)
1968D. E. Knuth Art of Computer Programming I. ii. 315 Define a ‘b-tree’ as a tree in which each node has exactly zero or two sons. 1972Acta Informatica I. iii. 174 The pages themselves are the nodes of a rather specialized tree, a so-called B-tree. 1976N. Wirth Algorithms plus Data Struct. iv. 250 Another positive quality of the B-tree organization is its suitability and economy in the case of purely sequential updating of the entire data bank. Every page is fetched into primary store exactly once. 1985P. Laurie Databases ii. 54 Advanced database managers now use a system called a ‘B-tree’ index. |