Deadlock concept and prevention in SQL - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a deadlock in a database system?

A deadlock happens when two or more transactions wait forever for each other to release locks, so none can proceed.

beginner

Name one common cause of deadlocks.

Deadlocks often occur when transactions lock resources in different orders, causing a cycle of waiting.

intermediate

How can deadlocks be prevented by ordering resource access?

By always locking resources in the same order, transactions avoid circular waiting and prevent deadlocks.

intermediate

What is the role of a deadlock detection algorithm?

It finds deadlocks when they happen and helps the system choose a transaction to roll back to break the deadlock.

intermediate

Explain how setting a lock timeout helps prevent deadlocks.

If a transaction waits too long for a lock, it times out and rolls back, preventing indefinite waiting and deadlocks.

What causes a deadlock in a database?

A A transaction committing changes

B A transaction reading data without locks

C Two transactions waiting on each other's locked resources

D A database backup running

Deadlocks occur when transactions wait on each other's locked resources, causing a cycle.

Which method helps prevent deadlocks?

A Locking resources in random order

B Running multiple transactions simultaneously without locks

C Ignoring locks

D Locking resources in a consistent order

Locking resources in the same order avoids circular waiting and prevents deadlocks.

What does a deadlock detection algorithm do?

A Detects deadlocks and rolls back one transaction

B Automatically commits all transactions

C Prevents all locks from being acquired

D Deletes database tables

It detects deadlocks and chooses a transaction to roll back to break the deadlock.

How does a lock timeout help with deadlocks?

A It lets transactions wait forever

B It rolls back transactions that wait too long for locks

C It disables locking

D It speeds up transactions

Lock timeout rolls back transactions waiting too long, preventing deadlocks.

Which of these is NOT a deadlock prevention technique?

A Ignoring transaction isolation

B Using lock timeouts

C Ordering resource locks consistently

D Detecting and rolling back deadlocks

Ignoring transaction isolation can cause data problems and does not prevent deadlocks.

Describe what a deadlock is and why it happens in databases.

Think about two people blocking each other's way.

Explain three ways to prevent or handle deadlocks in a database system.

Consider how to avoid waiting cycles or how to break them.

Practice

1. What is a deadlock in a database system?

easy

A. A backup process that locks the entire database

B. A syntax error in SQL queries causing failure

C. A method to speed up query execution

D. A situation where two or more transactions wait indefinitely for each other to release locks

Solution

1. Step 1: Understand transaction locking

   Transactions lock resources to maintain data integrity during operations.

2. Step 2: Identify deadlock condition

   Deadlock occurs when transactions wait on each other's locked resources indefinitely, causing a standstill.

3. Final Answer:

   A situation where two or more transactions wait indefinitely for each other to release locks -> Option D

4. Quick Check:

   Deadlock = Transactions waiting forever [OK]

Hint: Deadlock means waiting forever for each other's locked resource [OK]

Common Mistakes:

• Confusing deadlock with syntax errors
• Thinking deadlock speeds up queries
• Assuming deadlock is a backup process

2. Which SQL statement is best to prevent deadlocks by controlling transaction order?

easy

A. Run transactions without COMMIT statements

B. Use SELECT * without WHERE clause

C. Always access tables in the same order in all transactions

D. Use DROP TABLE before INSERT

Solution

1. Step 1: Understand deadlock prevention strategy

   Accessing resources in a consistent order prevents circular waiting among transactions.

2. Step 2: Evaluate options

   Only accessing tables in the same order avoids deadlocks; other options cause errors or do not help.

3. Final Answer:

   Always access tables in the same order in all transactions -> Option C

4. Quick Check:

   Consistent access order = Deadlock prevention [OK]

Hint: Access tables in same order to avoid deadlocks [OK]

Common Mistakes:

• Ignoring transaction commit timing
• Using SELECT * without filters causes performance issues, not deadlocks
• Dropping tables is unrelated to deadlock prevention

3. Consider two transactions:
Transaction 1: LOCK table A; LOCK table B;
Transaction 2: LOCK table B; LOCK table A;
What is the likely outcome?

medium

A. Deadlock occurs because each waits for the other's locked table

B. Transaction 2 commits immediately

C. Transaction 1 fails due to syntax error

D. Both transactions complete successfully without waiting

Solution

1. Step 1: Analyze lock order in transactions

   Transaction 1 locks table A then B; Transaction 2 locks table B then A, creating circular wait.

2. Step 2: Identify deadlock condition

   Each transaction waits for the other's locked resource, causing deadlock.

3. Final Answer:

   Deadlock occurs because each waits for the other's locked table -> Option A

4. Quick Check:

   Opposite lock order = Deadlock [OK]

Hint: Opposite lock order in transactions causes deadlock [OK]

Common Mistakes:

• Assuming transactions run without waiting
• Confusing deadlock with syntax errors
• Thinking one transaction commits immediately

4. You have a deadlock error in your SQL transactions. Which fix will most likely resolve it?

medium

A. Remove all COMMIT statements

B. Change transactions to lock tables in the same order

C. Use SELECT without WHERE clause to avoid locks

D. Increase transaction isolation level to SERIALIZABLE

Solution

1. Step 1: Identify cause of deadlock

   Deadlocks often happen due to inconsistent lock order in transactions.

2. Step 2: Apply fix by ordering locks

   Changing transactions to lock tables in the same order prevents circular waiting and deadlocks.

3. Final Answer:

   Change transactions to lock tables in the same order -> Option B

4. Quick Check:

   Consistent lock order fixes deadlocks [OK]

Hint: Fix deadlocks by ordering locks consistently [OK]

Common Mistakes:

• Removing COMMIT causes longer locks, worsening deadlocks
• SELECT without WHERE does not prevent locks
• Higher isolation can increase deadlocks

5. You want to prevent deadlocks in a system where multiple transactions update two tables, Orders and Customers. Which approach is best?

hard

A. Ensure all transactions update Customers first, then Orders, and keep transactions short

B. Allow transactions to update tables in any order but increase isolation level to SERIALIZABLE

C. Use long transactions with many updates to reduce lock frequency

D. Disable locking to speed up updates

Solution

1. Step 1: Understand deadlock prevention principles

   Accessing resources in the same order and keeping transactions short reduces deadlocks.

2. Step 2: Evaluate options for best practice

   Ensure all transactions update Customers first, then Orders, and keep transactions short enforces consistent order and short transactions, preventing deadlocks effectively.

3. Step 3: Analyze other options

   Allow transactions to update tables in any order but increase isolation level to SERIALIZABLE may increase deadlocks; Use long transactions with many updates to reduce lock frequency lengthens locks; Disable locking to speed up updates is unsafe and invalid.

4. Final Answer:

   Ensure all transactions update Customers first, then Orders, and keep transactions short -> Option A

5. Quick Check:

   Consistent order + short transactions = Deadlock prevention [OK]

Hint: Use same update order and short transactions to prevent deadlocks [OK]

Common Mistakes:

• Increasing isolation level can cause more deadlocks
• Long transactions hold locks longer, increasing deadlock risk
• Disabling locking breaks data integrity