By Topic

The semantics of commutativity in the execution of concurrent transactions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Latour, L. ; Dept. of Comput. Sci., Maine Univ., Orono, ME, USA ; Tindell, R.

It is pointed out that a precise understanding of user process semantics is crucial to the design of schedulers for concurrent transactions. Although a scheduler that is at least sufficient to maintain database correctness must be designed, a more precise understanding of user process semantics will make it possible to identify and make use of additional properties maintained by the scheduler and assist in better understanding of how to improve the scheduling algorithm to allow a higher degree of user process concurrency. A precise formal model of these semantics, which is unique in that it incorporates any local processing required to produce an updated item in a function of the write request associated with that update, has been developed. This makes it possible to deal directly with the semantic content of schedules, rather than indirectly through commutativity rules

Published in:

Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on

Date of Conference:

7-9 Mar 1990