Abstract
Transaction rollback is a significant performance liability in database systems, and will become increasingly important as the number of concurrent transactions in a database system increases. To minimize or eliminate rollback, several database systems using locking protocols require that the database be structured as a directed acyclic graph. Yannakakis (11) and Fussell (4) have given complete characterizations useful in proving that given protocol is free from transaction rollback. Howeyer, it is difficult to use these conditions to construct new protocols that are either rollback free or allow only non-cascading rollback. New protocols to minimize rollback are especially important in databases structured as arbitrary graphs, since the only published protocol for these databases can cause cascading rollback. In this paper we give a constructive characterization for a protocol to ensure either no rollback or only non-cascading rollback in arbitrarily structured graphs. We show that these conditions drastically simplify the proofs of rollback behavior of existing protocols, and use it to construct a new simple rollback protocol that operates in arbitrary databases.
This research was partially supported by NSF Grant Number MCS 81-04017 and by ONR Contract N00014-80-K0987.
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., Shipman, D., and Rothnie Jr, J. "Concurrency Control in a System for Distributed Databases (SDD-1)." ACM Transactions on Database Systems 5, 1 (March 1980), 18–51.
Buckley, G. and Silberschatz, A. "Beyond Two Phase Locking." Journal of the ACM ((to appear)).
Eswaran, K.P., Gray, J.N., Lorie, R.A., Traiger, I.L. "The Notions of Consistency and Predicate Locks in a Database System." Communications of the ACM 10, 11 (Nov. 1976), 624–723.
Fussell, D.S., Kedem, Z., Silberschatz, A. A Theory of Correct Protocols for Database Systems. Proc. Seventh International Conference on Very Large Data Bases, Sept., 1981.
Kedem, Z., Silberschatz, A. Controlling Concurrency Using Locking Protocols. Proc. Twentieth IEEE Symposium on Foundations of Computer Science, IEEE, Oct., 1979, pp. 274–285.
Kedem, Z., Silberschatz, A. Non-Two-Phase Locking Protocols with Shared and Exclusive Locks. Proc. Sixth International Conference on Principles of Database Systems, March, 1982.
Mohan, C., Fussell, D., Silberschatz, A. Compatibility and Commutativity in Non-Two-Phase Locking Protocols. Proc. Conf. on Principles of Database Systems, March, 1982.
Silberschatz, A., Kedem, Z. "Consistency in Hierarchical Database Systems." Journal of the ACM 27, 1 (Jan. 1980), 72–80.
Stearns, R., Lewis, P.M., Rosenkrantz, D.J. Concurrency Control for Database Systems, Proc. Twelfth IEEE Symp. on Foundations of Computer Science, Oct., 1976, pp. 19–32.
Yannakakis, M., Papadimitriou, C., Kung, H.T. Locking Protocols: Safety and Freedom from Deadlocks. Proc. Twentieth IEEE Symp. on Foundations of Computer Science, Oct., 1979, pp. 286–297.
Yannakakis, M. "Deadlock in Locking Policies," Siam Journal of Computing 11, 2 (May 1982), 391–408.
Yannakakis, M. "A Theory of Saft Locking Policies in Database Systems." Journal of the ACM 29, 4 (July 1982), 718–740.
Berge, C. Graphs & Hypergraphs, North Holland, Amsterdam.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buckley, G.N., Silberschatz, A. (1984). Eliminating cascading rollback in structured databases. In: Joseph, M., Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1984. Lecture Notes in Computer Science, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13883-8_81
Download citation
DOI: https://doi.org/10.1007/3-540-13883-8_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13883-9
Online ISBN: 978-3-540-39087-9
eBook Packages: Springer Book Archive