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
Book ChapterDOI
Nets in Data Bases
TL;DR: In this paper, access synchronization and conceptual schema are addressed in the context of general net theory for database research and development, and two particular areas are addressed: access synchronization, and conceptual schemas.
Journal ArticleDOI
RDMA-enabled Concurrency Control Protocols for Transactions in the Cloud Era
Chao Wang,Xuehai Qian +1 more
TL;DR: RCC is developed, the first unified and comprehensive RDMA-enabled distributed transaction processing framework containing six serializable concurrency control protocols—not only the classical protocols NOWAIT, WAITDIE, OCC, but also more advanced MVCC, SUNDIAL, and CALVIN — the deterministic protocol.
Journal ArticleDOI
Performance evaluation of the time-stamp ordering algorithm in a distributed database
TL;DR: The power of interpolation approximation technique is illustrated by obtaining extremely good approximations for this rather complex queueing model that incorporates the fork-join and resequencing synchronization constraints to analyze the algorithm's performance.
Distributed Transaction Processing on an Ordering Network
Craig Williams,Paul F. Reynolds +1 more
TL;DR: This work proposes a new technique, ORDER, that enlists the aid of the interconnection network in a distributed database system in order to coordinate transactions, and demonstrates that ORDER outperforms dynamic 2PL for a wide range of workloads.
Proceedings ArticleDOI
Optimizing and evaluating algorithms for replicated data concurrency control
Akhil Kumar,A. Segev +1 more
TL;DR: A semi-exhaustive algorithm is described for solving the assignment of votes in an environment where intersite communications costs are nonuniform and individual site reliabilities vary.
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.