Optimistic concurrency control in DBMS Theory - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

How does optimistic concurrency control handle conflicts?

In optimistic concurrency control, what happens when two transactions try to update the same data at the same time?

A Both transactions proceed without checks and the last one commits, overwriting the first.

B Transactions proceed without locking but validate at commit; if conflict is detected, one transaction is rolled back.

C Transactions lock the data before updating to prevent conflicts.

D Transactions are queued and executed one after another to avoid conflicts.

💡 Hint

Think about how optimistic concurrency control trusts transactions to not conflict but checks before finalizing.

Optimistic concurrency control allows transactions to proceed without locking. At commit time, it checks if data was changed by others. If yes, it rolls back one transaction to avoid conflicts.

📋 Factual

intermediate

Which phase is NOT part of optimistic concurrency control?

Optimistic concurrency control typically involves three phases. Which of the following is NOT one of them?

A Locking phase where data is locked before reading.

B Validation phase where conflicts are checked before commit.

C Write phase where changes are applied to the database.

D Read phase where transactions read data and make changes locally.

💡 Hint

Optimistic concurrency control avoids locking during the transaction.

Optimistic concurrency control does not lock data before reading. It reads and modifies data locally, then validates before writing changes.

🚀 Application

advanced

What is the main advantage of optimistic concurrency control over pessimistic concurrency control?

Consider a system with many users mostly reading data and rarely updating. Why is optimistic concurrency control often preferred here?

A It queues all transactions to run one at a time, ensuring order.

B It guarantees no conflicts will ever happen by locking data early.

C It reduces waiting time by avoiding locks, improving performance when conflicts are rare.

D It automatically merges conflicting updates without rollback.

💡 Hint

Think about how locking affects performance when conflicts are uncommon.

Optimistic concurrency control avoids locking, so transactions don't wait. This is efficient when conflicts are rare, unlike pessimistic control which locks data and can cause delays.

🔍 Analysis

advanced

What happens if validation fails in optimistic concurrency control?

During the validation phase, a transaction detects that the data it read was changed by another transaction. What is the correct outcome?

A The transaction is rolled back and must be retried to avoid inconsistency.

B The transaction proceeds and overwrites the other transaction's changes.

C The transaction waits until the other transaction finishes before committing.

D The system merges both transactions automatically without rollback.

💡 Hint

Consider how data integrity is maintained when conflicts are detected.

If validation fails, the transaction cannot safely commit because data changed. It must roll back and retry to ensure consistency.

❓ Reasoning

expert

Why might optimistic concurrency control cause more rollbacks under high contention?

In a system with many concurrent updates to the same data, why does optimistic concurrency control lead to more transaction rollbacks?

A Because it queues transactions, increasing wait times and rollbacks.

B Because it locks data too aggressively, causing deadlocks and rollbacks.

C Because it merges conflicting updates automatically, causing data loss.

D Because transactions do not lock data, they often conflict and fail validation, causing rollbacks.

💡 Hint

Think about what happens when many transactions try to update the same data without locks.

Without locking, many transactions may read stale data and conflict at validation, causing rollbacks. High contention increases these conflicts.

Practice

1. What is the main assumption behind Optimistic Concurrency Control in databases?

easy

A. Transactions always lock data before accessing it

B. Data is never changed during transaction execution

C. All transactions run sequentially without overlap

D. Conflicts between transactions are rare and can be checked at commit time

Solution

1. Step 1: Understand the optimistic concurrency control concept

   It assumes that conflicts between transactions are rare, so it does not lock data during transaction execution.

2. Step 2: Identify when conflicts are checked

   Conflicts are detected only when a transaction tries to commit, by checking if data was changed by others.

3. Final Answer:

   Conflicts between transactions are rare and can be checked at commit time -> Option D

4. Quick Check:

   Optimistic concurrency control = Conflicts checked at commit [OK]

Hint: Remember: optimistic means 'hope no conflict' [OK]

Common Mistakes:

• Thinking data is locked during the whole transaction
• Assuming conflicts are prevented upfront
• Confusing optimistic with pessimistic locking

2. Which of the following is a typical mechanism used in optimistic concurrency control to detect conflicts?

easy

A. Locking rows before update

B. Using version numbers or timestamps on data

C. Serializing all transactions

D. Blocking reads during writes

Solution

1. Step 1: Identify conflict detection methods in optimistic control

   Optimistic concurrency control uses version numbers or timestamps to detect if data was changed by another transaction.

2. Step 2: Eliminate locking and blocking options

   Locking rows or blocking reads are typical of pessimistic control, not optimistic.

3. Final Answer:

   Using version numbers or timestamps on data -> Option B

4. Quick Check:

   Conflict detection = Version/timestamp check [OK]

Hint: Versions or timestamps track changes without locking [OK]

Common Mistakes:

• Confusing locking with optimistic control
• Thinking transactions are serialized automatically
• Assuming reads are blocked during writes

3. Consider a system using optimistic concurrency control with version numbers. If two users read data with version 5, and both try to update it, what happens when the second user tries to commit?

medium

A. Both commits succeed and overwrite each other

B. The second user's commit succeeds without checks

C. The second user's commit fails due to version mismatch

D. The system locks the data to prevent conflicts

Solution

1. Step 1: Understand version checking in optimistic concurrency

   Each update increments the version number. The first user updates version 5 to 6 successfully.

2. Step 2: Check second user's commit attempt

   The second user still has version 5 but data is now version 6, so commit fails due to version mismatch.

3. Final Answer:

   The second user's commit fails due to version mismatch -> Option C

4. Quick Check:

   Version mismatch causes commit failure [OK]

Hint: Second commit fails if version changed since read [OK]

Common Mistakes:

• Assuming both commits succeed
• Thinking system locks data automatically
• Ignoring version number checks

4. A developer implemented optimistic concurrency control but notices that conflicting updates are not detected. What is the most likely error in their approach?

medium

A. They are not checking version or timestamp before commit

B. They are using pessimistic concurrency control

C. They are serializing all transactions

D. They are locking data before reading

Solution

1. Step 1: Identify key step in optimistic concurrency control

   It requires checking the version or timestamp before committing to detect conflicts.

2. Step 2: Analyze the developer's problem

   If conflicts are not detected, likely the version/timestamp check is missing or incorrect.

3. Final Answer:

   They are not checking version or timestamp before commit -> Option A

4. Quick Check:

   Missing version check = No conflict detection [OK]

Hint: Always check version before commit to detect conflicts [OK]

Common Mistakes:

• Confusing locking with optimistic control
• Assuming serialization detects conflicts
• Mixing optimistic and pessimistic methods

5. In a multi-user database system using optimistic concurrency control, how can the system handle a conflict when two users update the same record simultaneously?

hard

A. Automatically merge changes if possible or reject one update

B. Lock the record to prevent simultaneous updates

C. Allow both updates and overwrite the older one silently

D. Queue the second update until the first finishes

Solution

1. Step 1: Understand conflict resolution in optimistic concurrency

   When conflict is detected, the system can try to merge changes or reject one update to maintain data integrity.

2. Step 2: Compare with other concurrency methods

   Locking or queuing are pessimistic methods, not used in optimistic concurrency control.

3. Final Answer:

   Automatically merge changes if possible or reject one update -> Option A

4. Quick Check:

   Conflict resolution = Merge or reject update [OK]

Hint: Optimistic control resolves conflicts by merge or reject [OK]

Common Mistakes:

• Thinking locking is used in optimistic control
• Assuming silent overwrites happen
• Confusing queuing with optimistic concurrency