Question

A ___________ schedule is one where, for each pair of transactions T1 and T2, such that T1 reads a data item previously written by T2, the commit operation of T2 appears before the commit operation of T1.

Answer 1

A conflict-serializable schedule is one where transactions are ordered in such a way that ensures consistency and avoids conflicts, adhering to the ACID properties required in database management systems.

Step-by-step explanation:

The schedule described in the question is known as a conflict-serializable schedule. This type of schedule ensures that if one transaction T1 reads a data item D previously written by another transaction T2, transaction T2's commit operation must occur before the commit operation of transaction T1.

By doing so, the schedule preserves the consistency of the database and avoids potential conflicts that could arise from concurrent transactions.

Conflict-serializability is a fundamental concept in the field of database management systems (DBMS) and is crucial for maintaining the ACID properties—which stand for Atomicity, Consistency, Isolation, and Durability—required for proper transaction processing.