Abstract
Purchase PDF (2382 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (10)
Purchase PDF (1815 K)
doi:10.1016/0022-0000(91)90031-Y 
Copyright © 1991 Published by Elsevier Science (USA).
Hybrid concurrency control for abstract data types
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Received 5 August 1988;
Abstract
Databases and other transaction-processing systems use concurrency control and recovery algorithms to ensure that transactions are atomic (i.e., serializable and recoverable). We present a new algorithm based on locking that permits more concurrency than existing commutativity-based algorithms. The algorithm exploits type-specific properties of objects; necessary and sufficient constraints on lock conflicts are derived directly from a data type specification. In addition, the algorithm permits operations to be both partial and non-deterministic, and it permits the lock mode for an operation to be determined by its results as well as its name and arguments. We give a complete formal description of the algorithm, encompassing both concurrency control and recovery, and prove that the algorithm satisfies hybrid atomicity, a local atomicity property that combines aspects of static and dynamic atomic algorithms. We also show that the algorithm is optimal in the sense that no hybrid atomic locking scheme can permit more concurrency.
Article Outline
* Supported by the Defense Advanced Research Projects Agency (DOD), ARPA Order No. 4976, monitored by the Air Force Avionics Laboratory Under Contract F33615-84-K-1520.
† Supported in part by the National Science Foundation under Grants DCR-8510014 and CCR-8716884, and in part by the Defense Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125.
