Article

Free access

An adaptive concurrency control algorithm (abstract)

Authors:

James Canning,

P. Muthuvelraj,

John SiegAuthors Info & Claims

CSC '90: Proceedings of the 1990 ACM annual conference on Cooperation

Page 431

https://doi.org/10.1145/100348.100458

Published: 01 January 1990 Publication History

PDF eReader

Abstract

Correctness of concurrent executions of multiple database transactions is assured by concurrency control techniques. Performance analyses, e.g., [Agr85], show that optimistic concurrency control techniques perform more efficiently than pessimistic techniques when there is low contention for the data and low resource utilization. Otherwise pessimistic techniques perform better. Because the designer of a database system can rarely predict data contention and resource utilization, it is desirable that a database system adaptively select a concurrency control technique at runtime.

We present an algorithm for partitioning the collection of active database transactions into a set of clusters. The partitioning algorithm guarantees that there are no data conflicts between transactions to distinct clusters. Different concurrency control techniques can be applied in distinct clusters. Our algorithm uses the number of transactions in a cluster as a measure of data contention. Transactions in newly formed clusters are handled by an optimistic scheduler. When the number of transactions in a cluster exceeds a certain threshold, the cluster becomes pessimistic. Such a cluster's current transactions complete, and then newly entering transactions can begin, managed by a pessimistic scheduler.

We have designed data structures to support the efficient maintenance of clusters. We have also begun to develop a theory of correct cluster configurations. We are undertaking a simulation study to compare the performances of pessimistic techniques, optimistic techniques, and our adaptive approach.

Reference

[1]

Agrawal, R., M. J. Carey, and M. Livny, Models for Studying Concurrency Control Performance: Alternatives and Implications, ACM SIGMOD Conference, 1985, pages 108-121.

Digital Library

Google Scholar

Index Terms

An adaptive concurrency control algorithm (abstract)

Recommendations

Semantics-based concurrency control: beyond commutativity

The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency ...
Rethinking serializable multiversion concurrency control

Multi-versioned database systems have the potential to significantly increase the amount of concurrency in transaction processing because they can avoid read-write conflicts. Unfortunately, the increase in concurrency usually comes at the cost of ...
Commutativity-Based Concurrency Control for Abstract Data Types

Two novel concurrency algorithms for abstract data types are presented that ensure serializability of transactions. It is proved that both algorithms ensure a local atomicity property called dynamic atomicity. The algorithms are quite general, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

CSC '90: Proceedings of the 1990 ACM annual conference on Cooperation

January 1990

475 pages

ISBN:0897913485

DOI:10.1145/100348

Chairman:
Arun Sood
George Mason Univ., Fairfax, VA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

CSC90

Sponsor:

CSC90: 18th Annual ACM Computer Science Conference

February 20 - 22, 1990

D.C., Washington, USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
208
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Semantics-based concurrency control: beyond commutativity

Rethinking serializable multiversion concurrency control

Commutativity-Based Concurrency Control for Abstract Data Types