Transaction Management
Database Transaction Management and ACID Properties · Also known as: ACID transactions, transaction control
Transaction management is the mechanism by which database systems ensure reliable execution of multiple interdependent operations as atomic units. Formalized by Jim Gray and colleagues in the 1980s, transactions guarantee ACID properties (Atomicity, Consistency, Isolation, Durability) that protect data integrity even in the face of failures and concurrent access.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use transactions for any operation where consistency is critical: financial transfers, order processing, inventory updates, and multi-table modifications. They are essential in systems with concurrent access where race conditions could corrupt data. Assumptions include that systems can tolerate temporary locks on affected rows.
Strengths & limitations
- Guarantees data consistency even during failures or concurrent modifications
- Simplifies application logic by providing atomic operations that cannot be partially successful
- Provides a clear recovery mechanism (rollback) for error handling
- Locks held by transactions can reduce concurrency and throughput
- Deadlocks may occur when transactions lock resources in conflicting orders
- Long-running transactions hold locks for extended periods, impacting performance
Frequently asked
What does ACID stand for and why does it matter?
Atomicity (all-or-nothing), Consistency (valid states), Isolation (concurrent independence), Durability (persistence after commit). ACID guarantees mean applications can rely on data consistency without implementing their own complex consistency logic.
What is the difference between COMMIT and ROLLBACK?
COMMIT makes all changes in the transaction permanent and visible to other users. ROLLBACK undoes all changes, restoring the database to its state before BEGIN. Both end the transaction.
What causes deadlocks and how can I prevent them?
Deadlocks occur when two transactions lock resources in different orders, each waiting for the other. Prevent them by locking resources in consistent order, minimizing transaction duration, and setting deadlock detection timeouts.
How do isolation levels affect transaction behavior?
Isolation levels (READ UNCOMMITTED through SERIALIZABLE) control how much other transactions' changes are visible. Higher isolation prevents anomalies but reduces concurrency. Choose based on your consistency requirements.
Sources
- Gray, J. (1981). The transaction concept: Virtues and limitations. VLDB Endowment, 7(6), 519-539. link ↗
- Papadimitriou, C. H. (1986). The Theory of Database Concurrency Control. Computer Science Press. link ↗
- Garcia-Molina, H., Ullman, J. D., & Widom, J. (2009). Database Systems: The Complete Book (2nd ed.). Pearson Education. link ↗
How to cite this page
ScholarGate. (2026, June 3). Database Transaction Management and ACID Properties. ScholarGate. https://scholargate.app/en/information-systems/transaction-management
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Concurrency ControlInformation Systems↔ compare