The answer is to use a stateful ParDo with an external cache like Cloud Bigtable for per-element lookups. This is correct because broadcasting a large side input into every worker’s memory causes OOM errors and increased latency, as the entire dataset is loaded per worker; offloading the lookup data to an external, scalable cache eliminates memory pressure and allows efficient point reads without storing the full dataset locally. On the Google Professional Data Engineer exam, this scenario tests your understanding of when to avoid side input broadcast for large, slowly-changing reference data—a common trap is assuming that a side input refresh mechanism alone solves the memory issue, but the real bottleneck is the in-memory footprint. Remember the key distinction: side inputs are for small, frequently accessed datasets; for large lookups, think “external cache, not broadcast.” A useful memory tip is “Big side, Bigtable”—when the side input is too large for memory, push it to an external store.
PDE Designing data processing systems Practice Question
This PDE practice question tests your understanding of designing data processing systems. Read the scenario carefully and evaluate each option against the stated constraints before committing to an answer. After answering, compare your reasoning against the explanation and wrong-answer breakdown below. Once you have made your selection, read the full explanation to reinforce the concept and understand why each distractor is designed to mislead on exam day.
A Dataflow streaming pipeline reads from Pub/Sub, applies a ParDo that uses a side input from a BigQuery table (refreshed hourly), and writes to BigQuery. The side input is large and causes increased latency and worker OOM errors. Which design change solves this?
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Use a stateful ParDo and store the lookup data in an external cache like Cloud Bigtable, performing lookups per element.
Option A is correct because moving the large lookup data to an external cache like Cloud Bigtable offloads memory pressure from workers, eliminating OOM errors. The side input broadcast approach keeps the entire dataset in each worker's memory, which causes OOM when the data is large. Using an external cache allows per-element lookups without storing the entire dataset in memory, reducing latency by avoiding broadcast overhead.
Key principle: Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Answer analysis
Option-by-option breakdown
For each option: why learners choose it and why it is or isn't the right answer here.
✓
Use a stateful ParDo and store the lookup data in an external cache like Cloud Bigtable, performing lookups per element.
Why this is correct
External cache reduces per-worker memory footprint and scales well.
Related concept
Read the scenario before looking for a memorised answer.
✗
Increase the side input broadcast frequency to update more often.
Why it's wrong here
More frequent updates increase memory pressure.
✗
Split the pipeline into two: one to load the side input, the other to process main input.
Why it's wrong here
This doesn't solve memory issue; side input still needs to be held in memory.
✗
Use smaller worker machine types to distribute memory across more workers.
Why it's wrong here
Smaller workers have less memory; OOM may still occur.
Common exam traps
Common exam trap: answer the scenario, not the keyword
Google Cloud often tests the misconception that increasing resources (like worker size or frequency) solves memory issues, when the real solution is to avoid storing large datasets in memory altogether by using an external lookup service.
Detailed technical explanation
How to think about this question
Under the hood, Apache Beam's side input broadcast uses a 'side input' PCollection that is materialized into a persistent data structure (e.g., a map) and distributed to all workers via the shuffle or broadcast join mechanism. For large datasets, this consumes significant heap memory and can trigger OOM. An external cache like Cloud Bigtable provides a distributed, scalable key-value store that supports high-throughput lookups with low latency, and it can be accessed from a ParDo using a DoFn that creates a Bigtable client per worker, caching connections rather than data. In real-world scenarios, this pattern is common for enrichment pipelines where the lookup table is too large for broadcast but still requires real-time access.
KKey Concepts to Remember
Read the scenario before looking for a memorised answer.
Find the constraint that changes the correct option.
Eliminate answers that are true in general but not in this case.
TExam Day Tips
→Watch for words such as best, first, most likely and least administrative effort.
→Review why wrong options are wrong, not only why the correct option is correct.
Key takeaway
Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option.
Real-world example
How this comes up in practice
A cloud solutions architect for a retail company is evaluating services for a new workload. The correct answer here reflects best practice for the specific scenario described — not a general cloud recommendation. Answer the scenario, not the keyword: identify the specific constraint before choosing the most familiar-sounding option. Cloud exam questions reward reading the constraint carefully: the same technology can be right or wrong depending on the use case.
What to study next
Got this wrong? Here's your next step.
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
Designing data processing systems — This question tests Designing data processing systems — Read the scenario before looking for a memorised answer..
What is the correct answer to this question?
The correct answer is: Use a stateful ParDo and store the lookup data in an external cache like Cloud Bigtable, performing lookups per element. — Option A is correct because moving the large lookup data to an external cache like Cloud Bigtable offloads memory pressure from workers, eliminating OOM errors. The side input broadcast approach keeps the entire dataset in each worker's memory, which causes OOM when the data is large. Using an external cache allows per-element lookups without storing the entire dataset in memory, reducing latency by avoiding broadcast overhead.
What should I do if I get this PDE question wrong?
Identify which exam domain this question belongs to, review the core concept, then practise similar questions from the same domain.
What is the key concept behind this question?
Read the scenario before looking for a memorised answer.
About these practice questions
Courseiva creates original exam-style practice questions with explanations and wrong-answer analysis. It does not publish real exam questions, exam dumps, or protected exam content. Learn why practice questions differ from exam dumps →
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
This PDE 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 PDE exam.
Question Discussion
Share a tip, memory trick, or ask about the reasoning behind this question. Do not post real exam questions, leaked content, braindumps, or copyrighted exam material. Comments are moderated and may be removed without notice.
Sign in to join the discussion.