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
Multidimensional access methods
ACM Computing Surveys (CSUR)
Some approaches to best-match file searching
Communications of the ACM
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
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
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
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
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)
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
A Data Structure and an Algorithm for the Nearest Point Problem
IEEE Transactions on Software Engineering
A metric index for approximate string matching
Theoretical Computer Science
Engineering efficient metric indexes
Pattern Recognition Letters
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
WSEAS Transactions on Computers
Improving the space cost of k-NN search in metric spaces by using distance estimators
Multimedia Tools and Applications
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
Speeding up spatial approximation search in metric spaces
Journal of Experimental Algorithmics (JEA)
Analyzing Metric Space Indexes: What For?
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
Curse of Dimensionality in Pivot Based Indexes
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
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
Maximal metric margin partitioning for similarity search indexes
Proceedings of the 18th ACM conference on Information and knowledge management
Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space
Knowledge and Information Systems
Simple space-time trade-offs for AESA
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
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
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
The state of the art in content-based image retrieval in P2P networks
ICIMCS '10 Proceedings of the Second International Conference on Internet Multimedia Computing and Service
Finding the k-closest pairs in metric spaces
Proceedings of the 1st Workshop on New Trends in Similarity Search
Empirical evaluation of excluded middle vantage point forest on biological sequences workload
Proceedings of the 1st Workshop on New Trends in Similarity Search
Indexing the fully evolvement of spatiotemporal objects
WSEAS Transactions on Information Science and Applications
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Approximate distributed metric-space search
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Practical construction of k-nearest neighbor graphs in metric spaces
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Recursive lists of clusters: a dynamic data structure for range queries in metric spaces
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
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
Load Balancing Query Processing in Metric-Space Similarity Search
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Adapting metric indexes for searching in multi-metric spaces
Multimedia Tools and Applications
The list of clusters revisited
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
Polyphasic metric index: reaching the practical limits of proximity 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
Modelling efficient novelty-based search result diversification in metric spaces
Journal of Discrete Algorithms
Multi-level clustering on metric spaces using a Multi-GPU platform
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Range query processing on single and multi GPU environments
Computers and Electrical Engineering
Hi-index | 0.10 |
The metric space model abstracts many proximity search problems, from nearest-neighbor classifiers to textual and multimedia information retrieval. In this context, an index is a data structure that speeds up proximity queries. However, indexes lose their efficiency as the intrinsic data dimensionality increases. In this paper we present a simple index called list of clusters (LC), which is based on a compact partitioning of the data set. The LC is shown to require little space, to be suitable both for main and secondary memory implementations, and most importantly, to be very resistant to the intrinsic dimensionality of the data set. In this aspect our structure is unbeaten. We finish with a discussion of the role of unbalancing in metric space searching, and how it permits trading memory space for construction time.