Index-driven similarity search in metric spaces (Survey Article)

作者: Gisli R. Hjaltason , Hanan Samet

DOI: 10.1145/958942.958948

关键词:

摘要: Similarity search is a very important operation in multimedia databases and other database applications involving complex objects, involves finding objects data set S similar to query object q, based on some similarity measure. In this article, we focus methods for that make the general assumption represented with distance metric d. Existing handling setting typically fall into one of two classes. The first directly indexes distances (distance-based indexing), while second mapping vector space (mapping-based approach). main part article dedicated survey distance-based indexing methods, but also briefly outline how occurs mapping-based methods. We present framework performing distances, algorithms common types queries operate an arbitrary "search hierarchy." These can be applied each presented, provided suitable hierarchy defined.

参考文章(94)
Jason Tsong-Li Wang, Xiong Wang, King-Ip Lin, Dennis Shasha, Bruce A. Shapiro, Kaizhong Zhang, Evaluating a class of distance-mapping algorithms for data mining and clustering knowledge discovery and data mining. pp. 307- 311 ,(1999) , 10.1145/312129.312264
Jack A. Orenstein, Multidimensional tries used for associative searching Information Processing Letters. ,vol. 14, pp. 150- 157 ,(1982) , 10.1016/0020-0190(82)90027-8
J. McNAMES, J. A. K. SUYKENS, J. VANDEWALLE, WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION International Journal of Bifurcation and Chaos. ,vol. 9, pp. 1485- 1500 ,(1999) , 10.1142/S0218127499001048
Nick Roussopoulos, Stephen Kelley, Frédéric Vincent, Nearest neighbor queries international conference on management of data. ,vol. 24, pp. 71- 79 ,(1995) , 10.1145/223784.223794
Jeffrey K. Uhlmann, Satisfying general proximity / similarity queries with metric trees Information Processing Letters. ,vol. 40, pp. 175- 179 ,(1991) , 10.1016/0020-0190(91)90074-R
C. Traina, A. Traina, C. Faloutsos, B. Seeger, Fast indexing and visualization of metric data sets using slim-trees IEEE Transactions on Knowledge and Data Engineering. ,vol. 14, pp. 244- 260 ,(2002) , 10.1109/69.991715
Philip M. Hubbard, Approximating polyhedra with spheres for time-critical collision detection ACM Transactions on Graphics. ,vol. 15, pp. 179- 210 ,(1996) , 10.1145/231731.231732
Thomas Brinkhoff, Hans-Peter Kriegel, Bernhard Seeger, Efficient processing of spatial joins using R-trees Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93. ,vol. 22, pp. 237- 246 ,(1993) , 10.1145/170035.170075
Tolga Bozkaya, Meral Ozsoyoglu, Indexing large metric spaces for similarity search queries ACM Transactions on Database Systems. ,vol. 24, pp. 361- 404 ,(1999) , 10.1145/328939.328959
Henry Fuchs, Zvi M. Kedem, Bruce F. Naylor, On visible surface generation by a priori tree structures Proceedings of the 7th annual conference on Computer graphics and interactive techniques - SIGGRAPH '80. ,vol. 14, pp. 124- 133 ,(1980) , 10.1145/800250.807481