A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search
Approximate nearest neighbor search (ANNS) constitutes an important operation in a
multitude of applications, including recommendation systems, information retrieval, and …
multitude of applications, including recommendation systems, information retrieval, and …
Deep learning for approximate nearest neighbour search: A survey and future directions
Approximate nearest neighbour search (ANNS) in high-dimensional space is an essential
and fundamental operation in many applications from many domains such as multimedia …
and fundamental operation in many applications from many domains such as multimedia …
[图书][B] Neural approaches to conversational information retrieval
A conversational information retrieval (CIR) system is an information retrieval (IR) system
with a conversational interface, which allows users to interact with the system to seek …
with a conversational interface, which allows users to interact with the system to seek …
An efficient and robust framework for approximate nearest neighbor search with attribute constraint
This paper introduces an efficient and robust framework for hybrid query (HQ) processing,
which combines approximate nearest neighbor search (ANNS) with attribute constraint. HQ …
which combines approximate nearest neighbor search (ANNS) with attribute constraint. HQ …
High-dimensional approximate nearest neighbor search: with reliable and efficient distance comparison operations
Approximate K nearest neighbor (AKNN) search in the high-dimensional Euclidean vector
space is a fundamental and challenging problem. We observe that in high-dimensional …
space is a fundamental and challenging problem. We observe that in high-dimensional …
Elpis: Graph-based similarity search for scalable data science
I Azizi, K Echihabi, T Palpanas - Proceedings of the VLDB Endowment, 2023 - dl.acm.org
The recent popularity of learned embeddings has fueled the growth of massive collections of
high-dimensional (high-d) vectors that model complex data. Finding similar vectors in these …
high-dimensional (high-d) vectors that model complex data. Finding similar vectors in these …
Finger: Fast inference for graph-based approximate nearest neighbor search
Approximate K-Nearest Neighbor Search (AKNNS) has now become ubiquitous in modern
applications, such as a fast search procedure with two-tower deep learning models. Graph …
applications, such as a fast search procedure with two-tower deep learning models. Graph …
Efficient approximate nearest neighbor search in multi-dimensional databases
Approximate nearest neighbor (ANN) search is a fundamental search in multi-dimensional
databases, which has numerous real-world applications, such as image retrieval …
databases, which has numerous real-world applications, such as image retrieval …
Scalable Billion-point Approximate Nearest Neighbor Search Using {SmartSSDs}
Approximate nearest neighbor search (ANNS) in high-dimensional vector spaces has
become increasingly crucial in database and machine learning applications. Most previous …
become increasingly crucial in database and machine learning applications. Most previous …
New trends in high-d vector similarity search: al-driven, progressive, and distributed
Similarity search is a core operation of many critical applications, involving massive
collections of high-dimensional (high-d) objects. Objects can be data series, text …
collections of high-dimensional (high-d) objects. Objects can be data series, text …