Understanding IVF Vector Index: How It Works and When to Choose It Over HNSW
Oct 27, 2025Jack Li

Summary
This post provides a deep dive into the Inverted File (IVF) vector index, a core component for Approximate Nearest Neighbor (ANN) search in vector databases. It explains the IVF index's architecture, including clustering, centroids, and inverted lists. It details the index building process involving K-means clustering, vector assignment, and optional compression techniques like Scalar Quantization (SQ8) and Product Quantization (PQ). The post also outlines the search process, emphasizing the role of nprobe in balancing recall and latency. Practical advice is given on choosing nlist and tuning nprobe for different scales and performance requirements, along with a comparison of IVF variants (IVF_FLAT, IVF_PQ, IVF_SQ8).
More from the AI Data Storage Engine trail
- Milvus Snapshots: Point-in-Time Collection Views Without Copying Data
- Announcing Milvus 3.0: Lake-Native Vector Search and a More Powerful Retrieval Engine
- How to Recover Milvus Data After etcd Corruption Without a Backup
- Open Tag: An Open-Source Claude Tag for Claude Code and Codex
- How Force Merge Compaction Nearly Doubled Milvus Search QPS