Prepare and test your skills

Prepare and test your skills

Free sample question, answered and explained below. The Professional Data Engineer practice bank has 1,353 more like it. Try 10 free: instant score, no account.
A data engineering team is implementing a Retrieval-Augmented Generation (RAG) system on Google Cloud. They use Vertex AI text embedding models to generate high-dimensional vector embeddings of unstructured technical articles and index them using Vertex AI Vector Search with the Tree-AH algorithm.
During evaluation, the team discovers that while query response latency is extremely low, the index's Approximate Nearest Neighbor (ANN) search recall is insufficient, causing relevant context to be missed during generative AI grounding.
Which configuration change should the team make to improve search recall?
Decreasing the leaf_nodes_to_search_percent configuration parameter lowers the total fraction of leaf clusters explored during an approximate nearest neighbor similarity query.
The workload experienced unacceptable query latency or high CPU utilization, and the team needed to prioritize faster response times over search recall.
In Tree-AH, there is an inverse relationship between query speed and recall. Decreasing the search partition percentage optimizes for speed, which exacerbates recall issues.
Switching the index update method between Stream update and Batch update changes how frequently and through what mechanism newly ingested vector embeddings are synced into the index.
The organization wanted to optimize ingestion costs and pipeline complexity for non-real-time data by processing weekly embedding dumps rather than streaming point-in-time updates.
Index ingestion modality (batch vs. stream) addresses operational data pipeline requirements, whereas recall tuning requires adjusting Tree-AH hyperparameters or re-indexing.
Configuring minReplicaCount and enabling autoscaling scales the serving infrastructure by deploying multiple machine replicas behind the Vertex AI Vector Search Index Endpoint.
The primary problem was endpoint throttling, low throughput, or high tail latency under heavy concurrent user query loads.
Scaling serving replicas scales capacity horizontally, whereas algorithmic tuning parameters like leaf_nodes_to_search_percent govern the mathematical trade-off between search quality and query depth.
Vertex AI Vector Search utilizes the Tree-AH (Tree Asymmetric Hashing) algorithm based on Google's ScaNN library to provide high-speed, scalable Approximate Nearest Neighbor (ANN) search. The leaf_nodes_to_search_percent parameter specifies the percentage of index leaf nodes evaluated during a nearest neighbor query.
leaf_nodes_to_search_percent instructs the search engine to traverse and scan a larger proportion of candidate leaf nodes, directly expanding the candidate search pool.Adjusting leaf_nodes_to_search_percent directly targets the trade-off between recall and latency in Tree-AH indexes. It provides the necessary retrieval precision for generative AI pipelines while retaining the scalability benefits of approximate nearest neighbor indexing.
Answer them yourself and get your score the moment you finish. No account needed.
Full access includes
Keep the momentum going with these hand-picked practice scenarios
Last updated Validated