Computer Sciences > GATE 2026 SET-2 > Database Management System
Consider concurrent execution of two transactions T1 and T2 in a DBMS, both of which access a data object A. For these two transactions to not conflict on A, which one of the following statements must be true?
A
Both T1 and T2 only read A
B
T1 reads A and T2 writes A
C
T1 writes A and T2 reads A
D
Both T1 and T2 write A

Correct : a

The correct answer is Option A — Both T1 and T2 only read A.
In database concurrency control, two operations from different transactions on the same data object are said to conflict if and only if at least one of the operations is a Write. This gives three conflicting pairs and one non-conflicting pair on any shared data item A.
The three conflicting pairs are: Read-Write (one transaction reads while the other writes), Write-Read (one writes while the other reads), and Write-Write (both transactions write). In all these cases, the order of execution can affect the final outcome or the value read, which is why they conflict.
The only non-conflicting pair is Read-Read — when both transactions only read A, neither modifies it, so the order of their execution has no effect on the database state or on what either transaction reads. This is Option A.
Option B (T1 reads, T2 writes): A Read-Write conflict — the value T1 reads depends on whether T2''s write happens before or after. Conflict exists. Incorrect.
Option C (T1 writes, T2 reads): A Write-Read conflict — the value T2 reads depends on whether T1''s write has already occurred. Conflict exists. Incorrect.
Option D (Both write): A Write-Write conflict — the final value of A depends on which write happens last. Conflict exists. Incorrect.
The fundamental rule to remember: two reads never conflict; any operation involving a write can conflict with any other operation on the same data item.

Similar Questions

In a database system, unique time stamps are assigned to each transaction using Lamport’s logical clock. Let TS(T1) and TS(T2) be the time stamps of transaction...
#176 MCQ
In the context of DBMS, consider the two sets T and S given below. Which one of the following is the correct match from T to S?
#1560 MCQ
In the context of schema normalization in relational DBMS, consider a set F of functional dependencies. The set of all functional dependencies implied by F is...
#1587 MCQ

Related Topics

DBMS transaction conflict GATE 2026 GATE CS 2026 Set-2 Q20 read write conflict DBMS GATE concurrent transactions GATE 2026 non-conflicting operations DBMS GATE read-read no conflict GATE transaction concurrency GATE CSE 2026

Unique Visitor Count

Total Unique Visitors

Loading......