“B-tree”的概念、定义、翻译、参考文献-科学参考

B-tree

Computer

1. (balanced multiway search tree) of degree n (≥2). A multiway search tree of degree n in which the root node has degree ≥2, every nonterminal node other than the root has degree k, where
$n / 2 \leq k \leq n$
and every leaf node occurs at the same level. Originally defined by R. Beyer and E. McCreight, the data structure provides an efficient dynamic retrieval device.
An extension to a B-tree is a B+ tree, which is used as a primary index to an indexed file. It comprises two parts: a sequential index containing an entry for every record in the file, and a B-tree acting as a multilevel index to the sequential index entries. B+ trees are used in VSAM.
2. A binary tree with no nodes of degree one.

单词	B-tree
释义	B-tree Computer 1. (balanced multiway search tree) of degree n (≥2). A multiway search tree of degree n in which the root node has degree ≥2, every nonterminal node other than the root has degree k, where $n / 2 \leq k \leq n$ and every leaf node occurs at the same level. Originally defined by R. Beyer and E. McCreight, the data structure provides an efficient dynamic retrieval device. An extension to a B-tree is a B+ tree, which is used as a primary index to an indexed file. It comprises two parts: a sequential index containing an entry for every record in the file, and a B-tree acting as a multilevel index to the sequential index entries. B+ trees are used in VSAM. 2. A binary tree with no nodes of degree one.
随便看	terminating decimal termination termination codon termination, proof of termination shock terminator terminus ad quem term language term loan term model term narrowing term premium term rewriting system terms of trade term structure of interest rates tern ternary ternary compound ternary diagram ternary logic ternary relation ternary representation ternary selector gate ternary system ternary threshold gate