An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
Vorono trees and clustering problems
Information Systems
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
A fast branch & bound nearest neighbour classifier in metric spaces
Pattern Recognition Letters
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The choice of reference points in best-match file searching
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Some approaches to best-match file searching
Communications of the ACM
A guided tour to approximate string matching
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Modern Information Retrieval
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Near Neighbor Search in Large Metric Spaces
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative
Proximity Matching Using Fixed-Queries Trees
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Searching in Metric Spaces by Spatial Approximation
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
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)
Fully Dynamic Spatial Approximation Trees
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Probabilistic Proximity Searching Algorithms Based on Compact Partitions
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Robust and efficient fuzzy match for online data cleaning
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Improved search heuristics for the sa-tree
Pattern Recognition Letters
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Probabilistic proximity searching algorithms based on compact partitions
Journal of Discrete Algorithms - SPIRE 2002
SWAM: a family of access methods for similarity-search in peer-to-peer data networks
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Robust Identification of Fuzzy Duplicates
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
CM-tree: A dynamic clustered index for similarity search in metric databases
Data & Knowledge Engineering
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Dynamic spatial approximation trees
Journal of Experimental Algorithmics (JEA)
Hybrid Index for Metric Space Databases
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
A Search Engine Index for Multimedia Content
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
HRG: A Graph Structure for Fast Similarity Search in Metric Spaces
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
A Pruning Rule Based on a Distance Sparse Table for Hierarchical Similarity Search Algorithms
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Improving the space cost of k-NN search in metric spaces by using distance estimators
Multimedia Tools and Applications
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Solving similarity joins and range queries in metric spaces with the list of twin clusters
Journal of Discrete Algorithms
Continually answering constraint k-NN queries in unstructured P2P systems
Journal of Computer Science and Technology
Experimental Analysis of Insertion Costs in a Naïve Dynamic MDF-Tree
IbPRIA '09 Proceedings of the 4th Iberian Conference on Pattern Recognition and Image Analysis
Analyzing Metric Space Indexes: What For?
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Metric Index: An Efficient and Scalable Solution for Similarity Search
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Dynamic Spatial Approximation Trees for Massive Data
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Indexability, concentration, and VC theory
Proceedings of the Third International Conference on SImilarity Search and APplications
Enlarging nodes to improve dynamic spatial approximation trees
Proceedings of the Third International Conference on SImilarity Search and APplications
BP-tree: an efficient index for similarity search in high-dimensional metric spaces
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Pivot selection method for optimizing both pruning and balancing in metric space indexes
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fully dynamic metric access methods based on hyperplane partitioning
Information Systems
Empirical evaluation of excluded middle vantage point forest on biological sequences workload
Proceedings of the 1st Workshop on New Trends in Similarity Search
Navigating k-nearest neighbor graphs to solve nearest neighbor searches
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
A GPU-Based Implementation for Range Queries on Spaghettis Data Structure
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part I
Approximate distributed metric-space search
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
A bottom-up distance-based index tree for metric space
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
An index data structure for searching in metric space databases
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Accelerating video identification by skipping queries with a compact metric cache
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
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
Indexing issues in supporting similarity searching
PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II
Efficient parallelization of spatial approximation trees
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Indexability, concentration, and VC theory
Journal of Discrete Algorithms
A log square average case algorithm to make insertions in fast similarity search
Pattern Recognition Letters
Generalizing the k-Windows clustering algorithm in metric spaces
Mathematical and Computer Modelling: An International Journal
Static-to-Dynamic transformation for metric indexing structures
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
DSACL+-tree: a dynamic data structure for similarity search in secondary memory
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Query-driven iterated neighborhood graph search for large scale indexing
Proceedings of the 20th ACM international conference on Multimedia
Modelling efficient novelty-based search result diversification in metric spaces
Journal of Discrete Algorithms
| Hi-index | 0.00 |
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.