A PROOF TECHNIQUE FOR CONCURRENCY-CONTROL AND RECOVERY ALGORITHMS FOR REPLICATED DATABASES

被引:8
作者
BERNSTEIN, PA [1 ]
GOODMAN, N [1 ]
机构
[1] KENDALL SQ RES CORP,CAMBRIDGE,MA 02139
关键词
D O I
10.1007/BF01786253
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
21
引用
收藏
页码:32 / 44
页数:13
相关论文
共 21 条
[1]  
ALSBERG PQ, 1976, AC202 U ILL URB CTR
[2]  
BERNSTEIN PA, 1981, COMPUT SURV, V13, P185, DOI 10.1145/356842.356846
[3]   AN ALGORITHM FOR CONCURRENCY-CONTROL AND RECOVERY IN REPLICATED DISTRIBUTED DATABASES [J].
BERNSTEIN, PA ;
GOODMAN, N .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1984, 9 (04) :596-615
[4]   FORMAL ASPECTS OF SERIALIZABILITY IN DATABASE CONCURRENCY CONTROL [J].
BERNSTEIN, PA ;
SHIPMAN, DW ;
WONG, WS .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1979, 5 (03) :203-216
[5]  
BERNSTEIN PA, 1986, J COMPUT SYST SCI
[6]  
Bernstein Philip A., 1987, CONCURRENCY CONTROL
[7]  
DAVIDSON SB, 1984, TR84617 CORN U DEP C
[8]   ACHIEVING ROBUSTNESS IN DISTRIBUTED DATABASE-SYSTEMS [J].
EAGER, DL ;
SEVCIK, KC .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1983, 8 (03) :354-381
[9]  
ELABBADI A, 1985, 4TH P ACM SIGACT SIG, P215
[10]   NOTIONS OF CONSISTENCY AND PREDICATE LOCKS IN A DATABASE SYSTEM [J].
ESWARAN, KP ;
GRAY, JN ;
LORIE, RA ;
TRAIGER, IL .
COMMUNICATIONS OF THE ACM, 1976, 19 (11) :624-633