Christian Colombo, Gordon J. Pace · OAR@UM (University of Malta) · 2011
The scenario of business computer systems changed with the advent of cross-entity computer interactions: computer systems no longer had the limited role of storing and processing data, but became themselves the players which actuated real-life actions. These advancements rendered the traditional transaction mechanism insufficient to deal with these new complexities of longer multi-party transactions. The concept of compensations has long been suggested as a solution, providing the possibility of executing “counter”-actions which semantically undo previously completed actions in case a transaction fails. There are numerous design options related to compensations particularly when deciding the strategy of ordering compensating actions. Along the years, various models which include compensations have emerged, each tackling in its own way these options. In this work, we review a number of notations which handle compensations by going through their syntax and semantics — highlighting the distinguishing features — and encoding a typical compensating transaction example in terms of each of these notations.
Cited by 2Open access
S. Hayden Lesbirel · Australian Journal of Political Science · 2003
This article explores the nature, role and effectiveness of compensation mechanisms in managing the political constraints to the siting or development of nuclear projects in Japan. Statistical analysis reveals that the relationship between compensation and income is a key dynamic characterising the history of the marketplace for nuclear facilities in Japan. The commodification and trading of risks for benefits is governed by a sophisticated institutional and policy framework which acts to lower the transaction costs of market exchange. The interaction between the market and the institutional dynamic has generated a curious pattern of both NIMBY ('not in my backyard') and YIMBY ('yes, in my backyard') responses to nuclear development in Japan.
Cited by 19
Feilong Tang, Minyi Guo, Minglu Li et al. · 2009
Transaction management in Grids is responsible for ensuring the reliable execution of inherently distributed Grid applications. Grid transaction management is different from existing distributed transaction models because Grid resources are highly autonomous, dynamic and heterogeneous. This paper proposes a Grid transaction service (GridTS) and coordination algorithms that manage short-lived and long-lived Grid transactions respectively, providing reliability support for Grid applications. Unlike existing long-lived transaction models that require application programmers to develop compensating transactions, the GridTS can automatically generate compensating transactions during the execution of long-lived Grid transactions. The feasibility of GridTS and the effectiveness of proposed coordination algorithms are demonstrated through simulation studies.
Cited by 14
Azer Bestavros, Sue Nagy · 1996
We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task and a compensating task. The execution requirements of the primary task are not known a priori, whereas those of the compensating task are known a priori. Upon the submission of a transaction, an Admission Control Mechanism is employed to decide whether to admit or reject that transaction. Once admitted, a transaction is guaranteed to nish executing before its deadline. A transaction is considered to have nished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its compensating task is completed (safe termination). Committed transactions bring a pro t to the system, whereas a terminated transaction brings no pro t. The goal of the admission control and scheduling protocols (e.g. concurrency control, I/O scheduling, memory management) employed in the system is to maximize system pro t. We describe a number of admission control strategies and contrast (through simulations) their relative performance.
Cited by 0
Juha Puustjärvi · 2007
A useful feature of Web services is that new and more complex Web services can be composed of other Web services. However, in many cases composed web services are useful only if they can be processed atomically. The (semantic) atomicity of composed Web services is ensured in a similar way as with advanced transaction models which use compensating transactions to undo the effects of successfully executed subtransactions. However, a problem of such compensation is that it has two contradicting semantics: from local point of view the subtransaction is like any single transaction while from global point of view it is a subtransaction of a distributed transaction having the mutual atomicity dependencies. As a result executing compensating transaction may cause problems, e.g., the cancellation of the hotel reservation may give rise for a special charge. In order to achieve shared understanding of transactions' semantics we have developed a transaction ontology to be used in the Web. In this paper we explain how it should be used in information exchange between Web services. In addition we present our developed CWS-Transaction model (Composed Web Service Transaction model), which censures the atomicity of composed Web services but does not use compensating transactions at all. We also illustrate how CWS-transactions can be processed by a workflow engines based on BPEL4WS-code.
Cited by 0
Wenbing Zhao, Firat Kart, L.E. Moser et al. · Advances in web services research series/Advances in web services research (AWSR) book series · 2010
This chapter describes a novel reservation-based extended transaction protocol for coordination of tasks within a business activity. With the advance of Web Services, it is anticipated that the implementation of business activities as Web Services, and the automation of business activities across multiple enterprises over the Internet, will become a reality. Classical extended transaction protocols are not well suited for this new breed of business activity, because of their use of compensating transactions. The reservation-based extended transaction protocol, described in this chapter, eliminates the need for compensating transactions by using an explicit reservation phase and an explicit confirmation/cancellation phase. This chapter provides a mapping of the reservation-based extended transaction protocol onto the Web Services Coordination Specification, and describes an implementation of the protocol.
Cited by 0
Feilong Tang, Ilsun You, Li Li et al. · International Journal of Web and Grid Services · 2011
In web service environments, long transactions need to lock resources – often database services – for a long time during their long execution duration. This would bring down the performance of transaction processing systems. The transaction compensation is a feasible solution through allowing sub-transactions to independently commit, however, it is not able to speed up the transaction processing. This paper proposes a novel pipeline-based transaction processing (PLbTP) model for Serial Long Transactions (SLTs), which parallelises the transaction processing to reduce the transaction execution duration. Furthermore, we design a time-stamp-based deadlock prevention mechanism for the control of multiple concurrent transactions. The simulation results demonstrate that our approach can significantly improve performance of SLTs without the aid of compensating transactions.
Cited by 2
Liu, Chengfei, Orlowska, Maria E., Zhou, Xiaofang et al. · Swinburne Research Bank (Swinburne University of Technology) · 1999
The notion of a compensation is widely used in advanced transaction models as means of recovery from a failure. Similar concepts are adopted for providing 'transaction-like' behaviour for long business processes supported by workflows technology. Generally, designing a compensating task in the context of a workflow process is a non-trivial job. In fact, not every task is compensatable. This work contributes to the study of the non-compensatability problem. A compensating task C of a task T semantically undoes the effect of T after T has been committed. For example, the compensating task of a deposit is a withdrawal. For a task to be compensatable, it must satisfy two conditions. Forcibility: The compensating task of the task must be forcible. In other words, after the task commits, the execution of its compensating task is guaranteed to succeed by the application semantics. Relaxation of isolation: The isolation requirement of the shared data resources which the task may access must be relaxed. This relaxation is required as the purpose of introducing compensation is to avoid long-duration waiting, otherwise, compensation may become useless. In this work, we carefully investigate the properties of shared resources and tasks which may be performed on these resources. As all its invoked operations must be compensatable as well if a task is compensatable, we only discuss the compensatability of operations defined on shared resources.
Cited by 0Open access
Liu, Chengfei, Orlowska, Maria E., Zhou, Xiaofang et al. · Figshare · 1999
The notion of a compensation is widely used in advanced transaction models as means of recovery from a failure. Similar concepts are adopted for providing 'transaction-like' behaviour for long business processes supported by workflows technology. Generally, designing a compensating task in the context of a workflow process is a non-trivial job. In fact, not every task is compensatable. This work contributes to the study of the non-compensatability problem. A compensating task C of a task T semantically undoes the effect of T after T has been committed. For example, the compensating task of a deposit is a withdrawal. For a task to be compensatable, it must satisfy two conditions. Forcibility: The compensating task of the task must be forcible. In other words, after the task commits, the execution of its compensating task is guaranteed to succeed by the application semantics. Relaxation of isolation: The isolation requirement of the shared data resources which the task may access must be relaxed. This relaxation is required as the purpose of introducing compensation is to avoid long-duration waiting, otherwise, compensation may become useless. In this work, we carefully investigate the properties of shared resources and tasks which may be performed on these resources. As all its invoked operations must be compensatable as well if a task is compensatable, we only discuss the compensatability of operations defined on shared resources.
Cited by 0Open access
Kənan FƏDANİ · Scientific Bulletin · 2025
This paper empirically evaluates the economic effects of artificial intelligence (AI)-based supply chain optimization in Azerbaijan’s oil and industrial enterprises using a transaction cost framework. Based on SOCAR data for 2018–2024, the study analyzes procurement volume dynamics, transaction cost ratios, and actual transaction cost amounts. While procurement volume increased by 19.9%, the transaction cost ratio declined by 26.2%, indicating structural efficiency gains. Correlation and regression analysis reveal a strong inverse relationship between procurement volume and transaction cost ratio (R² = 0.9771). The implementation of AI and digital coordination systems reduces information asymmetry, coordination costs, and contract enforcement expenses, compensating for operational complexity arising from scale expansion. The findings demonstrate that AI-driven supply chain optimization contributes to institutional efficiency and long-term structural economic performance in the energy sector.
Cited by 0Open access
Quanzhou Hu, Jia Liu, Yi Zhuang et al. · 2010 3rd International Conference on Biomedical Engineering and Informatics · 2010
Transaction of workflow systems composition has long-running feature which a global-transaction is divided into several sub-transactions. When the sub-transactions fail, it must back to the beginning of them, consistency property is preserved by using compensating transactions, which semantically undo the effects of the completed sub-transactions. However, the cost of compensation may be expensive and methods may be complex. To overcome this limitation, in this paper, a long-running transaction model named LTMBWF (Long-running transaction Model based on Workflow) is established. A novel scheduling algorithm named STCBCT (sub-transactions commit based on critical-transaction) is presented that and the resume algorithm is presented. The critical-transactions delay to commit as the cost of compensation is generally huge. Simulations show that STCBCT algorithm can confine the compensation sphere and reduce the cost of recovery.
Cited by 4
Majid Haghjoo, M. Papazoglou, Heinz Schmidt · 2002
Intelligent and cooperative information systems (ICIS) involve upgraded models for transaction support for large distributed data/knowledge intensive applications. The use of long-lived transactions results in the introduction of a flexible transaction model which employs weak integrity and optimistic commit mechanisms for transactions relying on compensating and contingency transactions to recover from potential semantic failures. An open-nested transaction model for ICIS is introduced. It provides linguistic facilities for defining and controlling long-lived complex transactions (comprising related units of work) by taking into account the semantics of distributed computations. The fact that the proposed transaction model is grafted on to an appropriately extended concurrent object-oriented programming language allows exhibiting a high degree of parallelism inherent in distributed transaction-oriented applications.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 4
Wenbing Zhao, L. E. Moser, P. M. Melliar-smith · 2008
With the advent of the new generation of Internet-based technology, in particular Web Services, the automation of business activities that are distributed across multiple enterprises becomes possible. Business activities are different from traditional transactions in that they are typically asynchronous, loosely-coupled and long-running. Therefore, extended transaction protocols are needed to coordinate business activities that span multiple enterprises. Existing extended transaction protocols typically rely on compensating transactions to handle exceptional conditions. In this paper we identify a number of issues with compensation-based extended transaction protocols, and describe a reservation-based extended transaction protocol that addresses those issues. Moreover, we define a set of properties, analogous to the ACID properties of traditional transactions, that are more appropriate for business activities that span multiple enterprises. In addition, we compare our reservation protocol with other extended transaction protocols for coordinating business activities, and present performance analyses and results.
Cited by 0
Esmail Sadeghi Hafshejani, Mahmood Deypir, Ali Broumandnia · Scientia Iranica · 2025
Microservice architectures are preferred for their scalability and flexibility, however, managing distributed transactions in these systems poses significant challenges, especially in terms of consistency and fault tolerance.To address these issues, this study evaluates two distinct approaches: Paxos, a consensus algorithm that ensures agreement among distributed nodes, and the enhanced Saga pattern, a transaction coordination framework that manages local transactions with compensating actions. We implemented both methods in a microservice-based application deployed across distributed nodes and assessed their performance under various load conditions and failure scenarios. The results show that integrating Paxos significantly improves throughput and reduces latency, offering strong consistency and robust fault tolerance. In contrast, the enhanced Saga pattern, while effective in managing compensating transactions and maintaining eventual consistency, demonstrated lower performance in high-load environments. These findings highlight the trade-offs between consensus-based and coordination-based transaction management in microservice architectures and provide practical insights for system designers seeking scalable and reliable solutions.
Cited by 0Open access
Manel Djerou, Okba Tibermacine · 2022
Microservices is an architectural style that enables the design of applications as series of services independent from each other in function, maintainability, deployability and scalability. Two phase commit protocol as an example of classical distributed transaction protocols are not suitable for this pattern. These protocols require all participants in a transaction to commit or roll back before the transaction can proceed. This is way saga was chosen to replace 2PC. Saga is a mechanism that belongs to the ‘database per service’ pattern and which guarantees distributed transactions that covers many services. The saga pattern provides transaction management using a sequence of local transactions. Saga can be rolled back by a compensating transaction that ensures one of two possibilities all operations complete successfully or the corresponding compensation transactions are run to undo the change. In this paper, we try to run a verification of saga using the maude language. We use the Saga protocol by orchestration, and we present a verification way to check it.
Cited by 2
Guo Chang · 2009
Transaction of service composition has long-lived feature which a global-transaction is divided into several distributed sub-transactions. Atomicity property is preserved by using compensating transactions, which semantically undo the effects of the completed sub-transactions, in case of global-transaction abort. However, the cost of compensation may be expensive and methods may be complex. To overcome this limitation, a novel scheduling algorithm named STCD (SubTransaction committing delay) is presented based on analysis of compensation. Different from traditional methods, sub-transactions determine the time of committing according to both the cost of compensation and the state of execution dynamically. The correctness of proposed algorithm is proved. Simulations show that STCD algorithm can confine the compensation sphere and reduce the cost of compensation.
Cited by 1
Sanjay Kumar Madria, Malik Ayed Tubaishat · 2007
. In this paper, we present a version of the linear hash structure algorithm to increase concurrency using multi-level transaction model. We exploit the semantics of the linear hash operations at each level of nesting to allow more concurrency. We consider locks at both vertex (page) and key level (tuple) to further increase concurrency. As undo based recovery is not possible with multi-level transactions and therefore, we have used compensating based undo to achieve atomicity. 1. Introduction Weikum presented a multi-level transaction model [1,18], which has received considerable attention for designing high performance transaction processing and concurrency control algorithms [2,15,16,]. The multi-level transaction model takes into account the commutative properties of the semantics of operations at each level of data abstraction to achieve a high degree of concurrency. If two operations at the same high level commute then their conflicting descendants at the same lower level will ...
Cited by 0
Wenbing Zhao Cleveland, Wenbing Zhao · 2008
Traditional transaction semantics are not appropriate for business activities that involve long-running transactions in a loosely-coupled distributed environment, in particular, for Web Services that operate between different enterprises over the Internet. In this paper we describe a novel reservation-based extended transaction protocol that can be used to coordinate such business activities. The protocol avoids the use of compensating transactions, which can result in undesirable effects. In our protocol, each task within a business activity is executed as two steps. The first step involves an explicit reservation of resources. The second step involves the confirmation or cancellation of the reservation. Each step is executed as a separate traditional short-running transaction. We show how our protocol can be implemented as a reservation protocol on top of the Web Services Transaction specification or, alternatively, as a coordination protocol on top of the Web Services Coordination specification. 1
Cited by 0
Anatoliy Kostruba · Figshare · 2020
A contract is a means for self-organization and self-regulation of civil and legal relations between parties in the Civil Code of Ukraine. A distinguishing feature of a contractual obligation is the dependence of thebeginning of a legal fact in its structure on the lawful will of a party (act) to a legal transaction or objective circumstance of reality (events). The objective of the paper is to study the mechanism of termination of obligations by determining the legal framework for its functioning. The specificity of legal facts of normative-compensating nature was determinedby the use of normative and protective functions in the legislation. Civil property and its legal regulation of relations are aimed at achieving the legal result determined by their participants at the stage of the exercise of rights.The study reveals that the compensating effect of the legal termination mechanism is expressed at the stage of legal termination, which involves compensating the inability to correct a defect of a legal fact that hinders the achievement of a goal of legal regulation when exercising the right to the start of an anticipated legal effect according to a legal model of legal subjects accepted by the participants of the civil relations. The author dwells upon one of the forms of termination of contractual obligations, more specifically, on the beginning of cancellation and on the deferred status of a legal transaction.
Cited by 0Open access
Muhammad Younas, Barry Eaglestone · 2016
Abstract: This paper presents an extension to a novel Web transaction management protocol, previously defined for a failure-free environment, such that it provides reliable recovery from failure in e-commerce applications. This protocol manages complex Web transactions upon multiple distributed Web services, and overcome limitations of two-phase commit protocols by applying correctness criteria based upon semantic atomicity. Further, it supports enhanced transaction resilience through the use of compensating and alternative transactions. The protocol has been prototyped in a CORBA environment. An evaluation carried out on this prototype shows that the new recovery mechanism minimises the logging cost, increases fault tolerance, and permits independent recovery of autonomous systems.
Cited by 0