Summary
A concurrency control mechanism (or a scheduler) is the component of a database system that safeguards the consistency of the database in the presence of interleaved accesses and update requests. We formally show that the performance of a scheduler, i.e., the amount of parallelism that it supports, depends explicitly upon the amount of information that is available to the scheduler. We point out that most previous work on concurrency control is simply concerned with specific points of this basic trade-off between performance and information. In fact, several of these approaches are shown to be optimal for the amount of information that they use.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bernstein, P.A., Goodman, N., Rothnie, J.B., Papadimitriou, C.H.: A System of Distributed Databases (the Fully Redundant Case). IEEE Trans. Software Engrg. SE-4, 154–168 (1978)
Eswaran, K.P., Gray, J.N., Lorie, R.A., Traiger, I.L.: The Notions of Consistency and Predicate Locks in a Database System. Comm. ACM 19 (11), 624–633 (1976)
Kung, H.T., Lehman, P.L.: Concurrent Manipulation of Binary Search Trees. ACM Trans. Database Syst. 5(3), 354–382 (1980) An extended abstract appears in the Proceedings of the Fourth International Conference on Very Large Databases, 1978
Lamport, L.: Towards a Theory of Correctness for Multi-user Data Base Systems. Technical Report CA-7610-0712, Massachusetts Computer Associates, Inc., 1976
Manna, Z.: Mathematical Theory of Computation. New York: McGraw-Hill, 1974
Papadimitriou, C.H.: The Serializability of Concurrent Updates. J. ACM 26(4), 631–653 (1979)
Silberschatz, A., Kedem, Z.: Consistency in Hierarchical Database Systems. J. ACM 27(1), 72–80 1980
Stearns, R.E., Lewis, P.M. II, Rosenkrantz, D.J.: Concurrency Control for Database Systems. In: Proc. Seventh Annual Symposium on Foundations of Computer Science, IEEE, pp. 19–32, 1976
Yannakakis, M., Papadimitriou, C.H., Kung, H.T.: Locking Policies: Safety and Freedom from Deadlock. In: Proceedings of Twentieth Annual Symposium on Foundations of Computer Science, IEEE, pp. 286–297, 1979
Author information
Authors and Affiliations
Additional information
This research is supported in part by the National Science Foundation under Grants MCS 75-222-55. MCS 77-01193. MCS 77-05314. the Office of Naval Research under Contract N00014-76-C-0370. and a Miller Fellowship
Rights and permissions
About this article
Cite this article
Kung, H.T., Papadimitriou, C.H. An optimality theory of concurrency control for databases. Acta Informatica 19, 1–11 (1983). https://doi.org/10.1007/BF00263925
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00263925