scispace - formally typeset
Open AccessJournal ArticleDOI

Concurrency Control in Distributed Database Systems

Philip A. Bernstein, +1 more
- 01 Jun 1981 - 
- Vol. 13, Iss: 2, pp 185-221
Reads0
Chats0
TLDR
A survey of concurrency control methods for distributed database concurrency can be found in this paper, where the authors decompose the problem into two major subproblems, read-write and write-write synchronization, and describe a series of synchromzation techniques for solving each subproblem.
Abstract
In this paper we survey, consolidate, and present the state of the art in distributed database concurrency control. The heart of our analysts is a decomposition of the concurrency control problem into two major subproblems: read-write and write-write synchronization. We describe a series of synchromzation techniques for solving each subproblem and show how to combine these techniques into algorithms for solving the entire concurrency control problem. Such algorithms are called "concurrency control methods." We describe 48 principal methods, including all practical algorithms that have appeared m the literature plus several new ones. We concentrate on the structure and correctness of concurrency control algorithms. Issues of performance are given only secondary treatment.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

A Secure Concurrency Control for MLS/DDBSs

TL;DR: This paper proposes secure multiversion database concurrency control protocol that is free from covert channels without starving the high security level transactions that may often occur in pervious works.
Proceedings ArticleDOI

Future trend on concurrency control in distributed database system design

TL;DR: A time-stamp interval approach with parallel validation is presented under the proposed guidelines for concurrency control, and results are analyzed to compare the related methods.
Journal ArticleDOI

Detection of mutual inconsistency in distributed databases

TL;DR: A simple scheme is presented in this paper to detect mutual inconsistency when partitioned databases merge, similar to that of D. Parker et al .
References
More filters
Book

The Design and Analysis of Computer Algorithms

TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book ChapterDOI

Time, clocks, and the ordering of events in a distributed system

TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI

The notions of consistency and predicate locks in a database system

TL;DR: It is argued that a transaction needs to lock a logical rather than a physical subset of the database, and an implementation of predicate locks which satisfies the consistency condition is suggested.
Journal ArticleDOI

Monitors: an operating system structuring concept

TL;DR: In this paper, the authors develop Brinch-Hansen's concept of a monitor as a method of structuring an operating system and describe a possible method of implementation in terms of semaphores and give a suitable proof rule.
Book ChapterDOI

Notes on Data Base Operating Systems

Jim Gray
TL;DR: This paper is a compendium of data base management operating systems folklore and focuses on particular issues unique to the transaction management component especially locking and recovery.