AI0-001 AI Infrastructure and Technologies Practice Question
An AI platform team is building a retrieval-augmented generation service over an internal knowledge base of roughly 40 million technical documents. Queries must return semantically relevant passages in under 50 ms at the vector search layer. The team wants approximate nearest neighbor search that supports metadata filtering on fields such as product line and document date, and they want to avoid a separate relational database for those filters. Which vector index type best matches these requirements?
⚠ Common exam trap
The trap here is treating metadata filtering as something applied after vector search, when post-filtering at this scale can silently drop most candidates and destroy recall.
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
HNSW index with payload filtering
The combination of tens of millions of vectors, a strict latency ceiling, and integrated metadata filtering points to a graph-based approximate index with payload filtering. HNSW's layered graph gives logarithmic-style search with high recall, and payload filtering lets the engine apply product-line and date constraints during traversal rather than post-filtering, which would otherwise shrink the candidate pool and hurt recall.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✓
HNSW index with payload filtering
Why this is correct
HNSW builds a hierarchical navigable small-world graph that delivers high recall at very low latency on tens of millions of vectors, and modern engines support payload or metadata filtering combined with the graph traversal. That satisfies both the sub-50 ms semantic search target and the product-line and date constraints without adding a separate relational store for filters.
- ✗
Flat (brute-force) index
Why it's wrong here
A flat index compares the query vector against every stored vector and returns exact nearest neighbors. With 40 million embeddings this scan cannot reliably meet a 50 ms budget, and it offers no native metadata filtering, so the team would still need an external database. Exactness is its appeal, but the latency and filtering requirements rule it out for this scale.
- ✗
Product quantization index without a graph
Why it's wrong here
Product quantization compresses vectors into short codes, cutting memory dramatically, but searching those codes alone yields lower recall and a full scan of codes is still slower than a graph traversal. It also does not provide integrated metadata filtering. Compression helps memory footprint, yet this scenario prioritizes latency and filtered accuracy, which the compressed-only approach does not guarantee.
- ✗
Inverted file index with a very large nlist
Why it's wrong here
An IVF index clusters vectors and searches only the nearest cells, which speeds things up, but increasing nlist past a point leaves too few vectors per cell and hurts recall unless many cells are probed, eroding the latency gain. Metadata filtering is not integral to the cell assignment, so the date and product-line constraints still need separate handling.
About these practice questions
This AI0-001 question is part of Courseiva's 962-question bank — original exam-style content with full explanations and wrong-answer analysis, never real exam questions or exam dumps. Learn why practice questions differ from exam dumps →
JA
Written and reviewed by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
Last reviewed September 2026 · checked against the official CompTIA exam blueprint
This AI0-001 practice question is part of Courseiva's free CompTIA certification practice question bank. Courseiva provides original exam-style practice questions with explanations, topic-based practice, mock exams, readiness tracking, and study analytics to help learners prepare for the AI0-001 exam.