A lock that allows multiple transactions to read but not update is:

A system that collects data and processes it at a later time is referred to as:

A situation where transactions wait indefinitely for each other is called:

The ACID property that ensures data remains after commit is:

A transaction reads data that has not yet been committed by another transaction. This represents:

A system that allows users to perform transactions interactively and updates the database continuously represents:

A transaction follows a protocol where it acquires all locks before releasing any. This refers to:

A system uses transaction logs to reapply committed changes after a crash. This operation is known as:

A transaction reads the same data twice and gets different values due to another transaction’s update. This represents:

Two transactions update the same record. The final value only reflects one update while the other is lost. This scenario illustrates:

A transaction is updating a record while another transaction is denied access until the first finishes. This situation uses:

A stock trading platform requires immediate processing of transactions to ensure accurate and up-to-date data at every second. This system is best categorized as:

A database ensures that once a transaction is committed, its changes will not be lost even after failure. This demonstrates:

Transaction T1 holds resource A and waits for B, while T2 holds B and waits for A. The system becomes stuck. This scenario represents: