ResearchTrend.AI
ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms

Magdalen Dobson Manohar
Zheqi Shen
G. Blelloch
Laxman Dhulipala
Yan Gu
H. Simhadri
Yihan Sun
    GNN
ArXivPDFHTML

Papers citing "ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms"

3 / 3 papers shown
Title
Cost-Effective, Low Latency Vector Search with Azure Cosmos DB
Cost-Effective, Low Latency Vector Search with Azure Cosmos DB
Nitish Upreti
Krishnan Sundaram
Hari Sudan Sundar
Samer Boshra
Balachandar Perumalswamy
...
Kevin Pilch
Simon Moreno
Aayush Kataria
Vipul Vishal
H. Simhadri
31
0
0
09 May 2025
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
Many Sequential Iterative Algorithms Can Be Parallel and (Nearly) Work-efficient
Zheqi Shen
Zijin Wan
Yan Gu
Yihan Sun
34
12
0
25 May 2022
Speed-ANN: Low-Latency and High-Accuracy Nearest Neighbor Search via Intra-Query Parallelism
Speed-ANN: Low-Latency and High-Accuracy Nearest Neighbor Search via Intra-Query Parallelism
Zhen Peng
Minjia Zhang
Kai Li
R. Jin
Bin Ren
50
2
0
31 Jan 2022