Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Bayer R. The universal B-tree for multidimensional indexing: general concepts. In Proc. Int. Conf. on Worldwide Computing and Its Applications (WWCA), 1997, pp. 198–209.
Bayer R. and McCreight E.M. Organization and maintenance of large ordered indices. Acta Inf., 1, 1972.
Comer D. The ubiquitous B-tree. ACM Comput. Surv., 11(2), 1979.
Knuth D. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison Wesley, MA, USA, 1973.
Robinson J. The K-D-B tree: a search structure for large multidimensional dynamic indexes. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1981, pp. 10–18.
Srinivasan V. and Carey M.J. Performance of B+ tree concurrency algorithms. VLDB J., 2(4):361–406, 1993.
Theodoridis Y. The R-tree-portal. http://www.rtreeportal.org, 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this entry
Cite this entry
Zhang, D., Baclawski, K.P., J. Tsotras, V. (2009). B+-Tree. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_739
Download citation
DOI: https://doi.org/10.1007/978-0-387-39940-9_739
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-35544-3
Online ISBN: 978-0-387-39940-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering