Atomicity and isolation for transactional processes

被引:85
作者
Schuldt, H [2 ]
Alonso, G
Beeri, C
Schek, HJ
机构
[1] Hebrew Univ Jerusalem, Sch Engn & Comp Sci, IL-91904 Jerusalem, Israel
[2] Swiss Fed Inst Technol, ETH Zurich, Dept Comp Sci, ETH Zentrum, CH-8092 Zurich, Switzerland
来源
ACM TRANSACTIONS ON DATABASE SYSTEMS | 2002年 / 27卷 / 01期
关键词
algorithms; design; reliability; advanced transaction models; business process management; electronic commerce; execution guarantees; locking; rocesses; semantically rich transactions; transactional workflows; unified theory of concurrency control and recovery;
D O I
10.1145/507234.507236
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Processes are increasingly being used to make complex application logic explicit. Programming using processes has significant advantages but it poses a difficult problem from the system point of view in that the interactions between processes cannot be controlled using conventional techniques. In terms of recovery, the steps of a process are different from operations within a transaction. Each one has its own termination semantics and there are dependencies among the different steps. Regarding concurrency control, the flow of control of a process is more complex than in a flat transaction. A process may, for example, partially roll back its execution or may follow one of several alternatives. In this article, we deal with the problem of atomicity and isolation in the context of processes. We propose a unified model for concurrency control and recovery for processes and show how this model can be implemented in practice, thereby providing a complete framework for developing middleware applications using processes.
引用
收藏
页码:63 / 116
页数:54
相关论文
共 52 条
[41]  
Thomas R. H., 1979, ACM Transactions on Database Systems, V4, P180, DOI 10.1145/320071.320076
[42]  
Türker C, 2000, LECT NOTES COMPUT SC, V1832, P122
[43]  
TYGAR D, 1998, P 24 INT C VER LARG, P1
[44]   Unifying concurrency control and recovery of transactions with semantically rich operations [J].
Vingralek, R ;
Hasse-Ye, H ;
Breitbart, Y ;
Schek, HJ .
THEORETICAL COMPUTER SCIENCE, 1998, 190 (02) :363-396
[45]  
WACHTER H, 1992, DATABASE T MODELS AD, P219
[46]  
WACHTER H, 1991, P 36 IEEE COMP SOC I, P574
[47]  
WACHTER H, 1996, THESIS U STUTTGART S
[48]   COMMUTATIVITY-BASED CONCURRENCY-CONTROL FOR ABSTRACT DATA-TYPES [J].
WEIHL, WE .
IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (12) :1488-1505
[49]  
WEIKUM G, 1992, DATABASE T MODELS AD, P515
[50]  
ZHANG A, 1994, P ACM SIGMOD INT C M, P67