An Empirical Comparison Of FAISS And FENSHSES For Nearest Neighbor Search In Hamming Space

Abstract

In this paper, we compare the performances of FAISS and FENSHSES on nearest neighbor search in Hamming space--a fundamental task with ubiquitous applications in nowadays eCommerce. Comprehensive evaluations are made in terms of indexing speed, search latency and RAM consumption. This comparison is conducted towards a better understanding on trade-offs between nearest neighbor search systems implemented in main memory and the ones implemented in secondary memory, which is largely unaddressed in literature.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keymu2019an

Related papers

• Fast And Exact Nearest Neighbor Search In Hamming Space On Full-text Search Engines (2019)5.24
• In-memory Nearest Neighbor Search With Fefet Multi-bit Content-addressable Memories (2020)11.85
• Optimizing Domain-specific Image Retrieval: A Benchmark Of FAISS And Annoy With Fine-tuned Features (2024)2.26
• Experimental Analysis Of Locality Sensitive Hashing Techniques For High-dimensional Approximate Nearest Neighbor Searches (2020)6.34
• Falconn++: A Locality-sensitive Filtering Approach For Approximate Nearest Neighbor Search (2022)2.26
• Learning Space Partitions For Nearest Neighbor Search (2019)0.00
• Results Of The Neurips'21 Challenge On Billion-scale Approximate Nearest Neighbor Search (2022)0.00
• SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search (2021)0.00