OPTIMISTIC VS PESSIMISTIC CONCURRENCY CONTROL ALGORITHM: A COMPARATIVE STUDY.

M. H. Nagi, A. A. Helal, A. K. Elmagarmid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

The behavior and performance of two fundamentally different concurrency control algorithms (CCAs) for single-site databases has been investigated. These are the dynamic two-phase locking (2PL) and the commit-time validation (CTV) algorithms. 2PL represents a pessimistic approach to concurrency control whereas CTV is an optimistic approach. For each algorithm a performance model has been constructed and a simulation has been performed. Three parameters affecting data contention are studied: the degree of multiprogramming (the load effect), the read/write mix (ratio of query to update) and the database granularity. Unlike previous studies, the combined effect of these three parameters has been considered, providing insight into their composite impact.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
EditorsKai Hwang, Steven M. Jacobs, Earl E. Swartzlander
PublisherIEEE
Pages131-138
Number of pages8
ISBN (Print)0818607246
Publication statusPublished - 1 Dec 1986

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'OPTIMISTIC VS PESSIMISTIC CONCURRENCY CONTROL ALGORITHM: A COMPARATIVE STUDY.'. Together they form a unique fingerprint.

  • Cite this

    Nagi, M. H., Helal, A. A., & Elmagarmid, A. K. (1986). OPTIMISTIC VS PESSIMISTIC CONCURRENCY CONTROL ALGORITHM: A COMPARATIVE STUDY. In K. Hwang, S. M. Jacobs, & E. E. Swartzlander (Eds.), Proceedings of the International Conference on Parallel Processing (pp. 131-138). (Proceedings of the International Conference on Parallel Processing). IEEE.