Concurrency Control in Distributed Database Systems
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
Citations
More filters
Journal ArticleDOI
The design of distributed, software fault tolerant, real-time systems incorporating decision mechanisms
TL;DR: It is shown that a two phase locking mechanism can be used to serialise concurrent decisions, thus removing certain timing problems, and a twophase commit protocol can beUsed to implement distibuted decisions which are recoverable for certain classes of failure.
Journal ArticleDOI
P4DB - The Case for In-Network OLTP (Extended Technical Report)
TL;DR: A new approach for distributed DBMSs called P4DB, that uses a programmable switch to accelerate OLTP workloads and provides significant benefits compared to traditional DBMS architectures and can achieve a speedup of up to 8×.
Journal ArticleDOI
SP-LIFT: A Serial Parallel Linear and Fast-Paced Recovery-Centered Transaction Commit Protocol
TL;DR: This paper is an attempt to propose a Serial Parallel Linear and Fast-paced recovery-centered Transaction (SP-LIFT) commit protocol by modifying the L-2PC, which gives autonomy to the participating cohorts by informing the cohort-in-doubt about the distributed transaction’s state instead of always looking for the coordinator's stand.
Dissertation
A study of the availability and serializability in a distributed database system
David Wai-Lok Cheung,Tiko Kameda +1 more
TL;DR: It is argued that a transaction scheduling policy that favors local transactions over global transactions should be adopted in wide-area distributed database systems, and two schemes are proposed for concurrency control in this kind of system.
Journal ArticleDOI
Evaluation of timestamp-based concurrency control mechanisms incorporating livelock avoidance
TL;DR: This model is used to show that the standard transaction restart policy used by time-stamp-based algorithms leads to infinite cyclic restarts of transactions, and three alternative restart techniques are defined and are formally shown to guarantee the absence of cycling restarts.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
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
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.