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
An analytical model for the performance of concurrent B tree algorithms
TL;DR: This paper proposes an analytic performance model for a range of concurrent algorithms on B+ trees and uses this model to propose a high performance, simple-to-program variant of lockcoupling algorithms.
Journal ArticleDOI
Performance modeling of database and simulation protocols: design choices for query driven simulation
John A. Miller,Nancy D. Griffeth +1 more
TL;DR: This paper represents a preliminary modeling study of some of the design choices related to the operation of active objects in an object-oriented database system that will support a highly concurrent, high performance query driven simulation system.
An Approach for Concurrency Control in Distributed Database System
Arun Kumar Yadav,Ajay Agarwal +1 more
TL;DR: This paper studies four representative algorithms - Distributed 2PL, Wound-Wait, Basic Timestamp ordering and a Distributed optimistic algorithm - using a detailed model of a distributed DBMS to study their performance tradeoffs.
Proceedings ArticleDOI
A distributed transaction processing protocol based on majority consensus
Helmut Breitwieser,M. Leszak +1 more
TL;DR: An n-failure-resilient protocol for distributed transaction processing regarding site crash, network partitioning, and local failures like abort of subtransactions is specified and data redundancy given by multiple copies in a partially redundant database is utilized to improve the resiliency of the protocol.
Proceedings ArticleDOI
Performance results on multiversion timestamp concurrency control with predeclared writesets
TL;DR: In the Basic Timestamp Ordering protocol (BTO), as described in [BERN811 for example, each transaction T is assigned a unique timestamp ts(T), and each data item x has a read-timestamp rts(x), equal to the maximum of the timestamps of the transactions which have written x.
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.