A serialization graph construction for nested transactions

Alan Fekete, Nancy Lynch, William E. Weihl
1990 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '90  
This paper makes three contributions. First, we present a proof technique that offers system designers the same ease of reasoning about nested transaction systems as is given by the classical theory for systems without nesting, and yet can be used to verify that a system satisfies the robust "user view" definition of correctness of [lo]. Second, as applications of the technique, we verify the correctness of Moss' read/write locking algorithm for nested transactions, and of an undo logging
more » ... thm that has not previously been presented or proved for nested transaction systems. Third, we make explicit the assumptions used for this proof technique, assumptions that are usually made implicitly in the classical theory, and therefore we clarify the type of system for which the classical theory itself can reliably be used. 1 'As discussed in [16], aborts must be modeled explicitly to ana lyze the subtle interactions between concurrency control and recovery. Because it does not model aborts explicitly, and implicitly assumes an "update-in-place" model for recovery, the classical theory is not general enough to model certain kinds of algorithms.
doi:10.1145/298514.298547 dblp:conf/pods/FeketeLW90 fatcat:vnsncxwt65b4vflgfyye56sto4