<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>DiskANN – M365.FM</title><link>https://www.m365.fm/entity/diskann/</link><description>DiskANN is a graph-based approximate nearest neighbor search algorithm from Microsoft Research that keeps a compressed navigation layer in RAM and the full-precision graph on SSD. It is used in services such as Azure Cosmos DB and SQL Server vector search.</description><language>en</language><item><title>Conquering the Billion-Vector Problem in Azure AI Search</title><link>https://www.m365.fm/community/u/mirko-p/blog/conquering-the-billion-vector-problem-in-azure-ai-search/</link><guid>https://www.m365.fm/community/u/mirko-p/blog/conquering-the-billion-vector-problem-in-azure-ai-search/</guid><pubDate>Wed, 26 Aug 2026 15:52:25 -0000</pubDate><category>article</category><description>Welcome to our deep dive into one of the most pressing challenges in modern enterprise artificial intelligence: scaling vector search to billions of records. If you…</description></item><item><title>Solving the Billion-Vector Problem in Azure AI Search</title><link>https://www.m365.fm/community/u/mirko-p/blog/solving-the-billion-vector-problem-in-azure-ai-search/</link><guid>https://www.m365.fm/community/u/mirko-p/blog/solving-the-billion-vector-problem-in-azure-ai-search/</guid><pubDate>Wed, 26 Aug 2026 09:52:17 -0000</pubDate><category>article</category><description>Explore the unique technical challenges of searching massive datasets at scale. This post breaks down how high dimensionality and memory constraints impact enterpri…</description></item><item><title>HNSW vs DiskANN for Vector Search in Azure AI Search</title><link>https://www.m365.fm/show/episodes/the-billion-vector-problem-hnsw-vs-diskann-in-azure-ai-search/</link><guid>https://www.m365.fm/show/episodes/the-billion-vector-problem-hnsw-vs-diskann-in-azure-ai-search/</guid><pubDate>Mon, 08 Jun 2026 00:00:00 -0000</pubDate><category>episode</category><description>The explosion of AI-powered applications has created a new challenge: how do you efficiently search through billions of vector embeddings without exploding infrastructure costs? In this episode, we explore the “billion-vector problem” and compare two leading…</description></item></channel></rss>