179 questions
No questions match those filters.
Your vector index was built once for a static corpus, b...
This is one of the questions in the full AI/ML interview bank. Pro unlocks all 1789 questions; Premium includes the same bank plus the highest daily Practice limit.
See plansMost approximate nearest-neighbor index structures were designed around a build-once, query-many assumption — an HNSW graph’s layered connectivity or an IVF index’s cluster assignments are expensive to update incrementally, and repeatedly inserting and deleting individual vectors degrades the index’s quality and performance over time in ways a full rebuild doesn’t suffer from.
The practical operating pattern most teams converge on: don’t try to mutate the live index on every single document change. Instead, mark stale or deleted vectors as tombstoned (excluded from results but not immediately physically removed from the structure), and periodically rebuild the index from scratch in the background against the current corpus, swapping it in once ready — similar in spirit to how a search engine handles index refresh. The operational questions this raises — how often to rebuild, how to serve queries against the old index while the new one builds, how to handle sharding and replication during a rebuild — matter as much as the algorithmic choice of index type, and are exactly the kind of thing that gets skipped in a prototype and discovered the hard way in production.