Microsoft Fabric Data Engineer Associate DP-700 Practice Question

Rebuilding both large fact tables with HASH distribution on the common join column causes rows that share the key value to be stored on the same distribution. When two hash-distributed tables are collocated on the same key, the engine can perform a shuffle-free local join, eliminating the costly data-movement step and reducing execution time. Result-set caching only helps when identical queries are rerun and does not remove data movement. B-tree indexes are ignored by the distributed query optimizer when it chooses a data-movement strategy. Ordering a clustered columnstore index may aid segment elimination on range predicates, but it has no effect on which compute node each row resides, so it cannot eliminate the shuffle.