Synonyms
B-tree
Definition
The B+-tree is a disk-based, paginated, dynamically updateable, balanced, and treelike index structure. It supports the exact match query as well as insertion/deletion operations in O(logpn) I/Os, where n is the number of records in the tree and p is the page capacity in number of records. It also supports the range searches in O(logpn + t∕p) I/Os, where t is the number of records in the query result.
Historical Background
The binary search tree is a well-known data structure. When the data volume is so large that the tree does not fit in main memory, a disk-based search tree is necessary. The most commonly used disk-based search trees are the B-tree and its variations. Originally invented by Bayer and McCreight [2], the B-tree may be regarded as an extension of the balanced binary tree, since a B-tree is always balanced (i.e., all leaf nodes are on the same level). Since each disk access retrieves or updates an entire block of information between memory and...
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Bayer R. The universal B-tree for multidimensional indexing: general concepts. In: Proceedings of the International Conference on Worldwide Computing and Its Applications; 1997. p. 198–209.
Bayer R, McCreight EM. Organization and maintenance of large ordered indices. Acta Inf. 1972;1(3):173–89.
Comer D. The ubiquitous B-tree. ACM Comput Surv. 1979;11(2):121–37.
Knuth D. The art of computer programming. Sorting and searching, vol. 3. Reading: Addison Wesley; 1973.
Robinson JT. K-D-B tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1981. p. 10–8.
Srinivasan V, Carey MJ. Performance of B+ tree concurrency algorithms. VLDB J. 1993;2(4):361–406.
Theodoridis Y. The R-tree-portal. 2003. http://www.rtreeportal.org
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Zhang, D., Baclawski, K.P., Tsotras, V.J. (2018). B+-Tree. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_739
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_739
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering