Abstract
Locking is one familiar mechanism for a database concurrency control to achieve safe transaction systems. Pre-Analysis Locking bases on an algorithm which analyses a set of transactions to determine the conflicting actions. Different to known locking policies, e.g. 2-Phase Locking, the position of lock operations depends only on the location of the conflicting actions within the transactions. Therefore, depending on the structure of the transactions, Pre-Analysis Locking allows for a higher potential degree of concurrency than 2-Phase Locking. Until now Pre-Analysis Locking requires the knowledge of the complete set of transactions to be executed in advance. In this paper, iterative Pre-Analysis Locking is proposed, which manages the case of previously unknown transactions. Further, dynamic Pre-Analysis Locking is introduced, which additionally is able to forget finished transactions and therefore is an appealing new approach to online scheduling. Safety of the policies is proven and the issue of deadlock freedom is discussed.
The work of this author was supported by the Alexander von Humboldt Foundation.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bayer, R., Heller, H., Reiser, A. (1980), “Parallelism and recovery in database systems,” ACM Trans. Database Syst. 5, 139–156.
Beeri, C., Bernstein, P.A., Goodman, N., Lai, M.Y., Shasha, D.E. (1983), “A concurrency control theory for nested transactions,” Proc. 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing
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.
Kedem, Z., and Silberschatz, A. (1980), “Non-two phase locking protocols with shared and exclusive locks,” Proc. Int. Conf. Very Large Databases.
Korth, H.F. (1983), “Locking primitives in a database system,” J. Assoc. Comput. Mach. bf 30, 55–79.
Lausen, G., Soisalon-Soininen, E., and Widmayer, P. (1985), “Pre-Analysis Locking: a safe and deadlock free locking policy,” Proc. Int. Conf. Very Large Databases.
Lausen, G., Soisalon-Soininen, E., and Widmayer, P. (1986), “Pre-Analysis Locking,” Information and Control to appear 1986.
Lipski, W., and Papadimitriou, C.H. (1981), “A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems,” Journal of Algorithms 2, 211–226.
Ottmann, Th., Soisalon-Soininen, E., and Wood, D. (1984), “On the definition and computation of rectilinear convex hulls,” Information Sciences 33, 157–171.
Papadimitriou, C.H. (1979), “Serializability of concurrent database updates,” J. Assoc. Comput. Mach. 26, 631–653.
Papadimitriou, C.H. (1983), “Concurrency control by locking,” SIAM J. Comput. 12, 215–226.
Schlageter, G. (1978), “Process synchronization in database systems,” ACM Trans. Database Syst. 3, 248–271.
Silberschatz, A., and Kedem, Z. (1980), “Consistency in hierarchical database systems,” J. Assoc. Comput. Mach. 27), 72–80.
Weikum, G. (1986), “A theoretical foundation of multilevel concurrency control,” ACM SIGACT-SIGMOD Symp. on Principles of Database Systems.
Yannakakis, M. (1982), “A theory of safe locking policies,” J. Assoc. Comput. Mach. 29, 718–740.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lausen, G., Soisalon-Soininen, E., Widmayer, P. (1986). Towards online schedulers based on Pre-Analysis Locking. In: Ausiello, G., Atzeni, P. (eds) ICDT '86. ICDT 1986. Lecture Notes in Computer Science, vol 243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17187-8_40
Download citation
DOI: https://doi.org/10.1007/3-540-17187-8_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17187-4
Online ISBN: 978-3-540-47346-6
eBook Packages: Springer Book Archive