The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - October (1993 vol.5)
pp: 872-881
ABSTRACT
<p>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.</p>
INDEX TERMS
distributed concurrency control algorithms; partially replicated distributed databases; locks; deadlocks; timestamps; schedulers; communication; concurrency control; database theory; distributed databases
CITATION
F. Bukhari, S.L. Osborn, "Two Fully Distributed Concurrency Control Algorithms", IEEE Transactions on Knowledge & Data Engineering, vol.5, no. 5, pp. 872-881, October 1993, doi:10.1109/69.243515
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool