An algorithm for finding nearest neighbours in (approximately) constant average time
Pattern Recognition Letters
Vorono trees and clustering problems
Information Systems
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
Query processing for distance metrics
Proceedings of the sixteenth international conference on Very large databases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Pattern Recognition Letters
Modern database systems
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Reducing the overhead of the AESA metric-space nearest neighbour searching algorithm
Information Processing Letters
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A fast branch & bound nearest neighbour classifier in metric spaces
Pattern Recognition Letters
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A cost model for nearest neighbor search in high-dimensional data space
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Simple Algorithm for Nearest Neighbor Search in High Dimensions
IEEE Transactions on Pattern Analysis and Machine Intelligence
A cost model for similarity queries in metric spaces
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Evaluating a class of distance-mapping algorithms for data mining and clustering
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
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
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Indexing large metric spaces for similarity search queries
ACM Transactions on Database Systems (TODS)
Adaptive multi-stage distance join processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
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
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Similarity search in metric databases through hashing
MULTIMEDIA '01 Proceedings of the 2001 ACM workshops on Multimedia: multimedia information retrieval
ACM Computing Surveys (CSUR)
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Fast Indexing and Visualization of Metric Data Sets using Slim-Trees
IEEE Transactions on Knowledge and Data Engineering
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
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
Parallel Algorithms for High-dimensional Similarity Joins for Data Mining Applications
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th 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
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Fully Dynamic Spatial Approximation Trees
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
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
Performance Guarantees for Hierarchical Clustering
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances
The VLDB Journal — The International Journal on Very Large Data Bases
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
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)
The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Cluster-preserving Embedding of Proteins
Cluster-preserving Embedding of Proteins
Improved search heuristics for the sa-tree
Pattern Recognition Letters
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Hierarchical browsing and search of large image databases
IEEE Transactions on Image Processing
Improved search heuristics for the sa-tree
Pattern Recognition Letters
An efficient nearest neighbor algorithm for P2P settings
dg.o '05 Proceedings of the 2005 national conference on Digital government research
Accelerating approximate similarity queries using genetic algorithms
Proceedings of the 2005 ACM symposium on Applied computing
MAMView: a visual tool for exploring and understanding metric access methods
Proceedings of the 2005 ACM symposium on Applied computing
Improving approximate matching capabilities for Meta Map Transfer applications
Proceedings of the 3rd international symposium on Principles and practice of programming in Java
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On Optimizing Distance-Based Similarity Search for Biological Databases
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
Building and Querying a P2P Virtual World
Geoinformatica
A metric index for approximate string matching
Theoretical Computer Science
M-Chord: a scalable distributed similarity search structure
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
On scalability of the similarity search in the world of peers
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Reverse Nearest Neighbor Search in Metric Spaces
IEEE Transactions on Knowledge and Data Engineering
Efficient peer-to-peer semantic overlay networks based on statistical language models
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
Detection and Visualization of Defects in 3D Unstructured Models of Nematic Liquid Crystals
IEEE Transactions on Visualization and Computer Graphics
Engineering efficient metric indexes
Pattern Recognition Letters
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
DBM*-Tree: an efficient metric access method
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
ACM Transactions on Database Systems (TODS)
Genetic algorithms for approximate similarity queries
Data & Knowledge Engineering
Learning for efficient retrieval of structured data with noisy queries
Proceedings of the 24th international conference on Machine learning
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing schemes for similarity search in datasets of short protein fragments
Information Systems
CM-tree: A dynamic clustered index for similarity search in metric databases
Data & Knowledge Engineering
Nearest neighbor search in metric spaces through Content-Addressable Networks
Information Processing and Management: an International Journal
Top-k query evaluation with probabilistic guarantees
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic spatial approximation trees
Journal of Experimental Algorithmics (JEA)
Best position algorithms for top-k queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Multi-probe LSH: efficient indexing for high-dimensional similarity search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Peer-to-peer similarity search in metric spaces
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Disorder inequality: a combinatorial approach to nearest neighbor search
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
ACM Transactions on Database Systems (TODS)
Approximate embedding-based subsequence matching of time series
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Reference-based indexing for metric spaces with costly distance measures
The VLDB Journal — The International Journal on Very Large Data Bases
SEPIA: estimating selectivities of approximate string predicates in large Databases
The VLDB Journal — The International Journal on Very Large Data Bases
Nearest neighbor search methods for handshape recognition
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
Scalability comparison of Peer-to-Peer similarity search structures
Future Generation Computer Systems
Dynamic user-defined similarity searching in semi-structured text retrieval
Proceedings of the 3rd international conference on Scalable information systems
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
Paginação de resultados em consultas por abrangência
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
Solving similarity joins and range queries in metric spaces with the list of twin clusters
Journal of Discrete Algorithms
Approximate similarity search: A multi-faceted problem
Journal of Discrete Algorithms
Caching content-based queries for robust and efficient image retrieval
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Seamlessly integrating similarity queries in SQL
Software—Practice & Experience
Faster retrieval with a two-pass dynamic-time-warping lower bound
Pattern Recognition
Easing the Dimensionality Curse by Stretching Metric Spaces
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
Speeding up spatial approximation search in metric spaces
Journal of Experimental Algorithmics (JEA)
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
The Onion-Tree: Quick Indexing of Complex Data in the Main Memory
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
SiMPSON: Efficient Similarity Search in Metric Spaces over P2P Structured Overlay Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
On Index-Free Similarity Search in Metric Spaces
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Combinatorial Framework for Similarity Search
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Efficient Similarity Search by Reducing I/O with Compressed Sketches
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
Efficient range query processing in metric spaces over highly distributed data
Distributed and Parallel Databases
A flexible framework to ease nearest neighbor search in multidimensional data spaces
Data & Knowledge Engineering
An incremental clustering scheme for data de-duplication
Data Mining and Knowledge Discovery
Bulk construction of dynamic clustered metric trees
Knowledge and Information Systems
Reducing non-determinism of k-NN searching in non-ordered discrete data spaces
Information Processing Letters
Efficient bulk-loading on dynamic metric access methods
Information Systems
Simple space-time trade-offs for AESA
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
MESSIF: metric similarity search implementation framework
DELOS'07 Proceedings of the 1st international conference on Digital libraries: research and development
Engineering Applications of Artificial Intelligence
A database-based framework for gesture recognition
Personal and Ubiquitous Computing
Dimension reduction for distance-based indexing
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
Indexing inexact proximity search with distance regression in pivot space
Proceedings of the Third International Conference on SImilarity Search and APplications
Proceedings of the Third International Conference on SImilarity Search and APplications
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
Proactive control of manufacturing processes using historical data
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Transforming range queries to equivalent box queries to optimize page access
Proceedings of the VLDB Endowment
Techniques for similarity searching in multimedia databases
Proceedings of the VLDB Endowment
Information Sciences: an International Journal
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
Succinct nearest neighbor search
Proceedings of the Fourth International Conference on SImilarity Search and APplications
A fast pivot-based indexing algorithm for metric spaces
Pattern Recognition Letters
Embedding-based subsequence matching in time-series databases
ACM Transactions on Database Systems (TODS)
Fast approximate similarity search based on degree-reduced neighborhood graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient group of permutants for proximity searching
MCPR'11 Proceedings of the Third Mexican conference on Pattern recognition
Behavioral similarity: a proper metric
BPM'11 Proceedings of the 9th international conference on Business process management
Impact of the initialization in tree-based fast similarity search techniques
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Similarity search on a large collection of point sets
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
A bottom-up distance-based index tree for metric space
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Peer-to-peer similarity search based on m-tree indexing
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
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
A scalable nearest neighbor search in p2p systems
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Distributed and scalable similarity searching in metric spaces
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Indexing issues in supporting similarity searching
PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II
Similarity grid for searching in metric spaces
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
Incremental rank updates for moving query points
GIScience'06 Proceedings of the 4th international conference on Geographic Information Science
Metric-Based similarity search in unstructured peer-to-peer systems
Transactions on Large-Scale Data- and Knowledge-Centered Systems V
Partitioned multi-indexing: bringing order to social search
Proceedings of the 21st international conference on World Wide Web
Pivot selection: Dimension reduction for distance-based indexing
Journal of Discrete Algorithms
A log square average case algorithm to make insertions in fast similarity search
Pattern Recognition Letters
Exploiting MapReduce-based similarity joins
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Generalizing the k-Windows clustering algorithm in metric spaces
Mathematical and Computer Modelling: An International Journal
Approximate bregman near neighbors in sublinear time: beyond the triangle inequality
Proceedings of the twenty-eighth annual symposium on Computational geometry
Efficient processing of k nearest neighbor joins using MapReduce
Proceedings of the VLDB Endowment
Similarity caching in large-scale image retrieval
Information Processing and Management: an International Journal
MapReduce-based similarity join for metric spaces
Proceedings of the 1st International Workshop on Cloud Intelligence
Exploiting database similarity joins for metric spaces
Proceedings of the VLDB Endowment
The list of clusters revisited
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
Future trends in similarity searching
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Efficient similarity search in metric spaces with cluster reduction
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
Processing top-k queries in distributed hash tables
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
On the usage of clustering for content based image retrieval
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Evaluation measures for similarity search results in process model repositories
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Nested Partitions Properties for Spatial Content Image Retrieval
International Journal of Digital Library Systems
SHIATSU: tagging and retrieving videos without worries
Multimedia Tools and Applications
HybridNN: An accurate and scalable network location service based on the inframetric model
Future Generation Computer Systems
CID: an efficient complexity-invariant distance for time series
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
Similarity search is a very important operation in multimedia databases and other database applications involving complex objects, and involves finding objects in a data set S similar to a query object q, based on some similarity measure. In this article, we focus on methods for similarity search that make the general assumption that similarity is represented with a distance metric d. Existing methods for handling similarity search in this setting typically fall into one of two classes. The first directly indexes the objects based on distances (distance-based indexing), while the second is based on mapping to a vector space (mapping-based approach). The main part of this article is dedicated to a survey of distance-based indexing methods, but we also briefly outline how search occurs in mapping-based methods. We also present a general framework for performing search based on distances, and present algorithms for common types of queries that operate on an arbitrary "search hierarchy." These algorithms can be applied on each of the methods presented, provided a suitable search hierarchy is defined.