A Memory-Efficient Distributed Algorithm for Approximate Nearest Neighbour Search with Arbitrary Distances

arXiv:2405.13795 · cs.IR, cs.DB · Submitted 2024-05-22 · Read on arXiv

cs.IR, cs.DB

Submitted: 2024-05-22

Updated: 2026-10-22

Terminology

• Clustering — 2× in this paper · explained in 2 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Benchmark — 1× in this paper · explained in 2 episodes
• Curse of Dimensionality — 1× in this paper · explained in 6 episodes
• Parametrizable Distributed Approximate Similarity Search with Clustering — 1× in this paper

Related papers

• The Price of Isolation: Estimating the Ecosystem Cost of Symmetric Two-Sided A/B Testing
• SCAR: Semantic Continuity-Aware Retrieval for Efficient Context Expansion in RAG
• MixLoRA-DSI: Dynamically Expandable Mixture-of-LoRA Experts for Rehearsal-Free Generative Retrieval over Dynamic Corpora
• QProtFuse: Query-Guided Layer Fusion for Retrieval-Augmented Protein Function Prediction
• DualView: Adaptive Local-Global Fusion for Multi-Hop Document Reranking
• How Do LLM-Generated Texts Impact Term-Based Retrieval Models?