An Object-Oriented Transaction Model

In object-oriented database systems(OODBSs),the traditional transaction models are no longer suit- able because of the difference between the object-oriented data model(OODM)and the conventional da- ta models(e.g.relational data model).In this paper,transaction models for advanced databuse applica- tions are reviewed and their shortcomings are analyzed.Exchangeability of operations is proposed in- stead of commuativity and recoverability for using more semantics in transaction management.As a result,an object-oriented transaction model(in short,OOTM)is presented.It is not modeled for some special application,but directly based on object-oriented paradigms.A transaction is regarded as an interpretation of a method.Each transaction(even subtransactions)keeps relative ACID(Atomicity, Consistency,Isolation,Durability )properties,therefore the special problems appearing in OODBSs such as“long transactions”,“visibility of inconsistent database state”can be solved.

Ensuring consistency of Web services transaction

Composite Web services provide promising prospects for conducting cross-organizational Web service transactions. Such transactions generally require longer processing time and manipulate financially critical data. To efficiently manage these Web services transactions, isolation is commonly relaxed, but inconsistency will be caused by concurrently executing isolation-relaxing transactions. This article proposes an extension to the WS-Business Activity Protocol, which ensures the consistent executions of isolation-relaxing Web service transactions, and which is based on transaction dependency graphs distributed over multiple nodes. Furthermore, this article presents several algorithms implementing the protocol, and introduces the implement of a prototype system.

Pessimistic Predicate/Transform Model for Long Running Business Processes

Many business processes in enterprise applications are both long running and transactional in nature. However, no current transaction model can provide full transaction support for such long running business processes. This paper proposes a new transaction model, the pessimistic predicate/transform (PP/T) model, which can provide full transaction support for long running business processes. A framework was proposed on the enterprise JavaBeans platform to implement the PP/T model. The framework enables application developers to focus on the business logic, with the underlying platform providing the required transactional semantics. The development and maintenance effort are therefore greatly reduced. Simulations show that the model has a sound concurrency management ability for long running business processes.