J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufman. 1992  Home/Search   Document Not in Database   Summary   Related Articles   Check

....may have acted in good faith according to the policy of the system. Atomicity is not a new concern; it has been considered for years in the transaction processing environment. There are some excellent references on general techniques for achieve atomicity in electronic commerce protocols ([12, 11] are outstanding surveys of the field. This paper is a first attempt to enumerate some possible building blocks for generating atomic protocols in electronic commerce. Our concern with these topics is not purely academic. At CMU, we are currently building a system called NetBill. NetBill has a ....

....repetition will result in the account being decremented by more than just one unit. However, a message that is uniquely identified by a transaction ID can be made idempotent since the receiver of the message can ignore repeated copies of the same message tagged with the same transaction ID. See [11] for more on the subject of idempotence. 4.1 Encryption based atomicity Our first building block prevents data (such as a token or digital goods) from being read by the recipient before a key can be sent to a trusted third party. This third party can then arbitrate to ensure atomic delivery. ....

[Article contains additional citation context not shown here]

J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufmann, San Mateo, CA, 1994.

....the state of the object. All machines that have a local copy of the object perform the operation to keep the object consistent. results The output parameters and return value of an operation. These results can be used later in the code (data dependency) The general atomic transaction model [6] (as used for databases) allows atomic actions on arbitrary sets of data. Deadlocks, atomic commit, concurrency control, and fault tolerance are 2 Appears in Proceedings of the First Annual Conference of the Advanced School for Computing and Imaging, May 1995 ATOMIC sum(x, y: SHARED ....

J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufmann, San Mateo, CA, 1992.

....the state of the object. All machines that have a local copy of the object perform the operation to keep the object consistent. results The output parameters and return value of an operation. These results can be used later in the code (data dependency) The general atomic transaction model [7] (as used for databases) allows atomic actions on arbitrary sets of data. Deadlocks, atomic commit, concurrency control, and fault tolerance are complicated and expensive to implement if arbitrary data can be accessed in a transaction. Moreover, for parallel programming, such a general mechanism ....

J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufmann, San Mateo, CA, 1992.

....such as the log, which lie in the processing path of every transaction must be allowed with minimal or no impact on performance. Since relaxing correctness requirements is one way to achieve this, serious consideration must be given to it. Let us now consider some weakened isolation requirements [5] that have been suggested and adopted in practice for transactions accessing the database. In the context of read write objects, degree 2 isolation ignores conflicts resulting from a read followed by a write. Such a requirement leads to lack of repeatable reads. Degree 1 isolation ignores, in ....

J.N. Gray and A. Reuter, "Transaction Processing: Techniques and Concepts", MorganKaufman, 1992.

....data set. That is, in (2) a cycle of C relations formed by accesses to the database as well as by accesses to extra data will be ignored since only C k is expected to be acyclic where is C k pertains either to the database or to the extra data. Let us now consider weakened isolation requirements[3]. In the context of read write objects, degree 2 isolation ignores conflicts resulting from a read followed by a write. Such a requirement leads to the lack of repeatable reads. Suppose t 1 accesses the current time. A subsequent update of the current time by the system clock will be allowed ....

J.N. Gray and A. Reuter, "Transaction Processing: Techniques and Concepts", MorganKaufman, 1992.

....the more complex variations. The Ada example which we present later applies to a more restrictive model of conversations, although slightly more flexible models may well be practical with languages other than (simpler than) Ada. 2. 3 General Description of Atomic Transactions Atomic transactions [Gray and Reuter 1992; Lynch, Merrit et al. 1993] are a useful means for structuring access to shared data by multiple independent agents or clients. Atomic transactions help in solving the two problems of concurrency control and error recovery, by letting the programmer of each client see only consistent states of ....

J. Gray and A. Reuter. Transaction processing: techniques and concepts, Morgan Kaufmann, 1992.

....Atomic transactions form the cornerstone of modern transaction processing theory. Nancy Lynch and her fellow researchers have written an encyclopedic book about atomic transactions [13] a tremendous resource for those implementing atomic transaction processing systems is the standard textbook [9]; for a thorough review of powerful roll back methods in the context of computer security and electronic commerce, see [25] 26] and [27] The A in ACID Transactions stands for atomic, no non atomic distributed transaction system would ever be tolerated by customers of data processing. ....

J. Gray and A. Reuter. Transactions Processing: Techniques and Concepts. Morgan Kaufmann, San Mateo, CA, 1994.

....such as the log, which lie in the processing path of every transaction must be allowed with minimal or no impact on performance. Since relaxing correctness requirements is one way to achieve this, serious consideration must be given to it. Let us now consider some weakened isolation requirements [6] that have been suggested and adopted in practice for transactions accessing the database. In the context of read write objects, degree 2 isolation ignores conflicts resulting from a read followed by a write. Such a requirement leads to lack of repeatable reads. Degree 1 isolation ignores, in ....

J.N. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. MorganKaufman, 1992.

....are done. But this consumes processing time that can affect the processing of transactions that are not waiting for locks to be released. Whereas optimistic concurrency control techniques or a shadow pages based recovery strategy can be used to minimize this time, they have several disadvantages [18]. Secondly, unlike traditional databases where permanent data should always reflect a consistent state, in real time databases, the presence of temporal data, while providing some opportunities for quicker recovery [51] adds to the complexities of the recovery of transactions. Specifically, if a ....

J.N. Gray and A. Reuter, "Transaction Processing: Techniques and Concepts", MorganKaufman (book in preparation).

....Atomic transactions form the cornerstone of modern transaction processing theory. Nancy Lynch and her fellow researchers have written an encyclopedic book about atomic transactions [13] a tremendous resource for those implementing atomic transaction processing systems is the standard textbook [9]; for a thorough review of powerful roll back methods in the context of computer security and electronic commerce, see [25] 26] and [27] The A in ACID Transactions stands for atomic , no non atomic distributed transaction system would ever be tolerated by customers of data processing. ....

J. Gray and A. Reuter. Transactions Processing: Techniques and Concepts. Morgan Kaufmann, San Mateo, CA, 1994.

....such as the log, which lie in the processing path of every transaction must be allowed with minimal or no impact on performance. Since relaxing correctness requirements is one way to achieve this, serious consideration must be given to it. Let us now consider some weakened isolation requirements [6] that have been suggested and adopted in practice for transactions accessing the database. In the context of read write objects, degree 2 isolation ignores conflicts resulting from a read followed by a write. Such a requirement leads to lack of repeatable reads. Degree 1 isolation ignores, in ....

J.N. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. MorganKaufman (1992).

....numbered resources are locked, the claim on lower numbered resources is implicitly relinquished, except for those explicitly locked. Promoting a previously acquired lock violates the ordering of resources and compromises deadlock avoidance. Lock promotion is the most common cause of deadlock [5]. For example, when two transactions set S latches on the same object to be updated, and then subsequently desire to promote their latches to X, a deadlock results. Update(U) latches [4] support lock promotion by retaining an exclusive claim on a resource that is currently shared [8] They allow ....

Gray, J. and Reuter, A.,Transaction Processing: Techniques and Concepts, book in preparation.

No context found.

J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufman. 1992

No context found.

J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufman. 1992

No context found.

J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufman. 1992

No context found.

J. Gray and A. Reuter. Transaction Processing: Techniques and Concepts. Morgan Kaufman. 1992

No context found.

Gray, J. and Reuter, A.,Transaction Processing: Techniques and Concepts, book in preparation.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC