Abstract
Locking is considered as a means to achieve serializable schedules of concurrent transactions. Transactions are assumed to be predeclared such that a pre-analysis for locking becomes feasible to increase concurrency. A condition for safety is introduced which, based on a pre-analysis, allows the design of policies strictly dominating known policies such as 2-phase locking. The static case, in which the complete set of transactions is known in advance, and the online case, in which a transaction is known when it is started, are considered. It is shown that a policy strictly dominating 2-phase locking and some other interesting pre-analysis policies can also be applied in an online environment.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bernstein, P.A., Hadzilacos, V., Goodman, N. (1987), “Concurrency control and recovery in database systems”, Addison Wesley.
Bernstein, P.A., Shipman, D.W., Rothnie, J.B. (1980), “Concurrency control in a system for distributed databases (SDD1)”, ACM Trans. Database Systems 5, 18–51.
Casanova, M.A., Bernstein, P.A. (1980), “General purpose schedulers for database systems,” Acta Informatica 14, 195–220.
Eswaran, K.P., Gray, J.N., Lorie, R.A., and Traiger, I.L. (1976), “The notions of consistency and predicate locks in a database system,” Comm. Assoc. Comput. Mach. 19, 624–633.
Katoh, N., Ibaraki, T., and Kamada, T. (1985), “Cautious transaction schedulers with admission control,” ACM Trans. Database Systems 10, 205–229.
Lausen, G., Soisalon-Soininen, E., and Widmayer, P. (1986), “Pre-analysis locking,” Information and Control 70, 193–215.
Lausen, G., Soisalon-Soininen, E., and Widmayer, P. (1986), “Towards online schedulers based on pre-analysis locking,” Proc. Int. Conf. Database Theory, Lecture Notes in Computer Science 243, Springer Verlag, 242–259.
Lausen, G., Soisalon-Soininen, E., and Widmayer, P., “On the power of safe locking,” Journal of Computer and System Sciences, to appear.
Papadimitriou, C.H. (1986), “Database concurrency control”, Computer Science Press.
Papadimitriou, C.H. (1979), “Serializability of concurrent database updates,” J. Assoc. Comput. Mach. 26, 631–653.
Papadimitriou, C.H. (1982), “A theorem in database concurrency control,” J. Assoc. Comput. Mach. 29, 998–1006.
Papadimitriou, C.H. (1983), “Concurrency control by locking,” SIAM J. Comput. 12, 215–226.
Wolfson, O. (1986), “An algorithm for early unlocking of entities in database transactions,” J. Algorithms 7, 146–156.
Wolfson, O. (1987), “The virtues of locking by symbolic names,” J. Algorithms 8, 536–556.
Yannakakis, M. (1982), “A theory of safe locking policies in database systems,” J. Assoc. Comput. Mach. 29, 718–740.
Yannakakis, M. (1984), “Serializability by locking,” J. Assoc. Comput. Mach. 31, 227–244.
Yannakakis, M., Papadimitriou, C.H., Kung, H.T. (1979), “Locking policies: Safety and freedom from deadlock,” Proc. 20th IEEE Sympos. Found. of Comput. Sci., 286–297.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lausen, G., Soisalon-Soininen, E. (1989). Locking policies and predeclared transactions. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_21
Download citation
DOI: https://doi.org/10.1007/3-540-51251-9_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51251-6
Online ISBN: 978-3-540-46182-1
eBook Packages: Springer Book Archive