Garcia--Molina, H., Salem, K., Sagas, ACM SIGMOD Conference, 1987 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Multi-Level Recovery - Weikum, Hasse, Broessler, al. (1990) (22 citations) (Correct)
....presented algorithm has been implemented in the DASDBS database kernel system. 1. The Impact of Multi Level Concurrency Control on Recovery Multi level transactions have received considerable attention as a framework for designing and analyzing high performance concurrency control methods [BBG89, BSW88, CFR89, FLMW88, GS87, HH88, Ma87, MGG86, RGN90, SG88, Wei86, Wei87b]. A multi level transaction is a special kind of nested transaction, namely a balanced tree of actions in which all nodes at the same depth correspond to operations of the same level of abstraction in a data management system. The edges in a transaction tree represent the implementation of an ....
Garcia--Molina, H., Salem, K., Sagas, ACM SIGMOD Conference, 1987
Extending Transaction Management To Capture More Consistency With .. - Weikum (1993) (4 citations) (Correct)
.... [Ag90, TS89] Petri net specifications (see, e.g. Pe81, Ge87] and conceptual modeling of business processes as well as information dynamics (see, e.g. BR84, CKO92, KS91, Olle88, RFB88, RR82] Research in this category of transactional workflows includes, for example, variations of Sagas [GS87, Ga90] (see also [Wa84] ConTracts [WR92, 5 RSW92, G 93] Flex(ible) Transactions [ELLR90, Buk92, KPE92, LEB92] the Acta framework [CR90, CR91, CR92] the DOM model [Bu92, GHK93] and other models of long running activities [DHL90, DHL91, No93] transaction dependency rules [Kl91, Ch91, Ja93] and ....
....T1 and T2become isolated trees, where T1 follows T2. Thenwe can prune the loan request operation level, and have eventually shown that the original schedule is equivalent to the serial execution with T2 preceding T1. This semantic transaction model subsumes the relaxed isolation model of Sagas [GS87] and most workflow models as a special case. Assume that all operations that can possibly be invoked by the transaction roots are specified as compatible; so there are no conflicts between top level operations. In this case (and only under these conditions) transactions correspond to Sagas, and ....
Garcia--Molina, H., Salem, K., Sagas, ACM SIGMOD Conference, 1987
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC