MAXIMAL SERIALIZABILITY OF ITERATED TRANSACTIONS

被引:38
作者
FLE, MP
ROUCAIROL, G
机构
关键词
D O I
10.1016/0304-3975(85)90206-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:1 / 16
页数:16
相关论文
共 10 条
[1]  
BERNSTEIN PA, 1981, COMPUT SURV, V13, P185, DOI 10.1145/356842.356846
[2]  
BUCHI JR, 1962, INT C LOGIC METHOD P
[3]  
CORI R, UNPUB RAIRO INFORM T
[4]  
Dijkstra E., 1971, ACTA INFORM, V1, P115, DOI DOI 10.1007/BF00289519
[5]   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
[6]  
FLE MP, 1982, ACM SIGACT SIGOPS, P194
[7]  
Karp R. M., 1969, J COMP SYST SCI, V3, P147, DOI DOI 10.1016/S0022-0000(69)80011-5
[8]   PARALLEL PROGRAM SCHEMATA AND MAXIMAL PARALLELISM .1. FUNDAMENTAL RESULTS [J].
KELLER, RM .
JOURNAL OF THE ACM, 1973, 20 (03) :514-537
[9]  
PAPADIMITRIOU CH, 1977, P C THEORETICAL COMP, P272
[10]  
ROUCAIROL GP, 1978, RAIRO-INF-COMPUT SCI, V12, P277