Nearest neighbor queries for r-trees: why not bottom-up?

Authors:
MoonBae Song;KwangJin Park;SeokJin Im;Ki-Sik Kong
Affiliations:
Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Korea;Dept. of Computer Science and Engineering, Korea University, Seoul, Korea
Venue:
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Year:
2006

Citing 8
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A model for the prediction of R-tree performance

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Distance browsing in spatial databases

ACM Transactions on Database Systems (TODS)
Multidimensional binary search trees used for associative searching

Communications of the ACM
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Performance of Nearest Neighbor Queries in R-Trees

ICDT '97 Proceedings of the 6th International Conference on Database Theory

Quantified Score

Hi-index	0.00

Visualization

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.