In Cloud Hosting in Sydney, transaction is a set of logically interrelated queries sent to the coordinated change of a set of rows in one or more database tables. Typically, when the transaction is updated several tables and indexes associated with these tables. To ensure the synchronization of updates and data integrity in servers typically use the principle of all or nothing, meaning that in the database, or all updates are made or none of them.

For this purpose, conducted the transaction log, which records information about all the changes requested. This journal provides an opportunity to scroll back Committed transaction and restore the previous state of the database. This becomes important when changes to the database provided for in a single transaction, only partially implemented, for example, due to hardware failure.

Database servers that form part of Cloud Hosting in Sydney must have a means of determining the state of deadlock (dead lock). If this happens, perform one of the transaction is aborted, bringing another transaction from the state of perpetual waiting. Abort the transaction after eliminating the possibility of its first block is executed.

Optimization goal is to provide as quickly as possible a response to the request with a minimal number of calls to the database. There are two types of optimization on the SQL language.

Optimizing syntax uses the fact that the language of SQL query performance depends on how it is formulated. In this case, the optimization depends on the skills of the programmer. When optimizing the cost going to collect information about the database – including tables, including strings, type of data in each row, affordability index for a particular column, etc. The optimizer uses this information to figure out the best treatment plan requests.

Advantages of cost optimization : the problem of determining the best way to execute a query is shifted from the user to the database processor. However, finding the optimal method itself can be time consuming.

The two essential basic architectures for CPUs are the Von Neumann and Harvard architecture. In the Von Neumann architecture, named after the mathematician John von Neumann, there is no separation between the memory for data and program code.

In contrast, in the Harvard architecture, data and program (s) is stored in strictly separated storage and address spaces, on which it is typically accessed by means of two separated parallel bus systems.

Both architectures have their specific advantages and disadvantages. The Von Neumann architecture is simpler, since program code and data will be treated the same. This is consistent operating system routines for loading and saving usable.