2006 · 52 citations · 9 references
ComputingComputer ScienceData MiningDatabasesInformation RetrievalMultimedia RetrievalNearest Neighbor SearchSearching AlgorithmsIndex StructuresInsertionsLow-dimensional Nearest Neighbor SearchMetric Space SearchNearest Neighbor RetrievalSimilarity MetricsSimilarity SearchSpatial Similarity Search
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, called sparse spatial selection (SSS). This method guarantees a good pivot selection more efficiently than other methods previously proposed. In addition, SSS adapts itself to the dimensionality of the metric space we are working with, and it is not necessary to specify in advance the number of pivots to extract. Furthermore, SSS is dynamic, it supports object insertions in the database efficiently, it can work with both continuous and discrete distance functions, and it is suitable for secondary memory storage. In this work we provide experimental results that confirm the advantages of the method with several vector and metric spaces
9
Near Neighbor Search in Large Metric Spaces
Sergey Brin · 1995 · 556 citations
Some approaches to best-match file searching
Walter A. Burkhard, Robert Keller · Communications of the ACM · 1973 · 414 citations · Full text