Concurrency control in distributed database systems
Distributed Database Systems (DDBS) may be defined as integrated database systems composed of autonomous local databases, geographically distributed and interconnected by a computer network. The purpose of this monograph is to present DDBS concurrency control algorithms and their related performance issues. The most recent results have been taken into consideration. A detailed analysis and selection of these results has been made so as to include those which will promote applications and progress in the field. The application of the methods and algorithms presented is not limited to DDBSs but also relates to centralized database systems and to database machines which can often be considered as particular examples of DDBSs. The first part of the book is devoted to basic definitions and models: the distributed database model, the transaction model and the syntactic and semantic concurrency control models. The second discusses concurrency control methods in monoversion DDBSs: the locking method, the timestamp ordering method, the validation method and hybrid methods. For each method the concept, the basic algorithms, a hierarchical version of the basic algorithms, and methods for avoiding performance failures are given. The third section covers concurrency control methods in multiversion DDBSs and the fourth, methods for the semantic concurrency model. The last part concerns performance issues of DDBSs. The book is intended primarily for DDBMS designers, but is also of use to those who are engaged in the design and management of databases in general, as well as in problems of distributed system management such as distributed operating systems and computer networks.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Basic Definitions and Models
Concurrency Control Models
DDBS Performance Failures
15 other sections not shown
Other editions - View all
Concurrency Control in Distributed Database Systems
W. Cellary,T. Morzy,E. Gelenbe
Limited preview - 2014
2PL algorithm aborted abstract data type acyclic arcs assume balance(A compatibility concurrency control algorithm concurrency control model concurrency degree concurrent schedule Consider consistency constraints D-serializability data access data item versions data item x data structure database consistency database operations database systems DDBSs deadlock defined denoted dependency relations directed acyclic graph distributed database DM module global lock granularity hierarchy granules hypergraph infinite restarting initiated lock mode locked transaction locking algorithm locking policy monoversion multiversion serializability mvs(r MVSG NP-complete partially ordered set permanent blocking precedence relation presented prewrite problem procedure queries queue read lock read operation read request resequencing schedule s(t Section serial schedule serializability criterion set of transactions shown in Figure subtransaction T/O algorithm timestamp order tion trans transaction execution transaction model transaction requests transaction semantic types transaction T3 TS(Ti two-phase commitment update transactions validation algorithm vertex W-ts(xk write lock write operation write request