Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1979)
Received May
K. Eswaran, J. Gray, R. Lorie, I. Traiger (1976)
The notions of consistency and predicate locks in a database systemCommun. ACM, 19
R. Stearns, P. Lewis, D. Rosenkrantz (1976)
Concurrency control for database systems17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
H. Kung, P. Lehman (1980)
Concurrent manipulation of binary search treesACM Trans. Database Syst., 5
(1976)
Towards a theory of correctness for multi-user data base systems
H. Kung, C. Papadimitriou (1979)
An optimality theory of concurrency control for databasesActa Informatica, 19
J. Gray (1978)
Notes on Data Base Operating Systems
B. Samadi (1976)
B-Trees in a System with Multiple UsersInf. Process. Lett., 5
P. Lehman, Bing Yao (1981)
Efficient locking for concurrent operations on B-treesACM Trans. Database Syst., 6
C. Papadimitriou (1979)
The serializability of concurrent database updatesJ. ACM, 26
(1978)
Multiple access to B-trees
(1977)
Computational problems related to database 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
ACM Transactions on Database Systems (TODS) – Association for Computing Machinery
Published: Jun 1, 1981
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.