A CONCURRENT SEARCH STRUCTURE

被引：3

作者：

PARKER, JD

机构：

来源：

关键词：

D O I：

10.1016/0743-7315(89)90020-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：256 / 278

页数：23

共 16 条

[1]

DALLY WJ, 1985, 5174TR85 CAL TECH DE

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

ELLIS, CS .

[3]

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

[4]

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

[5]

ELLIS CS, 1985, TR151 U ROCH DEP COM

[6]

Fagin R., 1979, ACM Transactions on Database Systems, V4, P315, DOI 10.1145/320083.320092

[7]

IMASE M, 1981, IEEE T COMPUT, V30, P439, DOI 10.1109/TC.1981.1675809

[8]

KUNG HT, 1980, ACM T DATABASE S SEP, P354

[9] EFFICIENT LOCKING FOR CONCURRENT OPERATIONS ON B-TREES [J].

LEHMAN, PL ;

YAO, SB .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 1981, 6 (04) :650-670

[10] CONCURRENT MAINTENANCE OF BINARY SEARCH-TREES [J].

MANBER, U .