B-tree

In computer science, a B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123). Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. B-trees are a good example of a data structure for external memory. It is commonly used in databases and filesystems.

单词	BTree
释义	BTree 英语百科 B-tree In computer science, a B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children (Comer 1979, p. 123). Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. B-trees are a good example of a data structure for external memory. It is commonly used in databases and filesystems.
随便看	organotypic culture organotypic growth organotypivcal culture organouranium Organouranium compound organo uranium compounds Organovanadium Organovo organoxenon organoytterbium organoyttrium Organozinc organo zinc compounds organo zircon compounds organozirconium organozoa Organ parenchyma organ perfusion organphysiology organ physiology organ pipe Organ Pipe Cactus Organ Pipe Cactus National Monument organpipe leather organ pipe leather

BTree

B-tree