easyMultiple Choice
Generative AI Leader Practice Question: The key advantage of using vector search for…
What is the key advantage of using vector search for retrieval in a RAG system compared to keyword search?
⚠ Common exam trap
A common misconception tested in this exam is that vector search is faster than keyword search, but the trap is that while vector search excels at semantic matching, it incurs higher latency and computational overhead compared to the simple inverted index lookup of keyword search.
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
✓
Vector search can find conceptually similar documents even without exact keyword matches
Vector search in a RAG system encodes documents and queries into dense vector embeddings using a foundation model, then retrieves documents based on semantic similarity in the embedding space. This allows it to find conceptually related documents even when they share no exact keywords with the query, overcoming the lexical gap that limits keyword search.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
- ✗
Vector search eliminates the need for a foundation model
Why it's wrong here
Vector search supplies retrieved context; the foundation model still generates the answer, so it cannot remove that dependency. It is tempting because embeddings and the generator are separate components, yet the actual advantage is retrieving semantically similar passages that share no keywords with the query.
- ✓
Vector search can find conceptually similar documents even without exact keyword matches
Why this is correct
Vector search embeds queries and documents into a shared space and retrieves by embedding proximity, so semantically related passages surface even when wording differs. Keyword search matches literal terms only, failing the stem's need to find conceptually similar documents without exact keyword overlap.
- ✗
Vector search is faster than keyword search
Why it's wrong here
Latency depends on index size, dimensionality and infrastructure, so vector search is not inherently quicker; approximate nearest-neighbour search can even be slower. It is tempting because embeddings are precomputed, but the genuine advantage is semantic similarity matching rather than literal keyword overlap.
- ✗
Vector search requires no preprocessing of documents
Why it's wrong here
Vector search still requires chunking, embedding and index construction, so it does not avoid preprocessing; keyword search arguably needs less. It is tempting because embeddings spare manual synonym lists, but the advantage sought is semantic matching of meaning rather than literal term overlap.
Go deeper
Related to this question
About these practice questions
This Generative AI Leader question is part of Courseiva's 1,008-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 Generative AI Leader practice question is part of Courseiva's free Google Cloud 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 Generative AI Leader exam.