The Community for Technology Leaders
Green Image
Issue No. 07 - July (2010 vol. 22)
ISSN: 1041-4347
pp: 1014-1027
Jignesh M. Patel , University of Wisconsin, Madison and University of Michigan, Ann Arbor
You Jung Kim , Oracle Corp, Redwood City and University of Michigan, Ann Arbor
Multidimensional point indexing plays a critical role in a variety of data-centric applications, including image retrieval, sequence matching, and moving object database search. A common choice of indexing method for these applications is often the "ubiquitous” {\rm R}^{\ast}-tree. Choosing the right indexing method requires careful consideration of various factors such as query operations and index construction methods. In this work, we present an experimental study comparing the {\rm R}^{\ast}-tree and Quadtree using various criteria including the query operations and index construction methods. Although a variety of query operations can be performed using these index structures, previous work has largely focused only on the range search operation. We go beyond this previous work and compare the performance of these index structures using k-nearest neighbor (kNN) and distance join queries. In addition, we also consider the impact of index construction methods in evaluating these index structures. Our study sheds light on how the choice of the underlying index structure affects the performance of different query operations, and shows that the method used for constructing the index and the dynamic nature of the data set has a dramatic impact on the performance of these index structures.
Performance evaluation, Indexing methods, {\rm R}^{\ast}-tree, quadtree, kNN, distance join.
Jignesh M. Patel, You Jung Kim, "Performance Comparison of the {\rm R}^{\ast}-Tree and the Quadtree for kNN and Distance Join Queries", IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 1014-1027, July 2010, doi:10.1109/TKDE.2009.141
95 ms
(Ver 3.1 (10032016))