Database Concurrency Control

Database Concurrency Control: Methods, Performance and Analysis is a review of developments in concurrency control methods for centralized database systems, with a quick digression into distributed databases and multicomputers, the emphasis being on performance. The main goals of Database Concurrency Control: Methods, Performance and Analysis are to succinctly specify various concurrency control methods; to describe models for evaluating the relative performance of concurrency control methods; to point out problem areas in earlier performance analyses; to introduce queuing network models to evaluate the baseline performance of transaction processing systems; to provide insights into the relative performance of transaction processing systems; to illustrate the application of basic analytic methods to the performance analysis of various concurrency control methods; to review transaction models which are intended to relieve the effect of lock contention; to provide guidelines for improving the performance of transaction processing systems due to concurrency control; and to point out areas for further investigation. This monograph should be of direct interest to computer scientists doing research on concurrency control methods for high performance transaction processing systems, designers of such systems, and professionals concerned with improving (tuning) the performance of transaction processing systems.

For graduate-level courses. This text gathers into one volume the important and significant research works past and present on the performance and development aspects of database concurrency control mechanisms.

The second edition of this bestselling title is a perfect blend of theoretical knowledge and practical application. It progresses gradually from basic to advance concepts in database management systems, with numerous solved exercises to make learning easier and interesting. New to this edition are discussions on more commercial database management 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.

This book contains a number of chapters on transactional database concurrency control. A two-sentence summary of the volume's entire sequence of chapters is this: traditional locking techniques can be improved in multiple dimensions, notably in lock scopes (sizes), lock modes (increment, decrement, and more), lock durations (late acquisition, early release), and lock acquisition sequence (to avoid deadlocks). Even if some of these improvements can be transferred to optimistic concurrency control, notably a fine granularity of concurrency control with serializable transaction isolation including phantom protection, pessimistic concurrency control is categorically superior to optimistic concurrency control, i.e., independent of application, workload, deployment, hardware, and software implementation.