Ultra-Fast Similarity Search Using Ternary Content Addressable Memory
Anat Bremler-Barr, Yotam Harchol, David A. Hay, Yacov Hel-Or · 2015
Similarity search, and specifically the nearest-neighbor search (NN) problem is widely used in many fields of computer science such as machine learning, computer vision and databases. However, in many settings such searches are known to suffer from the notorious curse of dimensionality, where running time grows exponentially with d. This causes severe performance degradation when working in high-dimensional spaces. Approximate techniques such as locality-sensitive hashing [2] improve the performance of the search, but are still computationally intensive.