Lock-based protocols in DBMS Theory - Time & Space Complexity

Time Complexity: Lock-based protocols

O(n)

Understanding Time Complexity

Lock-based protocols control access to data in databases to avoid conflicts.

We want to understand how the time to manage locks grows as more transactions run.

Scenario Under Consideration

Analyze the time complexity of the following lock management process.

BEGIN TRANSACTION;
FOR each data item needed {
  ACQUIRE lock on data item;
  READ or WRITE data item;
  RELEASE lock on data item;
}
COMMIT TRANSACTION;

This code shows a transaction acquiring and releasing locks on multiple data items sequentially.

Identify Repeating Operations

Look for repeated actions that affect time.

• Primary operation: Acquiring and releasing locks for each data item.
• How many times: Once per data item accessed in the transaction.

How Execution Grows With Input

As the number of data items accessed grows, the number of lock operations grows too.

Input Size (n)	Approx. Operations
10	About 10 lock acquire and 10 release operations
100	About 100 lock acquire and 100 release operations
1000	About 1000 lock acquire and 1000 release operations

Pattern observation: The total lock operations increase directly with the number of data items accessed.

Final Time Complexity

Time Complexity: O(n)

This means the time to manage locks grows linearly with the number of data items accessed in a transaction.

Common Mistake

[X] Wrong: "Lock management time stays the same no matter how many data items are accessed."

[OK] Correct: Each data item needs its own lock operations, so more items mean more time spent managing locks.

Interview Connect

Understanding how lock operations scale helps you explain database concurrency control clearly and confidently.

Self-Check

What if multiple transactions try to lock the same data items at the same time? How would that affect the time complexity?

Practice

1. What is the main purpose of lock-based protocols in a database management system?

easy

A. To control concurrent access to data and prevent conflicts

B. To speed up database queries by caching results

C. To backup data automatically at regular intervals

D. To encrypt data for security purposes

Solution

1. Step 1: Understand the role of lock-based protocols

   Lock-based protocols manage how multiple users access data simultaneously to avoid conflicts.

2. Step 2: Identify the main goal

   The main goal is to control concurrent access and maintain data consistency.

3. Final Answer:

   To control concurrent access to data and prevent conflicts -> Option A

4. Quick Check:

   Lock-based protocols = control access [OK]

Hint: Locks manage who reads/writes data safely [OK]

Common Mistakes:

• Confusing locking with data backup
• Thinking locks speed up queries
• Mixing locking with encryption

2. Which of the following is the correct syntax to request a shared lock on a data item X in a lock-based protocol?

easy

A. lock_shared(X)

B. lock(X, shared)

C. lock_exclusive(X)

D. lock(X, exclusive)

Solution

1. Step 1: Understand shared lock syntax

   Shared locks allow multiple readers and are usually requested with a 'shared' parameter.

2. Step 2: Identify correct syntax format

   Among options, lock(X, shared) correctly requests a shared lock on X.

3. Final Answer:

   lock(X, shared) -> Option B

4. Quick Check:

   Shared lock syntax = lock(X, shared) [OK]

Hint: Shared lock uses 'shared' keyword in lock call [OK]

Common Mistakes:

• Using exclusive lock syntax for shared lock
• Confusing function names
• Omitting lock type parameter

3. Consider two transactions T1 and T2 accessing data item A. T1 requests a shared lock on A, then T2 requests an exclusive lock on A. What will happen next?

medium

A. Both T1 and T2 will hold locks simultaneously

B. T2 will immediately get the exclusive lock

C. T1 will be aborted due to conflict

D. T2 will wait until T1 releases the shared lock

Solution

1. Step 1: Analyze lock compatibility

   Shared locks allow multiple readers, but exclusive locks require exclusive access.

2. Step 2: Understand lock waiting rules

   T2's exclusive lock request conflicts with T1's shared lock, so T2 must wait until T1 releases the lock.

3. Final Answer:

   T2 will wait until T1 releases the shared lock -> Option D

4. Quick Check:

   Exclusive lock waits for shared lock release [OK]

Hint: Exclusive lock waits if shared lock exists [OK]

Common Mistakes:

• Assuming exclusive lock is granted immediately
• Thinking both locks can coexist
• Believing transaction abort happens automatically

4. A transaction T tries to acquire an exclusive lock on data item B but the system throws a deadlock error. What is the most likely cause?

medium

A. T is waiting for another transaction holding a conflicting lock on B

B. T requested a shared lock instead of exclusive lock

C. T has already released all its locks

D. The data item B does not exist in the database

Solution

1. Step 1: Understand deadlock in locking

   Deadlock occurs when two or more transactions wait indefinitely for locks held by each other.

2. Step 2: Identify cause of deadlock error

   T's exclusive lock request is blocked because another transaction holds a conflicting lock, causing deadlock.

3. Final Answer:

   T is waiting for another transaction holding a conflicting lock on B -> Option A

4. Quick Check:

   Deadlock = waiting on conflicting locks [OK]

Hint: Deadlock means waiting on each other's locks [OK]

Common Mistakes:

• Confusing deadlock with syntax errors
• Assuming deadlock means missing data
• Thinking deadlock occurs if locks are released

5. In a system using strict two-phase locking (2PL), which of the following is true about when locks are released?

hard

A. Locks are released randomly during the transaction

B. Locks are released immediately after each data item is accessed

C. All locks are released only after the transaction commits or aborts

D. Shared locks are released before exclusive locks

Solution

1. Step 1: Understand strict two-phase locking

   Strict 2PL requires holding all locks until the transaction finishes (commit or abort) to ensure serializability.

2. Step 2: Identify lock release timing

   Locks are not released during the transaction but only after it ends, preventing conflicts.

3. Final Answer:

   All locks are released only after the transaction commits or aborts -> Option C

4. Quick Check:

   Strict 2PL releases locks after commit/abort [OK]

Hint: Strict 2PL holds locks until transaction ends [OK]

Common Mistakes:

• Releasing locks too early during transaction
• Confusing strict 2PL with basic locking
• Assuming random lock release