Eliminating cascading rollback in structured databases

  • Gael N. Buckley
  • A. Silberschatz
Session 6 Data Bases
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)


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.


Database System Data Item Directed Acyclic Graph Arbitrary Graph Database Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    Buckley, G. and Silberschatz, A. "Beyond Two Phase Locking." Journal of the ACM ((to appear)).Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Kedem, Z., Silberschatz, A. Controlling Concurrency Using Locking Protocols. Proc. Twentieth IEEE Symposium on Foundations of Computer Science, IEEE, Oct., 1979, pp. 274–285.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    Mohan, C., Fussell, D., Silberschatz, A. Compatibility and Commutativity in Non-Two-Phase Locking Protocols. Proc. Conf. on Principles of Database Systems, March, 1982.Google Scholar
  8. 8.
    Silberschatz, A., Kedem, Z. "Consistency in Hierarchical Database Systems." Journal of the ACM 27, 1 (Jan. 1980), 72–80.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    Yannakakis, M. "Deadlock in Locking Policies," Siam Journal of Computing 11, 2 (May 1982), 391–408.Google Scholar
  12. 12.
    Yannakakis, M. "A Theory of Saft Locking Policies in Database Systems." Journal of the ACM 29, 4 (July 1982), 718–740.Google Scholar
  13. 13.
    Berge, C. Graphs & Hypergraphs, North Holland, Amsterdam.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Gael N. Buckley
    • 1
  • A. Silberschatz
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustin

Personalised recommendations