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
Posted Content

Contextuality from missing and versioned data

Jason Morton
- 10 Aug 2017 - 
TL;DR: This paper shows how contextuality can arise in common data collection scenarios, including missing data and versioning (as in low-latency distributed databases employing snapshot isolation) and develops statistical models adapted to this regime.
Journal ArticleDOI

An Analysis and Improvement of Probe-Based Algorithm for Distributed Deadlock Detection

TL;DR: An analysis of existing deadlock detection algorithm for distributed systems and some improvement on them indicates that in this algorithm, rate of probe initiation is a dominant factor in determining system performance and rules need to be framed for determining best value of it.
Proceedings ArticleDOI

Fault Tolerance in a Cloud of Databases Environment

TL;DR: This paper proposes an approach for the processing of transactions in a cloud of databases environment able to secure serializability in running transactions whether the system is compromised or not and proposes also an intrusion tolerant scheme to ensure the continuity of the running transactions.
Book ChapterDOI

A New Class Hierarchy Concurrency Control Technique in Object-Oriented Database Systems

TL;DR: A locking-based concurrency control scheme is presented for OODBs that reduces locking overhead for class hierarchy which is an important property in OODB.
Journal ArticleDOI

Pessimistic quasipartitioning protocols for distributed database systems

TL;DR: Two protocols for transaction processing in quasipartitioned databases are proposed that improve their major performance measures linearly with the backup link speed but are not visibly affected by duration of the partitioning or the database size.
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.