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
Proceedings ArticleDOI
Resolving concurrent interactions
A. Natrajan,Paul F. Reynolds +1 more
TL;DR: This work uses semantic information to help categorize common interactions encountered in the modeling and simulation domain, and suggests reasonable policies for resolving the effects of concurrent interactions.
SETH: A Quorum-Based Replicated Database System for Experimentation with Failures
TL;DR: It is shown why a quorum-based transaction processing system is, in general, expensive in terms of the number of messages per transaction, and an implementation of such a system on a conventional architectures like a Vax.
Journal ArticleDOI
Distributed file systems - a survey
TL;DR: There exist a number of file systems with different solutions to the problems of data access, concurrency control, serializing transactions, deadlock control and recoverability, but not all solutions are independent of each other.
Proceedings ArticleDOI
Optimal termination protocols for network partitioning
TL;DR: It is proved that quorum-based termination protocols indeed perform very well in the presence of network partitioning and if the central site(s) is reliable, it can be proved that centralized commit protocols indeed performs better than all decentralized ones.
Proceedings Article
Revisiting concurrency in high-performance NoSQL databases
TL;DR: Xyza is introduced, a modified version of MongoDB that uses a wide range of classic and novel techniques to improve performance under concurrent, write-heavy workloads and scales well.
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.