B-treen.

/ˈbiː triː/

Etymology: < the letter B , representing balanced or binary , + tree n.

Computing.

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 2n subtrees or pointers, where n is an integer greater than or equal to one. (See also quot. 1968.)

ΘΚΠ

society > computing and information technology > data > [noun] > structure > tree

binary tree1960

B-tree1968

1968 D. 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.

1972 Acta Informatica I. iii. 174 The pages themselves are the nodes of a rather specialized tree, a so-called B-tree.

1976 N. 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.

1985 P. Laurie Databases ii. 54 Advanced database managers now use a system called a ‘B-tree’ index.

This entry has not yet been fully updated (first published 1993; most recently modified version published online March 2021).

单词	b-tree
释义	B-treen. /ˈbiː triː/ Etymology: < the letter B , representing balanced or binary , + tree n. Computing. 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 2n subtrees or pointers, where n is an integer greater than or equal to one. (See also quot. 1968.) ΘΚΠ society > computing and information technology > data > [noun] > structure > tree binary tree1960 B-tree1968 1968 D. 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. 1972 Acta Informatica I. iii. 174 The pages themselves are the nodes of a rather specialized tree, a so-called B-tree. 1976 N. 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. 1985 P. Laurie Databases ii. 54 Advanced database managers now use a system called a ‘B-tree’ index. This entry has not yet been fully updated (first published 1993; most recently modified version published online March 2021). < n.1968
随便看	child-queller child-rearing child-ridden child-rider child-rites child-saint child-simple child-size child-sized child-smile child-stealer child-woman child-word child-young childage childbearer childbearing childbearing hips childbearings childbed childbed fever childbeds childbereft childbirth childbirths