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)
Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Multivariate data analysis (4th ed.): with readings
Multivariate data analysis (4th ed.): with readings
SIGMOD '95 Proceedings of the 1995 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 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
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
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
ACM Computing Surveys (CSUR)
Modern Information Retrieval
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
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
ACM Computing Surveys (CSUR)
Probabilistic proximity search: fighting the curse of dimensionality in metric spaces
Information Processing Letters
Priority Vantage Points Structures for Similarity Queries in Metric Spaces
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
A Probabilistic Spell for the Curse of Dimensionality
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Feature Extraction and a Database Strategy for Video Fingerprinting
VISUAL '02 Proceedings of the 5th International Conference on Recent Advances in Visual Information Systems
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
A Hybrid Layout Algorithm for Sub-Quadratic Multidimensional Scaling
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
D-Index: Distance Searching Index for Metric Data Sets
Multimedia Tools and Applications
Pivot selection techniques for proximity searching in metric spaces
Pattern Recognition Letters
Fast multidimensional scaling through sampling, springs and interpolation
Information Visualization
A pivot-based routine for improved parent-finding in hybrid MDS
Information Visualization - Special issue of selected and extended InfoVis 03 papers
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
t-Spanners for metric space searching
Data & Knowledge Engineering
Dynamic spatial approximation trees
Journal of Experimental Algorithmics (JEA)
Reference-based indexing for metric spaces with costly distance measures
The VLDB Journal — The International Journal on Very Large Data Bases
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
Optimal Pivots to Minimize the Index Size for Metric Access Methods
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
On the asymptotic behavior of nearest neighbor search using pivot-based indexes
Proceedings of the Third International Conference on SImilarity Search and APplications
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
Improving hybrid MDS with pivot-based searching
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Indexing methods for approximate dictionary searching: Comparative analysis
Journal of Experimental Algorithmics (JEA)
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
The list of clusters revisited
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
Modelling efficient novelty-based search result diversification in metric spaces
Journal of Discrete Algorithms
Hi-index | 0.00 |
Pivot-based algorithms are effective tools for proximity searching in metric spaces. They allow trading space overhead for number of distance evaluations performed at query time. With additional search structures (that pose extra space overhead) they can also reduce the amount of side computations. We introduce a new data structure, the Fixed Queries Array (FQA), whose novelties are (1) it permits sublinear extra CPU time without any extra data structure; (2) it permits trading number of pivots for their precision so as to make better use of the available memory. We show experimentally that the FQA is an efficient tool to search in metric spaces and that it compares favorably against other state of the art approaches. Its simplicity converts it into a simple yet effective tool for practitioners seeking for a black-box method to plug in their applications.