Performance evaluation of a new optimistic concurrency control algorithm

Jonathan Addess, Ehud Gudes, Doron Tal, Naphtali Rishe

Research output: Contribution to conferencePaperpeer-review

Abstract

A modification of the classic Kung-Robinson timestamp-based concurrency control algorithm is described. The algorithm is based on two innovative techniques: query killing notes and weak serializability of transactions. In particular, it prefers long transactions over short queries and thus reduces considerably the number of transaction rollbacks required. In order to test the validity and evaluate the performance of the proposed algorithm, a simulation program was written and run using a realistic set of transactions. The simulation was performed using Flat Concurrent Prolog (FCP). The advantages of FCP for specifying and implementing parallel algorithms include its refined granularity of parallelism, its declarativeness and conciseness, and its powerful communication and synchronization primitives. Results of algorithm performance are presented.

Original languageEnglish
Pages522-525
Number of pages4
StatePublished - 1 Jan 1990
EventPARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications - Miami Beach, FL, USA
Duration: 7 Mar 19909 Mar 1990

Conference

ConferencePARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications
CityMiami Beach, FL, USA
Period7/03/909/03/90

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'Performance evaluation of a new optimistic concurrency control algorithm'. Together they form a unique fingerprint.

Cite this