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
Performance comparison of database concurrency control mechanisms based on two-phase locking, timestamping, and mixed approach
TL;DR: The effect of deadlocks, read : write ratio, cascade rollback, degree of concurrency, transaction-size mixes, transaction wait time and transaction blockings on the overall performance of seven different concurrency control algorithms are evaluated.
Proceedings ArticleDOI
Update propagation in Bakunin data networks
Boris Kogan,Hector Garcia-Molina +1 more
TL;DR: This paper presents several protocols that take advantage of the particular structure of the read-access graph to expedite propagation and defines the notion of virtual serializability, a weaker form ofserializability that allows speedier propagation.
Journal ArticleDOI
Specifications of distributed programs
Barbara Liskov,William E. Weihl +1 more
TL;DR: This paper proposes a structure for specifications that distinguishes expected and desirable effects from undesirable ones, and believes that this distinction is an important one for both users and implementers of a system, and that it makes the specifications easier to understand.
The Challenges of CSCW for Open Distributed Processing
Gordon S. Blair,Tom Rodden +1 more
TL;DR: This talk will review key developments in CSCW and consider the potential impact of these developments on ODP and highlight a number of outstanding issues raised by CSCw.
Proceedings ArticleDOI
Avoiding Policy-based Deadlocks in Business Processes
Mathias Kohler,Andreas Schaad +1 more
TL;DR: This paper proposes a method to avoid policy-based deadlocks by analyzing a workflow's security constraints, determine the minimal required number of users, and provide an optimal user-activity assignment for a deadlock-free workflow execution.
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.