Lock-based protocols in DBMS Theory - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to acquire a shared lock on a data item.

DBMS Theory

lock.acquire([1]);

Drag options to blanks, or click blank then click option'

AX

BS

CU

DR

Attempts:

3 left

💡 Hint

Common Mistakes

Using exclusive lock 'X' when only reading is needed.

Using undefined lock types like 'R'.

In lock-based protocols, S stands for a shared lock, which allows multiple transactions to read a data item concurrently.

2fill in blank

medium

Complete the code to release a lock on a data item.

DBMS Theory

lock.[1]();

Drag options to blanks, or click blank then click option'

Await

Bhold

Cacquire

Drelease

Attempts:

3 left

💡 Hint

Common Mistakes

Using 'acquire' instead of 'release' to free a lock.

Using 'wait' which causes the transaction to pause.

The release method frees the lock held on a data item so other transactions can access it.

3fill in blank

hard

Fix the error in the code to check if a lock is compatible with a shared lock.

DBMS Theory

if (lock.type == '[1]') { allowRead(); }

Drag options to blanks, or click blank then click option'

AS

BX

CU

DN

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing exclusive lock 'X' with shared lock 'S'.

Using undefined lock types like 'N'.

Shared locks (S) are compatible with other shared locks, allowing concurrent reads.

4fill in blank

hard

Fill both blanks to implement strict two-phase locking protocol.

DBMS Theory

beginTransaction();
acquireLock([1]);
// perform operations
[2]();
commitTransaction();

Drag options to blanks, or click blank then click option'

AX

BreleaseLock

CholdLock

DS

Attempts:

3 left

💡 Hint

Common Mistakes

Releasing locks before commit breaks strict 2PL.

Using shared lock 'S' for write operations.

Strict 2PL requires acquiring an exclusive lock (X) and releasing it only at commit time using releaseLock.

5fill in blank

hard

Fill all three blanks to create a lock table entry for a transaction.

DBMS Theory

lockTable[[1]] = { type: [2], owner: [3] };

Drag options to blanks, or click blank then click option'

AdataItem

BlockType

CtransactionId

DlockOwner

Attempts:

3 left

💡 Hint

Common Mistakes

Confusing owner with data item.

Using incorrect keys in the lock table.

A lock table entry maps a dataItem to its lockType and the transactionId that owns the lock.

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