Are row locks always better than table locks?
No. Row locks maximise concurrency but cost memory and bookkeeping per lock. A statement touching most of a table is cheaper with one table lock, which is why engines escalate. Choose granularity by how much of the data a transaction really touches.
Answered in
Database Locks Explained: Shared, Exclusive, Update, Key-Range and GranularityWhat each lock mode allows, why update locks exist, how key-range locks stop phantoms, and when row, page or table locks cost you concurrency.
Read the full analysisOther questions this article answers
More system design & architecture questions
- How much spare capacity should a gateway keep?
- Why are bounded queues important for availability?
- Should a load balancer always move requests away from an unhealthy server?
- Can a circuit breaker prevent every cascading failure?
- Why does pagination improve API performance beyond just 'smaller responses'?
- Why is asynchronous logging faster than writing logs synchronously?
- When does caching actually help API performance, and when doesn't it?
- Why does payload compression trade CPU time for network time, and when is that worth it?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design & Architecture beat.