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
Separating policy from correctness in concurrency control design
TL;DR: A practical approach to this problem is presented: separating policy from correctness in the design of the concurrency control was successfully used in the development of a transaction processing system for the Cm* multi‐microprocessor.
DissertationDOI
On the Consistency, Characterization, Adaptability and Integrity of Database Replication Systems
Ruiz Fuertes,María Idoia +1 more
TL;DR: A precise characterization model is proposed that allows to decompose algorithms into individual interactions between significant system elements, as well as to define some underlying properties, and to associate each interaction with a specific policy that governs it, thus providing an exhaustive survey of the principal existing systems.
Journal ArticleDOI
Nonsensitive Data and Approximate Transactions
TL;DR: A methodology has been proposed for solving database problems requiring only approximate solutions and it is shown that such an approach improves the performance in situations where transaction conflicts are frequent.
Proceedings ArticleDOI
Towards Transactional Data Management over the Cloud
TL;DR: A cost-effective algorithm that ensures distributed consistency of data without really compromising on availability for fully replicated data is proposed.
Journal ArticleDOI
Synchronization of nested atomic actions
Anand Tripathi,Z. A. El Hili +1 more
TL;DR: A semaphore‐based protocol for synchronizing a set of concurrently executing nested atomic actions and the difficulties involved in integrating deadlock resolution algorithms into the synchronization protocol are detailed.
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.