08How does approximate nearest-neighbor search work, and how do you choose a vector index (HNSW vs IVF)?▼medium★ EssentialGleanCohereDatabricks2 repliesunlockedEvery RAG system rests on a vector index, and the interviewer wants proof you grasp the recall/latency/memory tradeoff, not just 'use a vector DB.' The signal is why exact search will not scale and how HNSW and IVF place different bets.Open full answer →
49Your vector index won't fit in RAM at a billion vectors. How do you choose between HNSW, IVF-PQ, and disk-based ANN?▼hardGleanPineconeAWS1 replies◆ premiumAt a billion vectors the index choice is a memory budget question before it's a recall question. Flat search is off the table, HNSW may not fit, and PQ swaps recall for RAM. Here is the call a staff engineer makes on the whiteboard.Open full answer →
68How do you do incremental indexing for a RAG system with constant document churn, without a nightly full rebuild?▼hardGleanDatabricksMicrosoft1 replies◆ premiumRe-embedding 10M documents nightly is wasteful when only 0.5% changed. Interviewers want to see you upsert by stable id, handle deletes and tombstones in an ANN index, and compact before fragmentation tanks recall and latency.Open full answer →
88How does metadata filtering work in a vector database, and why can a selective filter destroy your recall?▼hardPineconeWeaviateDatabricks◆ premiumEvery RAG design says 'just filter by tenant_id.' Almost nobody can explain why that one line can quietly cut recall in half. The answer is in what the filter does to the ANN graph.Open full answer →