Back شجرة بي Arabic B-ağac Azerbaijani Arbre-B Catalan درەختی بی CKB B-strom Czech B-Baum German Árbol-B Spanish درخت بی Persian Arbre B French עץ B HE
| B-tree | ||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Type | Tree (data structure) | |||||||||||||||||||||||
| Invented | 1970[1] | |||||||||||||||||||||||
| Invented by | Rudolf Bayer, Edward M. McCreight | |||||||||||||||||||||||
| ||||||||||||||||||||||||
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children.[2] Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems.
- ^ Bayer, R.; McCreight, E. (July 1970). "Organization and maintenance of large ordered indices" (PDF). Proceedings of the 1970 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '70. Boeing Scientific Research Laboratories. p. 107. doi:10.1145/1734663.1734671. S2CID 26930249.
- ^ Comer 1979.