Abstract
A file structure, called k-dimensional B-tree of order d, d ≥ 1, is presented which allows each of the operations k-dimensional exact match query (“k-dimensional search”), insertion and deletion to be performed in time 0(log(d+1)N+k) in the worst case, where N is the number of k-dimensional records in the file.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bentley, J.L. (1975), Multidimensional search trees used for associative searching, CACM 18, 9 (September 1975), 509–517.
Bentley, J.L. (1978), Multidimensional binary search trees in database applications, Carnegie-Mellon Report CMU-CS-78.
Güting, H. and Kriegel, H.P. (1980), Multidimensional B-trees, Computer Science Technical Report, Universität Dortmund, will appear.
Lee, D.T. and Wong, C.K. (1978), Quintary Tree: A File Structure for Multidimensional Database Systems, IBM Research Report, R.C. 7285.
Mehlhorn, K. (1979), Dynamic binary search, SIAM J. COMPUT. 8,2 (May 1979), 175–198.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Güting, H., Kriegel, H.P. (1980). Multidimensional B-tree: An efficient dynamic file structure for exact match queries. In: Wilhelm, R. (eds) GI - 10. Jahrestagung. Informatik-Fachberichte, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-67838-7_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10388-2
Online ISBN: 978-3-642-67838-7
eBook Packages: Springer Book Archive