{CXL-ANNS}:{Software-Hardware} collaborative memory disaggregation and computation for {Billion-Scale} approximate nearest neighbor search

J Jang, H Choi, H Bae, S Lee, M Kwon… - 2023 USENIX Annual …, 2023 - usenix.org
We propose CXL-ANNS, a software-hardware collaborative approach to enable highly
scalable approximate nearest neighbor search (ANNS) services. To this end, we first …

Cagra: Highly parallel graph construction and approximate nearest neighbor search for gpus

H Ootomo, A Naruse, C Nolet, R Wang… - 2024 IEEE 40th …, 2024 - ieeexplore.ieee.org
Approximate Nearest Neighbor Search (ANNS) plays a critical role in various disciplines
spanning data mining and artificial intelligence, from information retrieval and computer …

Efficient approximate nearest neighbor search in multi-dimensional databases

Y Peng, B Choi, TN Chan, J Yang, J Xu - … of the ACM on Management of …, 2023 - dl.acm.org
Approximate nearest neighbor (ANN) search is a fundamental search in multi-dimensional
databases, which has numerous real-world applications, such as image retrieval …

Scalable Billion-point Approximate Nearest Neighbor Search Using {SmartSSDs}

B Tian, H Liu, Z Duan, X Liao, H **… - 2024 USENIX Annual …, 2024 - usenix.org
Approximate nearest neighbor search (ANNS) in high-dimensional vector spaces has
become increasingly crucial in database and machine learning applications. Most previous …

[PDF][PDF] Graph-and Tree-based Indexes for High-dimensional Vector Similarity Search: Analyses, Comparisons, and Future Directions.

Z Wang, P Wang, T Palpanas… - IEEE Data Eng …, 2023 - helios2.mi.parisdescartes.fr
Approximate nearest neighbor search on high-dimensional vectors is a crucial component
for numerous applications in various fields. To solve this problem efficiently, dozens of …

Revisiting the index construction of proximity graph-based approximate nearest neighbor search

S Yang, J **e, Y Liu, JX Yu, X Gao, Q Wang… - arxiv preprint arxiv …, 2024 - arxiv.org
Proximity graphs (PG) have gained increasing popularity as the state-of-the-art (SOTA)
solutions to $ k $-approximate nearest neighbor ($ k $-ANN) search on high-dimensional …

Bridging Software-Hardware for CXL Memory Disaggregation in Billion-Scale Nearest Neighbor Search

J Jang, H Choi, H Bae, S Lee, M Kwon… - ACM Transactions on …, 2024 - dl.acm.org
We propose CXL-ANNS, a software-hardware collaborative approach to enable scalable
approximate nearest neighbor search (ANNS) services. To this end, we first disaggregate …

GTS: GPU-based Tree Index for Fast Similarity Search

Y Zhu, R Ma, B Zheng, X Ke, L Chen… - Proceedings of the ACM on …, 2024 - dl.acm.org
Similarity search, the task of identifying objects most similar to a given query object under a
specific metric, has gathered significant attention due to its practical applications. However …

[PDF][PDF] BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU

V Karthik, S Khan, S Singh, HV Simhadri… - arxiv preprint arxiv …, 2024 - ssomesh.github.io
The 𝑘-Nearest-Neighbor-Search problem is to find the 𝑘 nearest data points to a given
query point in a multidimensional dataset. As the dimensionality increases, exact search …

An Energy-Efficient In-Memory Accelerator for Graph Construction and Updating

M Chen, C Liu, S Liang, L He, Y Wang… - … on Computer-Aided …, 2024 - ieeexplore.ieee.org
Graph is widely utilized as a key data structure in many applications, such as social network
and recommendation systems. However, many real-world graphs are constructed with large …