2 FULLY DISTRIBUTED CONCURRENCY-CONTROL ALGORITHMS

Fahren Bukhari

doi:10.1109/69.243515

Return

2 FULLY DISTRIBUTED CONCURRENCY-CONTROL ALGORITHMS

1993-01-01

PRE

Fahren Bukhari *

Sylvia L. Osborn

DOI：10.1109/69.243515

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

ALGORITHMS

CONCURRENCY CONTROL

DISTRIBUTED DATABASES

LOCKING

TIMESTAMPS

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.