DP-203 Design and implement data storage Practice Question
You are migrating a large on-premises SQL Server database to Azure Synapse Analytics. The database includes tables with up to 500 million rows and frequent updates. You need to minimize data movement during the migration while ensuring optimal query performance in the dedicated SQL pool. Which table design strategy should you use?
⚠ Common exam trap
Many candidates assume hash-distributed tables are always the best choice for all tables, overlooking the fact that round-robin tables reduce data movement during migration and that hash distribution should be reserved for large fact tables to avoid skew and unnecessary shuffling.
Answer choices
Why each option matters
Answer the question above first, then reveal the full breakdown to understand why each option is right or wrong.
Correct answer & explanation
✓
Use round-robin tables for staging tables and hash-distributed tables for large fact tables on a key column.
It uses round-robin tables for staging to minimize data movement during the initial load, then hash-distributes large fact tables on a key column to optimize query performance by collocating rows with the same distribution key on the same compute node. This balances the need for fast ingestion with efficient parallel query execution in Azure Synapse Analytics dedicated SQL pools.
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 hash-distributed tables for all tables and clustered columnstore indexes.
Why it's wrong here
Hash distribution on all tables may cause skew and is not necessary for small tables.
- ✗
Use replicated tables for all fact tables and hash-distributed tables for dimension tables.
Why it's wrong here
Replicated tables are not suitable for large fact tables due to storage overhead.
- ✗
Use round-robin tables for all tables to simplify the migration.
Why it's wrong here
Round-robin on large tables degrades join performance.
- ✓
Use round-robin tables for staging tables and hash-distributed tables for large fact tables on a key column.
Why this is correct
Round-robin minimizes data movement; hash distribution optimizes joins.
Go deeper
Related to this question
About these practice questions
Courseiva writes every DP-203 question from scratch — 760 in total, each with an explanation and a wrong-answer breakdown. None are copied from real exams or dumps. Learn why practice questions differ from exam dumps →
JA
Written by Johnson Ajibi, MSc IT Security
Senior Network & Security Engineer · founder of Courseiva
This DP-203 practice question is part of Courseiva's free Microsoft 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 DP-203 exam.