DocumentCode
2494313
Title
Real-time optimistic concurrency control protocol with dynamic adjustment of serialization order
Author
Lam, Kwok-wa ; Lam, Kam-yiu ; Hung, Sheung-lun
Author_Institution
Dept. of Comput. Sci., City Univ. of Hong Kong, Kowloon, Hong Kong
fYear
1995
fDate
15-17 May 1995
Firstpage
174
Lastpage
179
Abstract
Proposes a new real-time optimistic protocol. By using a dynamic adjustment of the serialization order by backward-adjusting the non-serious conflicting transactions before the committing transactions, many unnecessary restarts can be eliminated. In the protocol, no conflict or serialization constraints have to be recorded during the read phase of a transaction. Different priority conflict resolution methods can be easily incorporated in the protocol. In addition, with the use of Thomas´s write rule, the number of transaction restarts can further be much reduced
Keywords
access protocols; concurrency control; database theory; real-time systems; transaction processing; Thomas´s write rule; backward-adjustment; committing transactions; conflict constraints; nonserious conflicting transactions; priority conflict resolution methods; read phase; real-time optimistic concurrency control protocol; serialization constraints; serialization order dynamic adjustment; transaction restarts elimination; Computer science; Concurrency control; Database systems; Degradation; Delay; Protocols; Real time systems; System performance; System recovery; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Technology and Applications Symposium, 1995. Proceedings
Conference_Location
Chicago, IL
ISSN
1080-1812
Print_ISBN
0-8186-6980-2
Type
conf
DOI
10.1109/RTTAS.1995.516214
Filename
516214
Link To Document