CONCURRENT MAINTENANCE OF BINARY SEARCH-TREES

被引:11
作者
MANBER, U
机构
关键词
D O I
10.1109/TSE.1984.5010306
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:777 / 784
页数:8
相关论文
共 17 条
[11]  
KWONG YS, 1982, 20TH P ALL C, P472
[12]   EFFICIENT LOCKING FOR CONCURRENT OPERATIONS ON B-TREES [J].
LEHMAN, PL ;
YAO, SB .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1981, 6 (04) :650-670
[13]   ON DESCRIBING THE BEHAVIOR AND IMPLEMENTATION OF DISTRIBUTED SYSTEMS [J].
LYNCH, NA ;
FISCHER, MJ .
THEORETICAL COMPUTER SCIENCE, 1981, 13 (01) :17-43
[14]  
MANBER U, 1982, MAR ACM S PRINC DAT, P268
[15]  
MANBER U, 1984, 16TH P ANN S THEOR C, P273
[16]  
MANBER U, 1982, THESIS U WASHINGTON
[17]  
Samadi B., 1976, Information Processing Letters, V5, P107, DOI 10.1016/0020-0190(76)90005-3