Question 480
A join stage unexpectedly shuffles both a multi-terabyte fact and a tiny 1 MB lookup table. What should the engineer verify before declaring success?
Explanation
Correct Answer
This outcome directly verifies the scenario's required behavior: a broadcast hash join can reduce exchange cost when one side is small enough.
Incorrect Answers
Cartesian semantics multiply unrelated pairs.
The large side cannot fit in broadcast memory.
A single shuffle task creates a bottleneck.