ACM Computing Surveys (CSUR)
SIAM Journal on Discrete Mathematics
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Effective Proximity Retrieval by Ordering Permutations
IEEE Transactions on Pattern Analysis and Machine Intelligence
MiPai: Using the PP-Index to Build an Efficient and Scalable Similarity Search System
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
On locality sensitive hashing in metric spaces
Proceedings of the Third International Conference on SImilarity Search and APplications
Compact and efficient permutations for proximity searching
MCPR'12 Proceedings of the 4th Mexican conference on Pattern Recognition
| Hi-index | 0.00 |
Modeling proximity searching problems in a metric space allows one to approach many problems in different areas, e.g. pattern recognition, multimedia search, or clustering. Recently there was proposed the permutation based approach, a novel technique that is unbeatable in practice but difficult to compress. In this article we introduce an improvement on that metric space search data structure. Our technique shows that we can compress the permutation based algorithm without loosing precision. We show experimentally that our technique is competitive with the original idea and improves it up to 46% in real databases.