ALTRUISTIC LOCKING

被引:29
作者
SALEM, K
GARCIAMOLINA, H
SHANDS, J
机构
[1] UNIV MARYLAND,DEPT COMP SCI,COLLEGE PK,MD 20742
[2] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 1994年 / 19卷 / 01期
关键词
ALGORITHMS; PERFORMANCE; ATOMICITY; LOCKING; SCHEDULING; SERIALIZABILITY;
D O I
10.1145/174638.174639
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Long-lived transactions (LLTs) hold on to database resources for relatively long periods of time, significantly delaying the completion of shorter and more common transactions. To alleviate this problem we propose an extension to two-phase locking, called altruistic locking, whereby LLTs can release their locks early. Transactions that access this released data are said to run in the wake of the LLT and must follow special locking rules. Like two-phase locking, altruistic locking is easy to implement and guarantees serializability.
引用
收藏
页码:117 / 165
页数:49
相关论文
共 24 条
[1]  
AGRAWAL D, 1990, 9TH P ACM S PRINC DA
[2]   CONCURRENCY-CONTROL PERFORMANCE MODELING - ALTERNATIVES AND IMPLICATIONS [J].
AGRAWAL, R ;
CAREY, MJ ;
LIVNY, M .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1987, 12 (04) :609-654
[3]  
AGRAWAL R, 1991, P INT C DATA ENG KOB, P592
[4]  
AHUJA ML, 1987, FEB P INT C DAT ENG, P312
[5]   SEMANTICS-BASED CONCURRENCY-CONTROL - BEYOND COMMUTATIVITY [J].
BADRINATH, BR ;
RAMAMRITHAM, K .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1992, 17 (01) :163-199
[6]  
BAYER R, 1987, ACM T DATABASE SYST, V12, P1
[7]   A MODEL FOR CONCURRENCY IN NESTED TRANSACTIONS SYSTEMS [J].
BEERI, C ;
BERNSTEIN, PA ;
GOODMAN, N .
JOURNAL OF THE ACM, 1989, 36 (02) :230-269
[8]  
BERSTEIN PA, 1987, CONCURRENCY CONTROL
[9]   ON RIGOROUS TRANSACTION SCHEDULING [J].
BREITBART, Y ;
GEORGAKOPOULOS, D ;
RUSINKIEWICZ, M ;
SILBERSCHATZ, A .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (09) :954-960
[10]   THE PERFORMANCE OF MULTIVERSION CONCURRENCY-CONTROL ALGORITHMS [J].
CAREY, MJ ;
MUHANNA, WA .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1986, 4 (04) :338-378