CONCURRENT MAINTENANCE OF BINARY SEARCH-TREES

被引：11

作者：

MANBER, U

机构：

来源：

关键词：

D O I：

10.1109/TSE.1984.5010306

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：777 / 784

页数：8

共 17 条

[1]

BAYER R, 1977, ACTA INFORM, V9, P1

[2]

BERNSTEIN PA, 1981, ACM COMPUT SURV, V13, P185

[3] CONCURRENT SEARCH AND INSERTION IN 2-3 TREES [J].

ELLIS, CS .

[4]

ELLIS CS, 1980, IEEE T COMPUT, V29, P811, DOI 10.1109/TC.1980.1675680

[5]

ELLIS CS, 1983, 2ND P ACM SIGACT SIG, P106

[6] NOTIONS OF CONSISTENCY AND PREDICATE LOCKS IN A DATABASE SYSTEM [J].

ESWARAN, KP ;

GRAY, JN ;

LORIE, RA ;

TRAIGER, IL .

[7]

Gray J. N., 1978, Operating Systems. An Advanced Course, P393

[8]

GRAY JN, 1980, LECTURE NOTES COMPUT, V80

[9]

Kung H. T., 1980, ACM Transactions on Database Systems, V5, P354, DOI 10.1145/320613.320619

[10] A NEW METHOD FOR CONCURRENCY IN B-TREES [J].

KWONG, YS ;

WOOD, D .