Discover published sets by community

Locks data when a transaction begins to prevent concurrent modifications. Use when high contention is expected.

Assumes multiple transactions can complete without affecting each other, and checks at commit time. Use when read operations are more common than writes.

Guarantees serializability by acquiring all locks before any are released. Use for maintaining transaction consistency.

Algorithm to identify deadlocks. Use when deadlock prevention is not feasible or practical.

Assigns timestamps to ensure transactions are processed in a certain order. Use to avoid serialization anomalies.

Allows transactions to lock resources at various levels of granularity. Use for efficiency when transactions need various types of access to data.

Allows reading only committed data, preventing dirty reads. Use this in databases where reading uncommitted data is not acceptable.