Scaling Writes medium
Transaction A locks Row 1 and wants Row 2. Transaction B locks Row 2 and wants Row 1. Both wait forever. What is this called?
- A Race Condition
- B Timeout
- C Deadlock
- D Livelock
Answer: C. Deadlock
A Deadlock is a cyclic dependency. The database engine usually detects this cycle after a few seconds and forcibly kills one of the transactions to let the other proceed.
One system design question a day, with spaced repetition so the ones you miss come back.
Get the appRelated questions
- What does the 'Atomicity' property in a database transaction guarantee regarding writes?
- Your database is struggling with write traffic. You decide to 'Scale Up' (Vertical Scaling) by buying a bigger server. What is the eventual hard limit of this strategy?
- A developer sets up a 'Fire-and-Forget' write pattern (sending data without waiting for a database confirmation) to speed up the app. What is the major risk?
- Why is inserting 1,000 rows in a single 'Batch' query faster than executing 1,000 separate `INSERT` queries?
- In the Raft consensus algorithm, what mechanism prevents a 'Split Vote' (where no leader gets a majority) from stalling the cluster indefinitely?
- Your 'Logs' table has 10 billion rows and writes are getting slow. You barely access logs older than 1 year. What is the simplest strategy to improve performance?