Name
Abstract | ||
|---|---|---|
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. In this paper we propose a new way to solve this problem using a special hardware device called ternary content addressable memory (TCAM). TCAM is an associative memory, which is a special type of computer memory that is widely used in switches and routers for very high speed search applications. We show that the TCAM computational model can be leveraged and adjusted to solve NN search problems in a single TCAM lookup cycle, and with linear space. This concept does not suffer from the curse of dimensionality and is shown to improve the best known approaches for NN by more than four orders of magnitude. Simulation results demonstrate dramatic improvement over the best known approaches for NN, and suggest that TCAM devices may play a critical role in future large-scale databases and cloud applications. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2771937.2771938 | DaMoN |
Field | DocType | Citations |
Content-addressable memory,Computer science,Linear space,Parallel computing,Curse of dimensionality,Real-time computing,Hash function,Memory-mapped I/O,Computer memory,Nearest neighbor search,Cloud computing | Conference | 5 |
PageRank | References | Authors |
0.39 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anat Bremler-Barr | 1 | 505 | 39.95 |
| Yotam Harchol | 2 | 135 | 9.07 |
| David Hay | 3 | 185 | 12.25 |
| Yacov Hel-Or | 4 | 461 | 40.74 |