Abstract
In this work, we propose two variants of K-d trees where fingers are used to improve the performance of orthogonal range search and nearest neighbor queries when they exhibit locality of reference. The experiments show that the second alternative yields significant savings. Although it yields more modest improvements, the first variant does it with much less memory requirements and great simplicity, which makes it more attractive on practical grounds.
This research was partially supported by the Future and Emergent Technologies programme of the EU under contract IST-1999-14186 (ALCOM-FT) and the Spanish Min. of Science and Technology project TIC2002-00190 (AEDRI II).
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.: Multidimensional binary search trees used for associative retrieval. Communications of the ACM 18(9), 509–517 (1975)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Brown, M.R., Tarjan, R.E.: Design and Analysis of a Data Structure for Representing Sorted Lists. SIAM Journal of Computing 9(3), 594–614 (1980)
Chanzy, P., Devroye, L., Zamora-Cura, C.: Analysis of range search for random k-d trees. Acta Informatica 37, 355–383 (2001)
Devroye, L., Jabbour, J., Zamora-Cura, C.: Squarish k-d trees. SIAM Journal of Computing 30, 1678–1700 (2000)
Duch, A., Estivill-Castro, V., Martínez, C.: Randomized K-dimensional binary search trees. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 199–208. Springer, Heidelberg (1998)
Duch, A., Martínez, C.: On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures. Journal of Algorithms 44(1), 226–245 (2002)
Gaede, V., Günther, O.: Multidimensional Access Methods. ACM Computing Surveys 30(2), 170–231 (1998)
Guibas, L.J., McCreight, E.M., Plass, M.F., Roberts, J.R.: A New Representation for Linear Lists. In: Annual ACM Symposium on the Theory of Computing, STOC (1977)
Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1990)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 2002–2208 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duch, A., Martínez, C. (2004). Fingered Multidimensional Search Trees. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-24838-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22067-1
Online ISBN: 978-3-540-24838-5
eBook Packages: Springer Book Archive