AI0-001 AI Infrastructure and Technologies Practice Question
A company is building a recommendation system that uses user embeddings stored in a vector database. The system must retrieve the top 10 most similar items for a given user query. Which vector database feature is MOST critical for this task?
⚠ Common exam trap
CompTIA often tests the misconception that SQL or ACID features are needed for all database tasks, but in vector databases, the critical differentiator is the ANN search algorithm, not traditional relational or transactional capabilities.
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
✓
Approximate nearest neighbor (ANN) search
Approximate nearest neighbor (ANN) search is the most critical feature because it enables the vector database to efficiently find the top-10 most similar items to a user query embedding without scanning the entire dataset. Unlike exact nearest neighbor search, ANN algorithms (e.g., HNSW, IVF) trade a small amount of accuracy for massive performance gains, which is essential for real-time recommendation systems handling millions of high-dimensional vectors.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Built-in data versioning
Why it's wrong here
Data versioning tracks changes to datasets and embeddings over time, supporting reproducibility and rollback rather than query-time similarity ranking. It is tempting because versioning matters when embeddings are regenerated, but the requirement is retrieving the top 10 nearest neighbours, which depends on vector indexing and distance metrics.
- ✗
ACID transaction support
Why it's wrong here
ACID transactions guarantee atomic, consistent writes across records, which matters for concurrent updates but not for similarity ranking. It is tempting because transactional integrity sounds essential for production databases, yet top-10 retrieval depends on vector indexing and distance metrics, not on transactional write semantics.
- ✓
Approximate nearest neighbor (ANN) search
Why this is correct
Approximate nearest neighbour search indexes embeddings so the top 10 most similar items are retrieved without comparing every vector. This satisfies the low-latency similarity requirement, which exact brute-force comparison across a large embedding store cannot meet at scale.
- ✗
SQL query interface
Why it's wrong here
A SQL interface supports structured filtering and joins, not approximate nearest-neighbour ranking over high-dimensional embeddings. It is tempting because SQL is familiar for querying stored data, but top-10 similarity retrieval depends on vector indexing and distance metrics such as cosine or Euclidean search, which SQL alone does not provide.
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 by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
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.