Can someone give a rather easy (although not simpler than possible) explanation of the transaction as put on computing (even when replicated from Wikipedia)?

A transaction is really a unit of labor that you would like to deal with as "an entireInch. It needs to either take place in full, or otherwise whatsoever.

A classical example is moving money in one banking account to a different. To complete you need to first withdraw the total amount in the source account, after which deposit it towards the destination account. The operation needs to flourish in full. Should you stop midway, the cash is going to be lost, which is extremely Bad.

In modern databases transactions also perform some other activities - like make sure that you can't access data that someone else has written midway. However the fundamental idea is identical - transactions exist to make sure, that regardless of what happens, the information you train with come in a smart condition. They guarantee there won't be a scenario where cash is withdrawn in one account, although not deposited to a different.

A transaction is really a method of representing a condition change. Transactions ideally have four qualities, generally referred to as Acidity:

  • Atomic (when the change is committed, it takes place in a single fell swoop you cant ever see "half a big changeInch)
  • Consistent (the modification are only able to happen when the new condition from the system is going to be valid any make an effort to commit an invalid change will fail, departing the machine in the previous valid condition)
  • Isolated (no-other person sees any area of the transaction until it's committed)
  • Durable (when the change has happened - when the system states the transaction continues to be committed, the customer does not be concerned about "eliminating" the machine to create the modification "stick")

Begin to see the Wikipedia ACID entry for additional particulars.

Even though this is typically put on databases, it does not need to be. (Particularly, see Software Transactional Memory.)

"A number of data manipulation claims that has to either fully complete or fully fail, departing the database inside a consistent condition"

Here is a simple explanation. You have to transfer 100 dollars from account A to account B. You may either do:

accountA -= 100;
accountB += 100;


accountB += 100;
accountA -= 100;

If something wrong happens between the foremost and the 2nd operation within the pair you've got a problem - either 100 dollars have disappeared or they've made an appearance from nowhere.

A transaction is really a mechanism that enables you to definitely mark several procedures and execute them in a way thet either all of them execute (commit) or even the system condition is going to be as though they haven't began to complete whatsoever (rollback).

accountB += 100;
accountA -= 100;

will either transfer 100 dollars or leave both account within the initial condition.
Acidity = Atomicity, Consistency, Isolation, Durability

When you want for multiple transactional assets to engage in just one transaction, you will have to use something similar to a two-phase commit solution. XA is very broadly supported.

I recommend that the meaning of 'transaction processing' could be more helpful, because it covers transactions like a concept in computer science.

From wikipedia:

In computer science, transaction processing is information processing that's split into individual, indivisible procedures, known as transactions. Each transaction must succeed or fail like a complete unit it can't stay in medium difficulty condition.