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
Patent
Allocation locks and their use
TL;DR: In this paper, the authors present an allocation lock that permits only a single transaction to acquire space on a particular page at any one time, which facilitates operations of concurrent transactions at a subpage level (e.g., a row level), and in conjunction with a heap manager can enforce a set of conditions such that prior to a commit stage of a transaction, a space availability for a specific page can be typically assured.
Journal ArticleDOI
Guaranteeing serializable results in synchronous parallel production systems
TL;DR: This work presents a formal solution to the problem of guaranteeing serializable behavior in synchronous parallel production systems that execute many rules simultaneously, and presents a variety of algorithms that implement this solution.
The application of microeconomics to the design of resource allocation and control algorithms
TL;DR: A new methodology for resource sharing algorithms in distributed systems is presented, proposing Pareto-optimality as a definition of optimality and fairness for the flow control problem and proving that the resource allocations computed by the economy are Pare to-optimal.
Proceedings ArticleDOI
The Time Warp mechanism for database concurrency control
David Jefferson,Amihai Motro +1 more
TL;DR: The Time Warp mechanism is introduced as a new method for concurrency control in distributed database systems that uses the use of object rollback as the fundamental tool for synchronization instead of blocking or abortion.
Journal ArticleDOI
Rose: compressed, log-structured replication
TL;DR: A page compression format is introduced that takes advantage of LSM-tree's sequential, sorted data layout and increases replication throughput by reducing sequential I/O, and enables efficient tree lookups by supporting small page sizes and doubling as an index of the values it stores.
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.