By Topic

On serializability of distributed nested 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
$33 $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)
S. Ben-Hassen ; Dept. of Comput. Sci., Houston Univ., TX, USA ; M. Rusinkiewicz

A model of nested transactions in distributed database systems is presented. The modeling approach is based on conflict serializability extended to accommodate multilevel transactions. Based on these definitions, serialization graph testing for nested transactions is discussed. Three concurrency control algorithms and proofs of their correctness are presented. The algorithms are an adaptation of serialization graph testing, an adaptation of the timestamp ordering protocol, and a variation of an optimistic protocol presented by H.T. Kung and J.T. Robinson (1981)

Published in:

Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on

Date of Conference:

9-12 Jun 1992