What Is DiskANN? Billion-Scale Vector Search Explained
Blog post from Couchbase
DiskANN is a graph-based vector search algorithm developed by Microsoft Research, designed to perform efficient approximate nearest neighbor (ANN) searches over large-scale vector datasets using SSDs instead of RAM, thus providing a cost-effective solution for web-scale search. Introduced at NeurIPS 2019, DiskANN utilizes the Vamana algorithm to construct a single-layer directed graph, enabling efficient disk-based traversal, while product quantization (PQ) compresses vectors to reduce in-memory requirements. This technology supports billions of vectors on a single machine with 64GB RAM, achieving high recall and low latency comparable to in-memory solutions, and is particularly advantageous when indexing datasets that exceed 100-200 million vectors or when RAM costs are prohibitive. DiskANN's capabilities are extended by FreshDiskANN, which allows real-time updates without full index rebuilds, making it suitable for dynamic datasets. It is widely implemented in platforms like Couchbase, Azure Cosmos DB, and Microsoft 365, and is ideal for use cases in retrieval-augmented generation (RAG), AI agents, and semantic search, where it reduces infrastructure costs while maintaining performance.
| Trend | Post Mentions | Total Month Mentions | Posts | Companies | MoM |
|---|---|---|---|---|---|
| Vector Search | 10 | 1,895 | 382 | 133 | -16% |
| RAG | 8 | 1,000 | 260 | 106 | -52% |
| Real-time | 5 | 5,601 | 1,340 | 262 | -2% |
| AI Agents | 2 | 6,005 | 1,359 | 264 | +22% |
Use this post, company, and trend context to find content marketing opportunities, perform competitive analysis, or address product feature gaps via the Plushcap MCP server or the Plushcap API.