Describe the concept of transaction atomicity, Operating System

Q. Describe the concept of transaction atomicity?

Answer: A transaction is a sequence of read as well as writes operations upon some data followed by a commit operation. If the sequence of operations in a transaction cannot be completed the transaction must be aborted and the operations that did take place should be rolled back. It is vital that the series of operations in a transaction appear as one indivisible operation to ensure the integrity of the data being updated. or else data could be compromised if operations from two (or more) different transactions were intermixed.

Posted Date: 7/27/2013 3:50:09 AM | Location : United States







Related Discussions:- Describe the concept of transaction atomicity, Assignment Help, Ask Question on Describe the concept of transaction atomicity, Get Answer, Expert's Help, Describe the concept of transaction atomicity Discussions

Write discussion on Describe the concept of transaction atomicity
Your posts are moderated
Related Questions
What are the disadvantages of swapping technique used in pre-3BSD UNIX systems? If there is excessively much memory contention, processes are swapped out until sufficient

___paging fecthces a page only when needed

Consider a scenario of post mailbox, there are two processes named sender S and receiver R. Both processes can communicate with each other by name along with message. You need to I

Construct a process tree similar to Figure 1. Look up the Linux command pstree -p and describe what it does. Then type in the command the capture the output.


Q. How does DMA raise system concurrency? How does it make difficult hardware design? Answer: DMA increases system concurrency by allowing the CPU to perform tasks while the

What is a resource-allocation graph? Deadlocks can be explained more precisely in terms of a directed graph called a system resource allocation graph. This graph having of a se

The general idea of a producer-consumer architecture is related to building a pipeline of threads, similar to the web spider from Project 2. Each step of the processing will now be

What is reference string We evaluate an algorithm by running it on a definite string of memory reference and computing the number of page faults. The string of memory reference

EXAMPLE FOR SEGMENTATION Consider an instance as given in the table and we have five segments numbered from 0 through 4 the segment is stock in the physical memory as shown. Th