2 FULLY DISTRIBUTED CONCURRENCY-CONTROL ALGORITHMS

被引：1

作者：

BUKHARI, F ^{[1
]}

OSBORN, SL ^{[1
]}

机构：

[1] UNIV WESTERN ONTARIO,DEPT COMP SCI,LONDON N6A 5B7,ONTARIO,CANADA

来源：

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING | 1993年 / 5卷 / 05期

关键词：

ALGORITHMS; CONCURRENCY CONTROL; DISTRIBUTED DATABASES; LOCKING; TIMESTAMPS;

D O I：

10.1109/69.243515

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Two new concurrency control algorithms are introduced for partially replicated distributed databases. They both maintain two values of a data item, and differ in that one requires all locks to be granted at one time, whereas the,other does not. They are based on locking, and avoid deadlocks by using timestamps to establish an execution order when conflicts arise. Since they both proceed without any communication among schedulers, but only communication between the originating site and all participating sites, we say they are fully distributed.

引用

页码：872 / 881

页数：10

共 9 条

[1]

Bayer R., 1980, ACM Transactions on Database Systems, V5, P139, DOI 10.1145/320141.320146

[2]

BAYER R, 1980, 6TH P INT C VER LARG, P275

[3]

Bernstein Philip A., 1987, CONCURRENCY CONTROL

[4]

ESWARAN KP, 1976, COMMUN ACM, V19

[5]

OZSU M, 1990, PRINCIPLES DISTRIBUT

[6]

Papadimitriou CH, 1986, THEORY DATABASE CONC

[7]

Rosenkrantz D. J., 1978, ACM Transactions on Database Systems, V3, P178, DOI 10.1145/320251.320260

[8] DEADLOCK DETECTION IN DISTRIBUTED SYSTEMS [J].

SINGHAL, M .

COMPUTER, 1989, 22 (11) :37-48

[9]

Thomas R. H., 1979, ACM Transactions on Database Systems, V4, P180, DOI 10.1145/320071.320076

← 1 →