Abstract
Given a query point q, finding the nearest neighbor (NN) object is one of the most important problem in computer science. In this paper, a bottom-up search algorithm for processing NN query in R-trees is presented. An additional data structure, hash, is introduced to increase the pruning capability of the proposed algorithm. Based on hash, whole data space is disjointly partitioned into n × n cells. Each cell contains the pointers of leaf nodes which intersect with the cell. The experiment shows that the proposed approach outperforms the existing NN search algorithms including the BFS algorithm which is known as I/O optimal algorithm.
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.
Similar content being viewed by others
References
Bentley, J.: Multidimensional binary search trees used for associative searching. Communication of ACM 18(9) (1975)
Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of SIGMOD (1984)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of SIGMOD (1990)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proc. of SIGMOD (1995)
Theodoridis, Y., Sellis, T.: A Model for the Prediction of R-tree Performance. In: Proc. of PODS (1996)
Papadopoulos, A., Manolopoulos, Y.: Performance of Nearest Neighbor Queries in R-Trees. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, Springer, Heidelberg (1996)
Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Systems 24(2) (1999)
Böhm, C., Berchtold, S., Keim, D.A.: Searching in High-Dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys 33(3) (2001)
Yufei Tao’s A Dataset collection. http://www.cs.cityu.edu.hk/~taoyf/ds.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, M., Park, K., Im, S., Kong, KS. (2006). Nearest Neighbor Queries for R-Trees: Why Not Bottom-Up?. In: Li Lee, M., Tan, KL., Wuwongse, V. (eds) Database Systems for Advanced Applications. DASFAA 2006. Lecture Notes in Computer Science, vol 3882. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11733836_68
Download citation
DOI: https://doi.org/10.1007/11733836_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33337-1
Online ISBN: 978-3-540-33338-8
eBook Packages: Computer ScienceComputer Science (R0)