A large fact table joins a genuinely small dimension that fits safely in executor memory. Which optimization may avoid a costly large shuffle?

1. Force a Cartesian product
2. Collect both tables to the driver
3. A broadcast join for the small side
4. Broadcast the entire large fact table blindly