Your team is troubleshooting slow query performance on a dedicated SQL pool in Azure Synapse Analytics. The query uses a hash-distributed fact table with 60 distributions. After reviewing the execution plan, you notice a high number of data moves. Which action would most likely reduce data movement?
Trap 1: Change the distribution type to round-robin.
Round-robin spreads rows evenly but destroys co-location, so every join must shuffle all 60 distributions, increasing data movement. Round-robin suits staging or loading tables with no join keys, not fact tables repeatedly joined on a shared column.
Trap 2: Update statistics on all columns used in joins.
Statistics inform cardinality estimates, not distribution placement; stale stats cause poor plans but cannot eliminate data movement when joined columns are not the distribution key. Updating statistics is the right fix for skewed estimates producing bad join strategies, not for a hash-distributed table whose joins require shuffling.
Trap 3: Increase the number of distributions to 120.
Raising distributions to 120 splits each distribution's rows further, multiplying shuffle operations across more nodes without co-locating join keys. More distributions help when a single distribution exceeds compute capacity, not when joins move data because keys differ from the distribution column.
- A
Change the distribution type to round-robin.
Why it fails: Round-robin spreads rows evenly but destroys co-location, so every join must shuffle all 60 distributions, increasing data movement. Round-robin suits staging or loading tables with no join keys, not fact tables repeatedly joined on a shared column.
- B
Update statistics on all columns used in joins.
Why it fails: Statistics inform cardinality estimates, not distribution placement; stale stats cause poor plans but cannot eliminate data movement when joined columns are not the distribution key. Updating statistics is the right fix for skewed estimates producing bad join strategies, not for a hash-distributed table whose joins require shuffling.
- C
Increase the number of distributions to 120.
Why it fails: Raising distributions to 120 splits each distribution's rows further, multiplying shuffle operations across more nodes without co-locating join keys. More distributions help when a single distribution exceeds compute capacity, not when joins move data because keys differ from the distribution column.
- D
Redistribute the fact table on the join column using hash distribution.
Hash-distributing the fact table on the join column co-locates matching rows in the same distribution, so joins execute locally instead of shuffling data across the 60 distributions. This directly reduces the high data movement identified in the execution plan.