Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On optimistic methods for concurrency control

On optimistic methods for concurrency control On Optimistic Control Methods for Concurrency H.T. KUNG and JOHN T. ROBINSON Carnegie-Mellon University Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are œoptimistic  in the sense that they rely mainly on transaction backup as a control mechanism, œhoping  that conflicts between transactions will not occur. Applications for which these methods should be more efficient than locking are discussed. Key Words and Phrases: databases, concurrency CR Categories: 4.32, 4.33 controls, transactionprocessing 1. INTRODUCTION Consider the problem of providing shared access to a database organized as a collection of objects. We assume that certain distinguished objects, called the roots, are always present and access to any object other than a root is gained only by first accessing a root and then following pointers to that object. Any sequence of accesses to the database that preserves the integrity constraints of the data is called a transaction (see, e.g., [4]). If our goal is to maximize the throughput of accesses to the database, then there are at least two cases where highly concurrent access http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Database Systems (TODS) Association for Computing Machinery

On optimistic methods for concurrency control

Loading next page...
 
/lp/association-for-computing-machinery/on-optimistic-methods-for-concurrency-control-oHdpe4vc00

References (12)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1981 by ACM Inc.
ISSN
0362-5915
DOI
10.1145/319566.319567
Publisher site
See Article on Publisher Site

Abstract

On Optimistic Control Methods for Concurrency H.T. KUNG and JOHN T. ROBINSON Carnegie-Mellon University Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are œoptimistic  in the sense that they rely mainly on transaction backup as a control mechanism, œhoping  that conflicts between transactions will not occur. Applications for which these methods should be more efficient than locking are discussed. Key Words and Phrases: databases, concurrency CR Categories: 4.32, 4.33 controls, transactionprocessing 1. INTRODUCTION Consider the problem of providing shared access to a database organized as a collection of objects. We assume that certain distinguished objects, called the roots, are always present and access to any object other than a root is gained only by first accessing a root and then following pointers to that object. Any sequence of accesses to the database that preserves the integrity constraints of the data is called a transaction (see, e.g., [4]). If our goal is to maximize the throughput of accesses to the database, then there are at least two cases where highly concurrent access

Journal

ACM Transactions on Database Systems (TODS)Association for Computing Machinery

Published: Jun 1, 1981

There are no references for this article.