Senior Backend Engineer / Stage 2 · Data
Explain lock waits and break a deadlock
"Already know" meets prerequisites. "Not relevant" removes the topic from your total but leaves what builds on it waiting.
Self-check
- You inspect a recorded deadlock where two transactions update the same two rows in opposite order. Draw the wait graph and propose a consistent acquisition order.
- Evidence to include: Identify the cycle, aborted work and a bounded retry policy. Distinguish deadlock from a long lock wait.
Try it without the material first, then compare. Save your answer in your notes below. Report a problem with this self-check
Learning activities
2 activities- Not done7 min
- Not done6 min