Abstract
In multimedia databases, k-nearest neighbor queries are popular and frequently contain non-spatial predicates. Among the available techniques for such queries, the incremental nearest neighbor algorithm proposed by Hjaltason and Samet is known as the most useful algorithm [16]. The reason is that if k′ > k neighbors are needed, it can provide the next neighbor for the upper operator without restarting the query from scratch. However, the R-tree in their algorithm has no facility capable of partially pruning tuple candidates that will turn out not to satisfy the remaining predicates, leading their algorithm to inefficiency. In this paper, we propose an RS-tree-based incremental nearest neighbor algorithm complementary to their algorithm. The RS-tree used in our algorithm is a hybrid of the R-tree and the S-tree, as its buddy tree, based on the hierarchical signature file. Experimental results show that our RS-tree enhances the performance of Hjaltason and Samet's algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu, “An optimal algorithm for approximate nearest neighbor searching fixed dimensions,” Journal of the ACM, Vol. 45, No. 6, 1998.
N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*a-tree: An efficient and robust access method for points and rectangles,” in Proceedings of the ACM SIGMOD Conference, June 1990.
S. Berchtold, C. Bohm, B. Braunmuller, D.A. Keim, and H.-P. Kriegel, “Fast parallel similarity search in multimedia databases,” in Proceedings of the ACM SIGMOD Conference, June 1997.
S. Berchtold, C. Bohm, D.A. Keim, and H.-P. Kriegel, “A cost model for nearest neighbor search in highdimensional data space,” in Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 1997.
S. Berchtold, B. Ertl, D.A. Keim, H.-P. Kriegel, and T. Seidl, “Fast nearest neighbor search in high-dimensional spaces,” in Proceedings of the 14th Int'l. Conf. on Data Engineering, February 1998.
A.J. Broder, “Strategies for efficient incremental nearest neighbor search,” Pattern Recognition, Vol. 23, No. 1/2, 1990.
M.J. Carey and D. Kossmann, “On saying “Enough Already!” in SQL,” in Proceedings of the ACMSIGMOD Conference, June 1997.
M.J. Carey and D. Kossmann, “Reducing the braking distance of an SQL query engine,” in Proceedings of 24th International Conference on Very Large Data Bases, August 1998.
W.W. Chang and H.J. Schek, “A signature access method for the startbust database system,” in Proc. of the 15th Int'l Conference on Very Large Data Bases, August 1989.
S. Chaudhuri and L. Gravano, “Evaluating top-K selection queries,” in Proceedings of 25th International Conference on Very Large Data Bases, September 1999.
R. Fagin, “Fuzzy queries in multimedia database systems,” in Proceedings of the 16th ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, June 1998.
C. Faloutsos and S. Christodoulakis, “Optimal signature extraction and information loss,” ACMTransactions on Database Systems, Vol. 12, No. 3, 1987.
M. Flickner et al., “Query by image and video content: The QBIC system,” IEEE Computer, Vol. 28, No. 9, 1995.
S. Grumbach, P. Rigaux, and L. Segoufin, “The DEDALE system for complex spatial queries,” in Proceedings of the ACM SIGMOD Conference, June 1998.
A. Henrich, “A distance-scan algorithm for spatial access structures,” in Proceedings of the Second ACM Workshop on Geographic Information Systems, December 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Park, DJ., Kim, HJ. An Enhanced Technique for k-Nearest Neighbor Queries with Non-Spatial Selection Predicates. Multimedia Tools and Applications 19, 79–103 (2003). https://doi.org/10.1023/A:1021121030238
Issue Date:
DOI: https://doi.org/10.1023/A:1021121030238