Optimistic Concurrency Control for Distributed Databases.

Abstract

One of the most important considerations in developing a distributed data-base system is the concurrency control mechanism. Recently, many arguments have been advanced in favor of the optimistic solution to concurrency control. This work reviews two algorithms that apply the Kung-Robinson proposal to a distributed database system. A different algorithm originally proposed by Badal is developed and expanded. This new algorithm switches from an optimistic mode of detecting and resolving non-serializable execution to a pessimistic mode of preventing non-serializable execution when the degree of conflict reaches a certain level. In other words, the algorithm adapts itself to the degree of conflict. Representative optimistic algorithms are then compared with two-phase locking and two-phase commit under different scenarios. Conclusions are drawn based on the performance of the algorithms under the different scenarios. The new algorithm appears to perform better than any of the other concurrency control mechanisms. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1982
Accession Number
ADA121962

Entities

People

  • William Peyton Mcelyea

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Autonomy
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Autonomy
  • Computer Networks
  • Computer Science
  • Computers
  • Data Management
  • Databases
  • Detection
  • Models
  • Multithreading
  • Schools
  • Technical Information Centers
  • United States
  • Validation

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design