Cost and speed
HFresh: Memory-Efficient Vector Search
Our short summary of Weaviate’s engineering write-up. The full story, with all the detail, is on their blog.
Read the full write-up on weaviate.io (opens in a new tab)Problem
Users needed fast vector search but had limited memory and large datasets.
Solution
They built HFresh, a disk‑based index that partitions vectors into small on‑disk postings and uses an in‑memory centroid index to limit disk reads, keeping memory low while maintaining high recall.
Want the architecture, code and numbers? They’re in the original post.
Read the full write-up on weaviate.io (opens in a new tab)