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
Dissertation
Scalable data management for web applications
TL;DR: Concretely, a transaction is implemented as a Java object containing a list of subtransaction instances, which operate on a single data item each, and all subtransactions are implemented as subclasses of the SubTransaction abstract Java class.
Dissertation
Efficient Commit Processing in High- Availability Main-Memory Databases
TL;DR: The focus of this work is how to improve the performance of main-memory primary-backup systems by looking at the execution of transactions and commit protocols, and a 50% increase in throughput and a reduction in transaction response time are achieveable compared to state-of-the-art protocols.
Journal ArticleDOI
On the communication complexity of polling
TL;DR: This paper provides an optimal communication cost algorithm to perform polling among a given set of participants and analysis of polling algorithms proves that the problem of finding the minimum communication complexity of any polling algorithm is NP-complete.
Atomic Actions andResource Coordination Problems Having Nonunique Solutions
TL;DR: In this article, the concept of atomic actions is decomposed into database-dependent atomic actions and application dependent atomic actions that can have non-unique solutions, and a protocol is proposed which utilizes the nonunique character of the solution to provide higher concurrency.
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.