DocumentCode
3299058
Title
On serializability of distributed nested transactions
Author
Ben-Hassen, S. ; Rusinkiewicz, M.
Author_Institution
Dept. of Comput. Sci., Houston Univ., TX, USA
fYear
1992
fDate
9-12 Jun 1992
Firstpage
152
Lastpage
159
Abstract
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)
Keywords
concurrency control; distributed databases; protocols; transaction processing; concurrency control algorithms; distributed database systems; distributed nested transactions; multilevel transactions; optimistic protocol; serializability; serialization graph testing; timestamp ordering protocol; Computer science; Concurrency control; Concurrent computing; Database systems; History; Protocols; Scheduling algorithm; System recovery; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1992., Proceedings of the 12th International Conference on
Conference_Location
Yokohama
Print_ISBN
0-8186-2865-0
Type
conf
DOI
10.1109/ICDCS.1992.235044
Filename
235044
Link To Document