Engineering efficient metric indexes

Authors:
Kimmo Fredriksson
Affiliations:
Department of Computer Science, University of Joensuu, P.O. Box 111, 80101 Joensuu, Finland
Venue:
Pattern Recognition Letters
Year:
2007

Citing 12
Cited 5

An algorithm for finding nearest neighbours in (approximately) constant average time

Pattern Recognition Letters
Data structures and algorithms for nearest neighbor search in general metric spaces

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A fast bit-vector algorithm for approximate string matching based on dynamic programming

Journal of the ACM (JACM)
Some approaches to best-match file searching

Communications of the ACM
Random projection in dimensionality reduction: applications to image and text data

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Searching in metric spaces

ACM Computing Surveys (CSUR)
Modern Information Retrieval

Modern Information Retrieval
Probabilistic proximity search: fighting the curse of dimensionality in metric spaces

Information Processing Letters
An Effective Clustering Algorithm to Index High Dimensional Metric Spaces

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Pivot selection techniques for proximity searching in metric spaces

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

ACM Transactions on Database Systems (TODS)
A compact space decomposition for effective metric indexing

Pattern Recognition Letters

Faster retrieval with a two-pass dynamic-time-warping lower bound

Pattern Recognition
Speeding up spatial approximation search in metric spaces

Journal of Experimental Algorithmics (JEA)
Simple space-time trade-offs for AESA

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Indexing methods for approximate dictionary searching: Comparative analysis

Journal of Experimental Algorithmics (JEA)
Dynamic optimization of queries in pivot-based indexing

Multimedia Tools and Applications

Quantified Score

Hi-index	0.10

Visualization

Abstract

We give efficient algorithms and index data structures for range search in general metric spaces. We give a simple methods to make almost any existing algorithm memory adaptive, improving the search the more memory is available. For vector spaces and metric space of strings we show how several distances can be computed in bit-parallelly, in sequential computer, and use the result to improve the search performance. This method works especially well with approximate range queries. The experimental results show that we can obtain order of magnitude improvements over the existing methods.