{"id":29154441,"url":"https://github.com/matchyc/vector-search-papers","last_synced_at":"2025-07-01T02:34:46.757Z","repository":{"id":213204178,"uuid":"733297122","full_name":"matchyc/vector-search-papers","owner":"matchyc","description":"📚 Awesome papers and technical blogs on vector DB (database), semantic-based vector search or approximate nearest neighbor search (ANN Search, ANNS). Vector search is the key component of large-scale information retrieval, cross-modal retrieval, LLMs-based RAG, vector databases.","archived":false,"fork":false,"pushed_at":"2025-05-21T09:10:51.000Z","size":118,"stargazers_count":98,"open_issues_count":0,"forks_count":12,"subscribers_count":5,"default_branch":"main","last_synced_at":"2025-05-21T10:27:36.059Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/matchyc.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2023-12-19T02:29:38.000Z","updated_at":"2025-05-21T09:10:55.000Z","dependencies_parsed_at":"2024-08-13T03:46:09.202Z","dependency_job_id":"2ff8330c-69d7-42fb-8b12-c8de7b6b712b","html_url":"https://github.com/matchyc/vector-search-papers","commit_stats":null,"previous_names":["matchyc/vector-search-papers"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/matchyc/vector-search-papers","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/matchyc%2Fvector-search-papers","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/matchyc%2Fvector-search-papers/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/matchyc%2Fvector-search-papers/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/matchyc%2Fvector-search-papers/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/matchyc","download_url":"https://codeload.github.com/matchyc/vector-search-papers/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/matchyc%2Fvector-search-papers/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262884174,"owners_count":23379345,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-07-01T02:34:00.951Z","updated_at":"2025-07-01T02:34:46.731Z","avatar_url":"https://github.com/matchyc.png","language":null,"funding_links":[],"categories":["Curated Resource Lists"],"sub_categories":[],"readme":"# Vector Search, Approximate Nearest Neighbor Search Papers\n\n[![License](https://img.shields.io/badge/license-MIT-blue.svg)](LICENSE)\n[![Hits](https://hits.seeyoufarm.com/api/count/incr/badge.svg?url=https%3A%2F%2Fgithub.com%2Fmatchyc%2Fvector-search-papers\u0026count_bg=%2379C83D\u0026title_bg=%23555555\u0026icon=\u0026icon_color=%23E7E7E7\u0026title=hits\u0026edge_flat=false)](https://hits.seeyoufarm.com)\n![maintenance-status](https://img.shields.io/badge/maintenance-actively--developed-brightgreen.svg) [![Generic badge](https://img.shields.io/badge/PRs-welcome-lgihtgreen.svg)](https://shields.io/)\n\n\n\nA curated collection of awesome papers in the field of vector search, known as approximate nearest neighbor search (ANN search, ANNS). This repository aims to gather high-quality research papers, articles, and resources that provide valuable insights and advancements. This technology is a critical component in vector databases, retrieval-augmented generation (RAG), large-scale information retrieval, recommendation systems, drug discovery, image search, and even **LLM inference**.\n\n\u003eI hope everyone interested in vector search can help build the list. We will list the contributors.\n\n## The latest update: 2025-05-21\n\n## Table of Contents\n- [What is vector search and its applications](#what-is-vector-search-and-its-applications)\n- [Papers](#papers)\n- [License](#license)\n\n## What is vector search and its applications\nFirst of all, what is vector search, and why is it so important in the booming age of AI?\n\nsimple explanation:\n\n- [what-is-vector-search](https://www.coveo.com/blog/what-is-vector-search/)\n- [a-gentle-introduction-to-vector-search](https://odsc.medium.com/a-gentle-introduction-to-vector-search-3c0511bc6771)\n- [Explanation in Quora](https://www.quora.com/Could-someone-explain-me-the-basic-idea-of-Approximate-Nearest-Neighbor-ANN-search-and-show-an-example)\n- [k-nn-vs-approximate-nearest-neighbors](https://sefiks.com/2023/07/27/k-nn-vs-approximate-nearest-neighbors/)\n\nApplications:\n\n- [5-use-cases-for-vector-search](https://rockset.com/blog/5-use-cases-for-vector-search/)\n- [Introduction to Vector Search for Developers](https://www.pinecone.io/learn/vector-search-basics/)\n- [Inference of LLMs](https://arxiv.org/abs/2409.10516)\n\n## Papers\n\n| Title | Url | High-Level Category| Remarks|\n| --- | --- | --- | --- |\n|Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes|[Link](https://www.arxiv.org/abs/2408.13899)|Theory||\n|Accelerating Graph Indexing for ANNS on Modern CPUs|[Link](https://arxiv.org/abs/2502.18113)|Graph-based||\n|CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs|[Link](https://ieeexplore.ieee.org/abstract/document/10597683)|GPU||\n|ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms|[Link](https://arxiv.org/abs/2305.04359)|graph-based||\n|SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search|[Link](https://arxiv.org/abs/2411.12229)|Graph-based|optimizing on memory access|\n|RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search|[Link](https://arxiv.org/abs/2408.08933)|graph-based|out-of-distribution|\n| On Efficient Retrieval of Top Similarity Vectors | [Link](https://aclanthology.org/D19-1527.pdf) |MIPS|MIPS for top-1|\n| In-Storage Acceleration of Graph-Traversal-Based Approximate Nearest Neighbor Search | [Link](https://arxiv.org/abs/2312.03141) | NAND-Flash acceleration | Using storage compute |\n| DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queries | [Link](https://arxiv.org/abs/2210.15748) | multi-vector |\n| Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement | [Link](https://arxiv.org/pdf/1610.02455.pdf) | Survey |\n| Graph-based Nearest Neighbor Search: From Practice to Theory | [Link](http://arxiv.org/abs/1907.00845) | Theoretical |\n| FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search | [Link](http://arxiv.org/abs/2206.11408) | Graph-based |\n| HVS: hierarchical graph structure based on Voronoi diagrams for solving approximate nearest neighbor search | [Link](https://dl.acm.org/doi/10.14778/3489496.3489506) | Graph-based |\n| DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node | [Link](https://papers.nips.cc/paper_files/paper/2019/file/09853c7fb1d3f8ee67a61b6bf4a7f8e6-Paper.pdf) | Graph-based | SSD-based |\n| Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs | [Link](https://ieeexplore.ieee.org/document/8594636/) | Graph-based |\n| SONG: Approximate Nearest Neighbor Search on GPU | [Link](https://ieeexplore.ieee.org/document/9101583/) | Graph-based |\n| Graph-based Nearest Neighbor Search: Promises and Failures | [Link](http://arxiv.org/abs/1904.02077) | Graph-based |\n| Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination | [Link](https://dl.acm.org/doi/10.1145/3318464.3380600) | Graph-based |\n| A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search | [Link](http://arxiv.org/abs/2101.12631) | Survey |\n| Fast approximate nearest neighbor search with the navigating spreading-out graph | [Link](https://dl.acm.org/doi/10.14778/3303753.3303754) | Graph-based |\n| Non-metric Similarity Graphs for Maximum Inner Product Search | [Link](https://proceedings.neurips.cc/paper_files/paper/2018/file/229754d7799160502a143a72f6789927-Paper.pdf) | Graph-based |\n| Understanding and Improving Proximity Graph-based Maximum Inner Product Search | [Link](http://arxiv.org/abs/1909.13459) | Graph-based |\n| Learning to Route in Similarity Graphs | [Link](http://arxiv.org/abs/1905.10987) | Graph-based+DeepLearning(GCN) |\n| Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data | [Link](http://arxiv.org/abs/1810.07355) | Graph-based |\n| Fast Approximate Nearest Neighbor Search with a Dynamic Exploration Graph using Continuous Refinement | [Link](http://arxiv.org/abs/2307.10479) | Graph-based |\n| Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases | [Link](https://dl.acm.org/doi/10.1145/3588908) | Graph-based |\n| Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis | [Link](http://arxiv.org/abs/2305.04359) | Graph-based |\n| SPANN: Highly-efficient Billion-scale Approximate Nearest Neighbor Search | [Link](https://arxiv.org/pdf/2111.08566.pdf) | Graph-Tree-based |SSD-based|\n| Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search | [Link](https://www.sciencedirect.com/science/article/pii/S0031320319302730) | Graph-based |\n| Hierarchical Clustering-Based Graphs for Large Scale Approximate Nearest Neighbor Search | [Link](https://linkinghub.elsevier.com/retrieve/pii/S0031320319302730) | Graph-based |\n| Fusion of graph-based indexing and product quantization for ANN search | [Link](https://medium.com/@masajiro.iwasaki/fusion-of-graph-based-indexing-and-product-quantization-for-ann-search-7d1f0336d0d0) | Graph-based |\n| Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces | [Link](https://dl.acm.org/doi/10.14778/3594512.3594527) | Graph-based |\n| Optimization of Indexing Based on k-Nearest Neighbor Graph for Proximity Search in High-dimensional Data | [Link](http://arxiv.org/abs/1810.07355) | Graph-based |\n| Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis | [Link](http://arxiv.org/abs/2305.04359) | Survey |\n| Automating Nearest Neighbor Search Configuration with Constrained Optimization | [Link](https://arxiv.org/pdf/2301.01702.pdf) | Learning |\n| Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendation | [Link](https://dl.acm.org/doi/10.1145/3511808.3557098) | Graph-based |\n| Norm Adjusted Proximity Graph for Fast Inner Product Retrieval | [Link](https://dl.acm.org/doi/10.1145/3447548.3467412) | Graph-based|\n| On Efficient Retrieval of Top Similarity Vectors | [Link](https://aclanthology.org/D19-1527) | Graph-based |\n| SONG: Approximate Nearest Neighbor Search on GPU | [Link](https://ieeexplore.ieee.org/document/9101583) | GPU |\n| RTNN: Accelerating Neighbor Search Using Hardware Ray Tracing | [Link](https://arxiv.org/abs/2201.01366) | GPU |\n| Billion-scale similarity search with GPUs | [Link](https://arxiv.org/abs/1702.08734) | GPU |\n| Fast neural ranking on bipartite graph indices | [Link](https://dl.acm.org/doi/10.14778/3503585.3503589) | Neural Rank |\n| Fast Item Ranking under Neural Network based Measures | [Link](https://dl.acm.org/doi/10.1145/3336191.3371830) | Neural Rank |\n| Non-metric Similarity Graphs for Maximum Inner Product Search | [Link](https://proceedings.neurips.cc/paper_files/paper/2018/hash/229754d7799160502a143a72f6789927-Abstract.html) | MIPS |\n| Möbius Transformation for Fast Inner Product Search on Graph | [Link](https://proceedings.neurips.cc/paper_files/paper/2019/hash/0fd7e4f42a8b4b4ef33394d35212b13e-Abstract.html) | MIPS |\n| Understanding and Improving Proximity Graph-based Maximum Inner Product Search | [Link](http://arxiv.org/abs/1909.13459) | MIPS |\n| Reinforcement Routing on Proximity Graph for Efficient Recommendation | [Link](https://dl.acm.org/doi/10.1145/3512767) | Learning |\n| From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effective | [Link](https://dl.acm.org/doi/10.1145/3477495.3531857) | Learning |\n| Constructing Tree-based Index for Efficient and Effective Dense Retrieval | [Link](https://dl.acm.org/doi/10.1145/3539618.3591651) | Learning |\n| Reverse Maximum Inner Product Search: Formulation, Algorithms, and Analysis | [Link](https://dl.acm.org/doi/10.1145/3587215) | MIPS |\n| FARGO: Fast Maximum Inner Product Search via Global Multi-Probing | [Link](https://dl.acm.org/doi/10.14778/3579075.3579084) | LSH |\n| SRS: solving \u003ci\u003ec\u003c/i\u003e -approximate nearest neighbor queries in high dimensional Euclidean space with a tiny index | [Link](https://dl.acm.org/doi/10.14778/2735461.2735462) | LSH |\n| From Distillation to Hard Negative Sampling: Making Sparse Neural IR Models More Effective | [Link](https://dl.acm.org/doi/10.1145/3477495.3531857) | LSH |\n| LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index | [Link](https://doi.org/10.1145/2882903.2882930) | LSH |\n| HD-index: pushing the scalability-accuracy boundary for approximate kNN search in high-dimensional spaces | [Link](https://dl.acm.org/doi/10.14778/3204028.3204034) | LSH |\n| Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search | [Link](http://arxiv.org/abs/2206.01382) | LSH |\n| Deep Semantic-Preserving Ordinal Hashing for Cross-Modal Similarity Search | [Link](https://ieeexplore.ieee.org/document/8478207) | LSH |\n| Supervised Hierarchical Deep Hashing for Cross-Modal Retrieval | [Link](https://dl.acm.org/doi/10.1145/3394171.3413962) | LSH |\n| A Revisit of Hashing Algorithms for Approximate Nearest Neighbor Search | [Link](http://arxiv.org/abs/1612.07545) | Survey |\n| Transformer Memory as a Differentiable Search Index | [Link](https://arxiv.org/abs/2202.06991) | Model-as-Index |\n| Recommender Systems with Generative Retrieval | [Link](https://arxiv.org/abs/2305.05065) | Model-as-Index |\n| SPREADING VECTORS FOR SIMILARITY SEARCH | [Link](https://arxiv.org/abs/1806.03198) | Learning + Dimensionality Reduction |\n|Model-enhanced Vector Index|[Link](https://arxiv.org/abs/2309.13335)| Fusion Retrieval|\n|GraSP: Optimizing Graph-based Nearest Neighbor Search with Subgraph Sampling and Pruning|[Link](https://dl.acm.org/doi/abs/10.1145/3488560.3498425)| Prune edges with learning |\n|Low-Precision Quantization for Efficient Nearest Neighbor Search| [Link](https://arxiv.org/pdf/2110.08919.pdf) |scalar quantization |\n|Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations | [Link](https://arxiv.org/abs/2310.19126) | Graph-based |\n| Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits | [Link](https://arxiv.org/abs/2405.18680v3) | Theoretical |\n\n\nPlease note that some entries may require access or membership to view the full content.\n\n\n\n## How to Contribute\n\nWe welcome contributions to expand and improve this collection. If you have any papers or resources that you believe should be included, please follow these guidelines:\n\n1. Fork the repository.\n2. Add your paper/resource to the appropriate category or create a new category if needed.\n3. Include a link to the paper/resource (if available) or any relevant information.\n4. Submit a pull request.\n\n\n## License\n\nMIT license.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmatchyc%2Fvector-search-papers","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmatchyc%2Fvector-search-papers","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmatchyc%2Fvector-search-papers/lists"}