An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
An optimal synchronizer for the hypercube
SIAM Journal on Computing
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Journal of Algorithms
Data structures and algorithm analysis (2nd ed.)
Data structures and algorithm analysis (2nd ed.)
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multidimensional access methods
ACM Computing Surveys (CSUR)
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
SIAM Journal on Computing
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
Some approaches to best-match file searching
Communications of the ACM
Communications of the ACM
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Introduction to algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Modern Information Retrieval
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Probabilistic proximity search: fighting the curse of dimensionality in metric spaces
Information Processing Letters
t-Spanners as a Data Structure for Metric Space Searching
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Probabilistic proximity searching algorithms based on compact partitions
Journal of Discrete Algorithms - SPIRE 2002
Proximity searching in high dimensional spaces with a proximity preserving order
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Parallel query processing on distributed clustering indexes
Journal of Discrete Algorithms
Solving similarity joins and range queries in metric spaces with the list of twin clusters
Journal of Discrete Algorithms
Speeding up spatial approximation search in metric spaces
Journal of Experimental Algorithmics (JEA)
Hi-index | 0.00 |
The problem of Proximity Searching in Metric Spaces consists in finding the elements of a set which are close to a given query under some similarity criterion. In this paper we present a new methodology to solve this problem, which uses a t-spanner G'(V,E) as the representation of the metric database. A t-spanner is a subgraph G'(V,E) of a graph G(V,A), such that E@?A and G' approximates the shortest path costs over G within a precision factor t. Our key idea is to regard the t-spanner as an approximation to the complete graph of distances among the objects, and to use it as a compact device to simulate the large matrix of distances required by successful search algorithms such as AESA. The t-spanner properties imply that we can use shortest paths over G' to estimate any distance with bounded-error factor t. For this sake, several t-spanner construction, updating, and search algorithms are proposed and experimentally evaluated. We show that our technique is competitive against current approaches. For example, in a metric space of documents our search time is only 9% over AESA, yet we need just 4% of its space requirement. Similar results are obtained in other metric spaces. Finally, we conjecture that the essential metric space property to obtain good t-spanner performance is the existence of clusters of elements, and enough empirical evidence is given to support this claim. This property holds in most real-world metric spaces, so we expect that t-spanners will display good behavior in most practical applications. Furthermore, we show that t-spanners have a great potential for improvements.