Question 120
A product search team expects HNSW index tuning to behave like a B-tree index on the same vector column. Which implementation step most directly addresses this requirement?
Explanation
Correct Answer
ANN index structures have specific recall/memory/build tradeoffs unlike ordinary scalar B-trees. Tune a supported vector index strategy against latency and relevance goals. Production-like workload meets cost and recall thresholds after index creation.
Incorrect Answers
Approximate-neighbor graphs have distinct build, memory, latency and recall tradeoffs that scalar-index settings cannot measure.
ANN trades recall for speed; compare with an exact baseline before choosing indexing and query parameters.
Selection must balance recall with response time, resource limits, build costs and the real update pattern.