Access the full text.
Sign up today, get DeepDyve free for 14 days.
Edgar Chávez, G. Navarro (2000)
An effective clustering algorithm to index high dimensional metric spacesProceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000
L. Micó, J. Oncina, E. Vidal (1994)
A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirementsPattern Recognit. Lett., 15
F. Aurenhammer (1991)
Voronoi diagrams—a survey of a fundamental geometric data structureACM Comput. Surv., 23
L. Micó, J. Oncina, Rafael Carrasco (1996)
A fast branch & bound nearest neighbour classifier in metric spacesPattern Recognit. Lett., 17
G. Navarro (2001)
A guided tour to approximate string matchingACM Comput. Surv., 33
Edgar Chávez, J. Marroquín, Ricardo Baeza-Yates (1999)
Spaghettis: an array based algorithm for similarity queries in metric spaces6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)
Noltemeier Hartmut (1989)
Voronoi Trees and Applications, 1989
Marvin Shapiro (1977)
The choice of reference points in best-match file searchingCommun. ACM, 20
Enrique Vidal-Ruiz (1986)
An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognit. Lett., 4
H. Noltemeier, K. Verbarg, C. Zirkelbach (1992)
Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects
P. Ciaccia, M. Patella, P. Zezula (1997)
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
(1999)
Modern Information Retrieval
Edgar Chávez, G. Navarro, Ricardo Baeza-Yates, J. Marroquín (2001)
Searching in metric spacesACM Comput. Surv., 33
Gísli Hjaltason, H. Samet (1999)
Distance browsing in spatial databasesACM Trans. Database Syst., 24
Sameer Nene, S. Nayar (1997)
A simple algorithm for nearest neighbor search in high dimensionsIEEE Transactions on Pattern Analysis and Machine Intelligence, 19
P. Yianilos (1993)
Data structures and algorithms for nearest neighbor search in general metric spaces
S. Brin (1995)
Near Neighbor Search in Large Metric Spaces
P. Yianilos (2000)
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
J. Uhlmann (1991)
Satisfying General Proximity/Similarity Queries with Metric TreesInf. Process. Lett., 40
Edgar Chávez, G. Navarro (2001)
A Probabilistic Spell for the Curse of Dimensionality
A. Guttman (1984)
R-trees: a dynamic index structure for spatial searching
F. Dehne, H. Noltemeier (1987)
Voronoi trees and clustering problemsInf. Syst., 12
BozkayaTolga, OzsoyogluMeral (1997)
Distance-based indexing for high-dimensional metric spacesSigmod Record
E. Ruiz (1986)
An algorithm for finding nearest neighbours in (approximately) constant average timePattern Recognition Letters, 4
(1991)
Implementing metric trees to satisfy general proximity/similarity
Tolga Bozkaya, Meral Ozsoyoğlu (1997)
Distance-based indexing for high-dimensional metric spaces
Ricardo Baeza-Yates, W. Cunto, U. Manber, Sun Wu (1994)
Proximity Matching Using Fixed-Queries Trees
D. Harman (1995)
Overview of the Third Text REtrieval Conference (TREC-3)
(2001)
Dynamic data structures for searching metric spaces
G. Navarro, Nora Reyes (2001)
Dynamic spatial approximation treesSCCC 2001. 21st International Conference of the Chilean Computer Science Society
J. Bentley (1979)
Multidimensional Binary Search Trees in Database ApplicationsIEEE Transactions on Software Engineering, SE-5
J. Bentley (1975)
Multidimensional binary search trees used for associative searchingCommun. ACM, 18
W. Burkhard, R. Keller (1973)
Some approaches to best-match file searchingCommunications of the ACM, 16
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function defined among them which satisfies the triangle inequality. The goal is, given a set of objects and a query, retrieve those objects close enough to the query. The complexity measure is the number of distances computed to achieve this goal. Our data structure, called sa-tree (“spatial approximation tree”), is based on approaching the searched objects spatially, that is, getting closer and closer to them, rather than the classic divide-and-conquer approach of other data structures. We analyze our method and show that the number of distance evaluations to search among n objects is sublinear. We show experimentally that the sa-tree is the best existing technique when the metric space is hard to search or the query has low selectivity. These are the most important unsolved cases in real applications. As a practical advantage, our data structure is one of the few that does not need to tune parameters, which makes it appealing for use by non-experts.
The VLDB Journal – Springer Journals
Published: Aug 1, 2002
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.