Cart (Loading....) | Create Account
Close category search window
 

Improved optimistic concurrency control and its use in distributed database systems

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)
Unland, R. ; Dept. of Comput. Sci., Hagen Univ., West Germany ; Schlageter, G.

The original optimistic concurrency control scheme (H.T. Kung, and J.T. Robinson, 1979) has weaknesses with respect to the validation technique, the treatment of long transactions, and the problem of starvation. Some alternatives for the validation-phase are considered that not only avoid these disadvantages but also improve the performance of the original approach. Most promising is a technique which supports read-transactions, thereby decreasing the number of backups substantially. An adaptation of a centralized optimistic concurrency control scheme to a distributed environment is presented. The proposed algorithm is deadlock-free and offers high parallelism.<>

Published in:

System Sciences, 1988. Vol.II. Software Track, Proceedings of the Twenty-First Annual Hawaii International Conference on  (Volume:2 )

Date of Conference:

0-0 1988

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.