Transaction States
A transaction enters this state immediately after it starts.
Active State
Transactions execute one after another in this schedule.
Serial Schedule
This lock permits multiple transactions to read an item.
Shared Lock
This method locks databases, tables, pages and rows.
Multiple Granularity
This failure affects only one transaction.
Transaction Failure
This state occurs after the final statement is executed.
Partially Committed State
This graph is used to test conflict serializability.
Precedence Graph
This lock is required before updating a data item.
Exclusive Lock
This lock shows a plan to take shared locks below
Intention Shared Lock
This storage loses data when power is switched off.
Volatile Storage
A transaction enters this state when it cannot continue.
Failed State
An acyclic precedence graph indicates this property.
Conflict Serializability
This protocol has growing and shrinking lock phases.
Two-Phase Locking
This graph represents transactions waiting for locks.
Wait-For Graph
This rule writes the log before the database page.
Write-Ahead Logging
This ACID property makes a transaction all-or-nothing.
Atomicity
Here, a reader commits only after the writer commits.
Recoverable Schedule
This protocol orders transactions using timestamps.
Timestamp-Based Protocol
A cycle in a wait-for graph indicates this condition.
Deadlock
These operations restore data after system failure.
Undo and Redo
This ACID property preserves data after transaction commit.
Durability
This schedule prevents reading uncommitted data
Strict Schedule
this protocol checks conflicts before the write phase.
Validation-Based Protocol
In this scheme, an older transaction aborts a younger one.
Wound-Wait Scheme
This recovery marker reduces the amount of log scanning.
Checkpoint