A Day in the Life of a Milvus Datum
Mar 17, 2025Stefan Webb, Anthony Tu

Summary
This post provides a detailed walkthrough of the internal data flow for insert and search operations in Milvus. It elaborates on the lifecycle of a datum from insertion through proxy nodes and message queues to data nodes, segments, and chunks in persistent storage. It also describes the processes of segment sealing, merging, compaction, and index building by index nodes, and how query nodes retrieve and process data for search. The key takeaway is the separation of concerns across node types and the separation of storage and compute, enabling independent scaling.
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