States through which a transaction goes during its lifetime. These are the states which tell about the current state of the Transaction and also tell how we will further do processing we will do on the transactions. These states govern the rules which decide the fate of the transaction whether it will commit or abort.
These are different types of Transaction States :
- Active State –
When the instructions of the transaction is running then the transaction is in active state. If all the read and write operations are performed without any error then it goes to “partially committed state”, if any instruction fails it goes to “failed state”.
- Partially Committed –
After completion of all the read and write operation the changes are made in main memory or local buffer. If the the changes are made permanent on the Data Base then state will change to “committed state” and in case of failure it will go to “failed state”.
- Failed State –
- When any instruction of the transaction fails it goes to “failed state” or if failure occurs in making permanent change of data on Data Base.
- Aborted State –
After having any type of failure the transaction goes from “failed state” to “aborted state” and in before states the changes are only made to local buffer or main memory and hence these changes are deleted or rollback.
- Committed Stage –
It is the stage when the changes are made permanent on the Data Base and transaction is complete and therefore terminated in “terminated state”.
- Terminated State –
If there is any roll back or the transaction come from “committed state” then the system is consistent and ready for new transaction and the old transaction is terminated.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Transaction Isolation Levels in DBMS
- Difference between Secure Socket Layer (SSL) and Secure Electronic Transaction (SET)
- Open Shortest Path First (OSPF) protocol States
- States of a Process in Operating Systems
- Thread States in Operating Systems
- Normal Forms in DBMS
- View Serializability in DBMS Transactions
- Concurrency Control in DBMS
- Conflict Serializability in DBMS
- Recoverability in DBMS
- ACID Properties in DBMS
- DBMS Architecture 2-Level, 3-Level
- Precedence Graph For Testing Conflict Serializability in DBMS
- Thomas Write Rule in DBMS
- Armstrong's Axioms in Functional Dependency in DBMS
- Advantages of DBMS over File system
- Database Recovery Techniques in DBMS
- Deadlock in DBMS
- File Organization in DBMS | Set 2
- Starvation in DBMS
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.