ACM Computing Surveys (CSUR)
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
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
Spatial Selection of Sparse Pivots for Similarity Search in Metric Spaces
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Clustering-based similarity search in metric spaces with sparse spatial centers
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
An index data structure for searching in metric space databases
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Approximate distributed metric-space search
Proceedings of the 9th workshop on Large-scale and distributed informational retrieval
Modelling efficient novelty-based search result diversification in metric spaces
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We present an index data structure for metric-space databases. The proposed method has the advantage of allowing an efficient use of secondary memory. In the case of index entirely loaded in main memory our strategy achieves competitive performance. Our experimental study shows that the proposed index outperforms other strategies known to be efficient in practice. A valuable feature of the proposal is that the index can be dynamically updated once constructed.