A NEW METHOD FOR CONCURRENCY IN B-TREES

被引：27

作者：

KWONG, YS ^{[1
]}

WOOD, D ^{[1
]}

机构：

[1] MCMASTER UNIV,COMP SCI UNIT,HAMILTON L8S 4L8,ONTARIO,CANADA

来源：

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING | 1982年 / 8卷 / 03期

关键词：

D O I：

10.1109/TSE.1982.235251

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：211 / 222

页数：12

共 25 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Bayer R., 1977, ACM Transactions on Database Systems, V2, P11, DOI 10.1145/320521.320530

[3]

BAYER R, 1977, ACTA INFORM, V9, P1

[4]

BAYER R., 1972, ACTA INFORM, V1, P173, DOI [DOI 10.1007/BF00288683, 10.1007/BF00288683]

[5] UBIQUITOUS B-TREE [J].

COMER, D .

COMPUTING SURVEYS, 1979, 11 (02) :121-137

[6] DENSE MULTIWAY TREES [J].

CULIK, K ;

OTTMANN, T ;

WOOD, D .

ACM TRANSACTIONS ON DATABASE SYSTEMS, 1981, 6 (03) :486-512

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

ELLIS, CS .

ACTA INFORMATICA, 1980, 14 (01) :63-86

[8] 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

[9]

Guibas L.J., 1978, 19TH P ANN IEEE S F, P8

[10]

Knuth D. E., 1973, ART COMPUTER PROGRAM

← 1 2 3 →