Optimistic Concurrency Control Based on Cache Coherency in Distributed Database Systems

Free registration required

Executive Summary

Optimistic concurrency control highly takes advantage of parallelism because there is no delay by lock. Unfortunately, I/O operations by transactions and cache operations are delayed in the optimistic concurrency control. In order to reduce such delay, the authors combine cache coherency control and optimistic concurrency control rather than they operate in separate. In this paper, they propose optimistic concurrency control, which includes cache control in parallel database system. Two basic concurrency control schemes, direct validation scheme and reduced validation scheme are devised according to the degree of cache activity. Based on these basic schemes, they designed four integrated concurrency control algorithms: GSO, GMS, GMM, and LMM.

  • Format: PDF
  • Size: 185.2 KB