A Deep Dive into Data Addressing in Storage Systems: From HashMap to HDFS, Kafka, Milvus, and Iceberg
Mar 25, 2026Bill Chen

Summary
This post expands on the AI Data Storage Engine by providing a deep dive into the fundamental principles of data addressing in storage systems. It explains how Milvus, like other systems such as HashMap, HDFS, and Kafka, optimizes data location through computation, caching, and pruning to reduce latency. This provides a foundational understanding of the underlying mechanisms that enable efficient data retrieval in vector databases.
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