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
Logical leases : scalable hardware and software systems through time traveling
TL;DR: This thesis proposes a simple technique, called logical leases, to improve the scalability and performance of shared-memory parallel systems in both hardware and software and implements three systems based on logical leases.
Proceedings ArticleDOI
A client-server architecture for distributed problem solving
TL;DR: The paper describes a friendly environment supporting the development and execution of distributed algorithms based on a client server architecture in which the client is responsible for monitoring the execution and communication with the servers, while the servers carry out the actual work.
Proceedings ArticleDOI
A distributed transaction management scheme for multidatabase systems
Xinfeng Ye,J.A. Keane +1 more
TL;DR: A distributed transaction management scheme is introduced that maintains the autonomy of the local database systems and guarantees fairness in the execution of the transactions in the system.
Journal ArticleDOI
A declarative state transition system
TL;DR: This paper shows how the idea of applicative state transition systems, proposed by Backus, can be used in practice and describes the design and application of Parlog+, the user language in a DST system for parallel logic programming.
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.