Paper Info
Title
BAP: a class of abort-oriented protocols based on the notion of compatibility
Abstract
There has been growing interest in the performance of transaction systems that have significant response time requirements. These requirements are usually specified as hard or soft deadlines on individual transactions, and a concurrency control algorithm must attempt to meet the deadlines as well as preserve data consistency. This paper proposes a class of simple and efficient abort-oriented concurrency control algorithms based on the notion of compatibility. The schedulability of a transaction system is improved by aborting transactions that introduce excessive blockings. We consider different levels of the aborting relationship among transactions and evaluate the impacts of the aborting relationship when the relationship is built in an on-line or off-line fashion.
Year
DOI
Venue
1996
10.1109/RTCSA.1996.554968
RTCSA
Keywords
Field
DocType
different level,off-line fashion,efficient abort-oriented concurrency control,transaction system,concurrency control algorithm,abort-oriented protocol,individual transaction,aborting transaction,excessive blockings,aborting relationship,data consistency,performance,concurrency control,real time
Timestamp-based concurrency control,Isolation (database systems),Serializability,Concurrency control,Computer science,Multiversion concurrency control,Real-time computing,Distributed concurrency control,Distributed transaction,Optimistic concurrency control,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-8186-7626-4
4
0.42
References 
Authors
8
3
Name
Order
Citations
PageRank
Ming-Chung Liang1161.47
Tei-Wei Kuo23203326.35
Lihchyun Shu313017.32