CN102546752A - Distributed transaction processing method and system based on time limit - Google Patents
Distributed transaction processing method and system based on time limit Download PDFInfo
- Publication number
- CN102546752A CN102546752A CN2011103994439A CN201110399443A CN102546752A CN 102546752 A CN102546752 A CN 102546752A CN 2011103994439 A CN2011103994439 A CN 2011103994439A CN 201110399443 A CN201110399443 A CN 201110399443A CN 102546752 A CN102546752 A CN 102546752A
- Authority
- CN
- China
- Prior art keywords
- affairs
- web service
- supplier
- subtransaction
- transaction
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Computer And Data Communications (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention belongs to the technical field of distributed transactions under a Web service technology, in particular to a distributed transaction processing method and system based on a time limit in a Web service environment. In the method, sub-transaction analysis is performed on a submitted transaction based on a latest desired transaction completion time limit submitted by a user, and a Web service provider which meets the limit requirement of the user can be met most possibly, so that the aim of improving the reliability of the transaction in the Web service environment and the concurrent transaction throughput performance of the system is fulfilled. In the conventional distributed transaction processing method under a Web service, the requirement of the user on a transaction submission time limit in a practical environment is not considered, so that the incidence probability of a compensation transaction is increased greatly since the requirement of a customer on latest time is succeeded during concurrent execution of the transaction, and the cost on transaction compensation is always great. In the method and the system, a transaction executing node is selected and scheduled. The available resource of each node in the entire Web service environment can be utilized effectively, and more reliable guarantee is better provided for a distributed transaction in the Web service environment.
Description
Technical field
The invention belongs to distributed transaction technical field under the Web service technology; Be specifically related in a kind of Web service environment distributed transaction processing method based on time bar; The expectation affairs latest finishing time time limit that this method is submitted to based on the user; To submitting to affairs to carry out the subtransaction analysis, select the Web service supplier who most possibly satisfies user's time limit demand, reach the purpose of the concurrent transaction throughput performance of the reliability that improves affairs under the Web service environment and system.
Background technology
Along with the develop rapidly of modern internet, the Web service technology becomes a very popular topic in present IT field.Web service itself is modular, self-contained and self-described, based on network application program, and its makes the different application that operates on the different machines just can realize that data interaction and function are integrated by additional, special third party software or hardware.Owing to the agreement and technology of Web service technology based on some existing standardization, like HTTP (HTTP) and XML (extend markup language), the distributed computing technology that the difficulty of therefore developing and disposing is traditional relatively is much lower.
In the distributed service of reality, the composite service structure is often adopted in Web service, relates to the polymerization of a plurality of Web services, and these Web services can come from a plurality of different Web service providers.In order to ensure that a plurality of Web service programs solve all kinds of abnormal conditions that the Distributed Application combination occurs in the process of implementation to the consistency and the reliability of data resource access in the composite service, need affair mechanism and technological support.It is theoretical that Traditional affair mechanism derives from classical relevant database, and its feature is data-centered, stresses ACID (atomicity, consistency, isolation, the persistence) characteristic in the affairs implementation.The loose couplings structures shape that Web service is used the Web service environment need more loose affairs forms, can not strictness follow the ACID characteristic.For this reason; Web service transaction management standard WS-Transaction has proposed a kind of new transaction types WS-BusinessActivity; These standard disclaimer affairs can be submitted to as early as possible, if affairs are carried out failure, can cancel the influence that these affairs cause with a kind of mechanism that is called compensating transaction.Here solved in the ACID characteristic resource lock to the adverse effect that causes of performance; But brought a problem thus, i.e. the design of compensating transaction will guarantee that under some complicated business situation its accuracy is very difficult, because this relates to the consistency problem of data between the territory; This ensures than the data consistency in the single territory is more difficult; If compensating transaction designs to such an extent that be not very perfect,, data often need manual intervention when recovering, increased the complexity of system maintenance.And the distributed transaction management agreement or the framework that are applied at present under the Web service environment do not consider that when carrying out transaction coordination with scheduling the user is for oneself submitting the requirement of the latest finishing time of affairs to; Even final submission the to smoothly of affairs accomplished; But can fail, thereby cause the generation of compensating transaction because having surpassed the patient deadline of user institute.
In Fig. 1, at first can see the simple transaction flow process of traditional 2PC agreement.Affairs implementation under the 2PC agreement is following:
(1) the affairs initiator sends ready message for all service sides, states and oneself wants the resource that takies.
(2) occupation condition of oneself is checked by each service side, if currently can't then send failed message for the affairs initiator provides resource occupation, otherwise message has been prepared in transmission.
(3) the affairs initiator gathers up the feedback message of all service sides.When receiving the preparation message of all service sides, to send and submit to message to give each resource provider, request transaction is submitted to; If otherwise receive 1 failed message, and then send abort message and give all resource providers, abandon taking of all resources.
Between the resource duration of exclusivity, the resource request of other global transactions will be rejected, and the concurrent handling capacity of whole system is had a negative impact.
This defective to the 2PC agreement; The THP agreement has increased a resource reservation stage on this basis; Can there be a lot of concurrent global transactions that resource is scheduled to like this; Only when confirming to prepare to submit to, just understand exclusive resource, can cushion the adverse effect that " monopolizing exclusive " brings so to a certain extent.The quick-reading flow sheets of THP agreement is as shown in Figure 2.
Affairs implementation under the THP agreement is following:
(1) the affairs initiator sends resource reservation information for all service sides.
(2) each service side confirms the maximum subscribed limit of oneself, if do not surpass the maximum subscribed limit, then maximum subscribed limit value adds 1, and accepts reservation of resources.Otherwise refusal is subscribed.
(3) the affairs initiator receives when any 1 refusal is subscribed and will cancel other successful resource reservations, confirms the affairs failure.Otherwise got into for (4) step.
(4) the affairs initiator sends confirmation for service side, and service orientation affairs initiator sends confirmation, and initiatively cancels the corresponding resource reservation of other affairs initiator.
(5) the affairs initiator submits affairs to service side.
(6) service side submits to the result to return the affairs initiator affairs.
But the THP agreement is FIFO (First Come First Served) strategy last affairs presentation stage employing; And actual conditions often the client be different for the submission time at the latest of different affairs; If just adopt the First Come First Served strategy; A lot of more urgent affairs of time finally are to fail, thereby cause the generation of compensating transaction.In this case, all resource providers must be considered the time bar of the affairs of having subscribed resource, and carry out resource allocation on this basis.
Summary of the invention
Based on the problem that occurs in the above present situation, the present invention proposes in a kind of Web service environment distributed transaction processing method and the system based on time bar; The present invention adopts the timesharing scheduling strategy, has avoided some urgent affairs in the First Come First Served strategy in time bar, not accomplish and the situation of the affairs failure that causes is frequent occurs or the generation of compensating transaction; Through distributed transaction is carried out pre-scheduling, can before affairs are carried out, calculate these affairs and whether can accomplish in the times prior of user expectation, can effectively reduce the quantity that can not accomplish affairs in time.
Based on the distributed transaction processing method of time bar, its step comprises in a kind of Web service environment provided by the invention:
(1) server receives the transactions requests that the user submits to through browser, and transactions requests comprises Transaction Identifier and time bar information;
(2) server generates affairs coordinator, and this transactions requests is handed to affairs coordinator handle;
(3) affairs coordinator is tabulated according to the subtransaction that the Transaction Identifier in this transactions requests finds out these affairs, and each subtransaction t
iThe tabulation formed of Web service supplier, wherein, the subtransaction tabulation is designated as t
1, t
2..., t
n, i representes the sequence number of subtransaction, 1≤i≤n, and Web service supplier tabulation is designated as p
I1, p
I2..., p
Im, each Web service supplier p
IjBe subtransaction t
iSafeguard a time series table; M representes subtransaction t
iWeb service supplier's number;
(4) affairs coordinator sends the pre-scheduling request to all relevant Web service suppliers; All receive that the supplier of transactions requests will upgrade the time series table of these affairs in this node, and return essential information tuple { AT
Ij, HT
Ij, URI
IjInformation gives affairs coordinator, and wherein, AT
IjThe expression resource lock time, HT
IjBe illustrated in the expected time of occupying resource lock when this node is carried out affairs, URI
IjThe call address of representing this Web service;
(5) the essential information tuple returned according to the supplier of affairs coordinator is for each subtransaction is selected a Web service supplier;
(6) affairs coordinator sends affairs to the Web service supplier who selects and submits request to;
(7) after each Web service supplier who participates in affairs receives affairs submission request, carry out affairs, and the result that affairs are carried out sends to affairs coordinator;
(8) affairs coordinator returns to the user with the execution result of each subtransaction;
(9) finish.
The present invention also provides in a kind of Web service environment based on the distributed transaction treatment system of time bar, and it is characterized in that: it comprises server, affairs coordinator and a plurality of Web service supplier;
Server is used to receive the transactions requests that the user submits to through browser, and transactions requests comprises Transaction Identifier and time bar information; And server generation affairs coordinator, and this transactions requests is handed to affairs coordinator handle;
Affairs coordinator is tabulated according to the subtransaction that the Transaction Identifier in this transactions requests finds out these affairs, and each subtransaction t
iThe tabulation formed of Web service supplier, wherein, the subtransaction tabulation is designated as t
1, t
2..., t
n, i representes the sequence number of subtransaction, 1≤i≤n, and Web service supplier tabulation is designated as p
I1, p
I2..., p
Im, each Web service supplier p
IjBe subtransaction t
iSafeguard a time series table; M representes subtransaction t
iWeb service supplier's number;
Affairs coordinator sends the pre-scheduling request to all relevant Web service suppliers; All receive that the supplier of transactions requests will upgrade the time series table of these affairs in this node, and return essential information tuple { AT
Ij, HT
Ij, URI
IjInformation gives affairs coordinator, and wherein, AT
IjThe expression resource lock time, HT
IjBe illustrated in the expected time of occupying resource lock when this node is carried out affairs, URI
IjThe call address of representing this Web service;
The essential information tuple that affairs coordinator returns according to the supplier is for each subtransaction is selected a Web service supplier;
Affairs coordinator sends affairs to the Web service supplier who selects and submits request to;
Each Web service supplier who participates in affairs carry out affairs, and the result that affairs are carried out sends to affairs coordinator after receiving affairs submission request;
Affairs coordinator returns to the user with the execution result of each subtransaction.
The present invention provides effective coordination and management service for the distributed concurrent transaction under the Web service environment.Operation principle of the present invention is: in whole Web service distributed transaction environment, the Web service of same kind can be provided by a plurality of suppliers, draws an analogy, and the Duo Jia hotel can provide the ONLINE lodging this a kind of service.The global transaction of initiating on each Web node is by communicating between the Web service supplier of a master coordinator in the implementation of whole affairs and on each node; The subtransaction of coordinating on each node is carried out, thereby accomplishes the implementation of whole distributed transaction.Be different from traditional framework or agreement; It is the affairs notions of submission time at the latest that the transaction coordination has here been introduced time bar; The user is when submitting transactions requests to; Submit the affairs latest finishing time of oneself hoping simultaneously to, affairs initiator submits to initial time through to carrying out the time limit prediction each Web service supplier's service time the client, chooses the proper service provider and submits transactions requests to.
The present invention has taken all factors into consideration the user to the time bar of affairs submission and Web service supplier's free time, from the Web service supplier, chooses the submission that suitable candidate carries out affairs, has reduced the occurrence probability of compensating transaction.And the present invention adopts timesharing mechanism, has avoided the resource lock conflict that exists in the Traditional Web services distributed transaction processing method, thereby has improved the whole concurrent performance of system effectively.
Description of drawings
Fig. 1 is the flow chart of traditional 2PC agreement based on exclusive lock mechanism;
Fig. 2 is to the improved flow chart based on the THP agreement of subscribing strategy of 2PC agreement;
Fig. 3 is a foundation frame composition of the present invention;
Fig. 4 is a transaction coordination flow chart of the present invention;
Fig. 5 chooses flow chart for Web service supplier of the present invention.
Embodiment
The present invention depends on the following fact:
If global transaction T is by n subtransaction t
1, t
2..., t
nForm each subtransaction t
iM available Web service supplier p arranged
I1, p
I2..., p
ImFor guaranteeing that simultaneous affairs are consistent to updating data, adopt lock mechanism to carry out data access control, the conflict when preventing data access guarantees data consistency.When appearance has a plurality of concurrent subtransaction of competitive relation to same data, obtain the subtransaction of lock earlier and can make amendment to data, discharge lock afterwards, the subtransaction that next obtains lock earlier can continue data are made amendment.Each Web service supplier p
IjBe t
iSafeguard a time series table, this time series table is made up of a plurality of time points, and the time interval between each time point is HT
Ij, each time point comprises 2 attributes, time value T with take the sign OCC.HT wherein
IjBe illustrated in this node and carry out t
iThe expected time of Shi Zhanyou lock, this expected time can take the historical record time according to this subtransaction resource lock on this node by this node and get desired value and obtain.Time series table thus, transactions requests can access the time that can obtain lock next time, and note is AT
IjHere the user-defined transaction time time limit is designated as DL.
The inventive method is the basis with affairs T and the transaction time time limit DL that the user submits to; With at the latest submission time of time limit DL between this moment as affairs T; Select in numerous nodes in distributed environment and can satisfy the set of node that time bar requires; Guarantee to be included in the node in this set of node can accomplish whole affairs before time bar arrives submission (if can not find the appropriate nodes collection; Interior affairs T, the information that then can't on time accomplish accomplished of time bar of representing the appointment of unrenewable family) to user feedback.
Below in conjunction with accompanying drawing and instance the present invention is elaborated.
As shown in Figure 3, meeting of the present invention was carried out pre-scheduling before each subtransaction of global transaction is distributed to each service side, obtain all related Web ISPs' essential information tuple { AT
Ij, HT
Ij, URI
Ij, URI
IjThe call address of representing this Web service.The Web service supplier can upgrade taking to be designated and taking of this time point in the time series table of these affairs in this node when pre-scheduling; Thereby just eliminate the conflict between the concurrent transaction on the whole system at scheduling phase, thereby reduce the probability that the affairs compensation takes place.
The inventive method comprises the steps:
(1) server receives the transactions requests that the user submits to through browser, and transactions requests comprises Transaction Identifier and time bar information.
(2) server generates affairs coordinator, and this transactions requests is handed to affairs coordinator handle.
(3) affairs coordinator is tabulated (by t according to the subtransaction that the Transaction Identifier in this transactions requests finds out these affairs
1, t
2..., t
nForm) and each subtransaction t
i(tabulation that m the Web service supplier of 1≤i≤n) forms is (by p
I1, p
I2..., p
ImForm).
(4) affairs coordinator sends the pre-scheduling request to all relevant Web service suppliers.All receive that the supplier of transactions requests will upgrade taking to be designated and taking of this time point in the time series table of these affairs in this node, and return essential information tuple { AT
Ij, HT
Ij, URI
IjInformation gives affairs coordinator, and wherein, AT
IjThe expression resource lock time, HT
IjBe illustrated in the expected time of occupying resource lock when this node is carried out affairs, URI
IjThe call address of representing this Web service.
(5) the essential information tuple returned according to the supplier of affairs coordinator is for each subtransaction is selected a Web service supplier.
As shown in Figure 5, selection course is following:
A generates the scheduling option table { } of a sky.
The tabulation of b traversal subtransaction is if exist subtransaction t
iIn the scheduling option table, there is not its supplier, then execution in step c.Otherwise execution in step d.
C inquires about t
iSupplier tabulation.If t
iSupplier tabulation in available Web service supplier is arranged, then therefrom select first to deposit in the scheduling option table, and from supplier's tabulation deletion this selecteed supplier, execution in step b then; Otherwise return no available supplier's mistake, and execution in step (9).
D calculates maximum AT value in the scheduling option table, and note is AT
MaxIf AT
Max>=DL then returns time-out error, and execution in step (9), otherwise gets into step e.
If there is RT in e
Ij≤AT
Ma, then eliminate this supplier the option table from scheduling, send updating message to this supplier, the supplier will upgrade taking of this time point in the time series table of these affairs in this node and be designated vacantly, return execution in step b, otherwise directly get into step f.
F goes on foot to this, comprises the alternative supplier of all subtransactions in the scheduling option table, and selection course finishes.
(6) affairs coordinator sends affairs to the Web service supplier who selects and submits request to.
(7) each Web service supplier who participates in affairs receives after affairs submit request to, carries out affairs, and result's (success or failure) that affairs are carried out is sent to affairs coordinator.
(8) affairs coordinator returns to the user with the execution result (success or failure) of each subtransaction.
(9) to this step, the transaction process finishes.
The above is merely a kind of concrete implementation of the present invention, and implementation method of the present invention is not limited thereto, and any change that in field of the present invention, does not break away under the spirit of the present invention all should be contained within the scope of the present invention.
Claims (3)
- In the Web service environment based on the distributed transaction processing method of time bar, its step comprises:(1) server receives the transactions requests that the user submits to through browser, and transactions requests comprises Transaction Identifier and time bar information;(2) server generates affairs coordinator, and this transactions requests is handed to affairs coordinator handle;(3) affairs coordinator is tabulated according to the subtransaction that the Transaction Identifier in this transactions requests finds out these affairs, and each subtransaction t iThe tabulation formed of Web service supplier, wherein, the subtransaction tabulation is designated as t 1, t 2..., t n, i representes the sequence number of subtransaction, 1≤i≤n, and Web service supplier tabulation is designated as p I1, p I2..., p Im, each Web service supplier p IjBe subtransaction t iSafeguard a time series table; M representes subtransaction t iWeb service supplier's number;(4) affairs coordinator sends the pre-scheduling request to all relevant Web service suppliers; All receive that the supplier of transactions requests will upgrade the time series table of these affairs in this node, and return essential information tuple { AT Ij, HT Ij, URI IjInformation gives affairs coordinator, and wherein, AT IjThe expression resource lock time, HT IjBe illustrated in the expected time of occupying resource lock when this node is carried out affairs, URI IjThe call address of representing this Web service;(5) the essential information tuple returned according to the supplier of affairs coordinator is for each subtransaction is selected a Web service supplier;(6) affairs coordinator sends affairs to the Web service supplier who selects and submits request to;(7) after each Web service supplier who participates in affairs receives affairs submission request, carry out affairs, and the result that affairs are carried out sends to affairs coordinator;(8) affairs coordinator returns to the user with the execution result of each subtransaction;(9) finish.
- 2. based on the distributed transaction processing method of time bar, it is characterized in that in the Web service environment according to claim 1, in the step (5), select a Web service supplier for each subtransaction according to following process:(5.1) the scheduling option table { } of a sky of generation;(5.2) traversal subtransaction tabulation is if exist subtransaction t iIn the scheduling option table, there is not its supplier, then execution in step (5.3); Otherwise execution in step (5.4);(5.3) inquiry t iSupplier tabulation; If t iSupplier tabulation in available Web service supplier is arranged, then therefrom select first to deposit in the scheduling option table, and from supplier's tabulation deletion this selecteed supplier, execution in step (5.2) then; Otherwise return no available supplier's mistake, and execution in step (9);(5.4) calculate the maximum resource lock time in the scheduling option table, note is AT MaxIf AT Max>=DL then returns time-out error, and execution in step (9), otherwise gets into step (5.5);(5.5) if there is RT Ij≤AT MaxThen eliminate this supplier from scheduling the option table, send updating message to this supplier, the supplier will upgrade taking of this time point in the time series table of these affairs in this node and be designated vacant; Return execution in step (5.2), otherwise directly get into step (5.6);(5.6) finish.
- In the Web service environment based on the distributed transaction treatment system of time bar, it is characterized in that: it comprises server, affairs coordinator and a plurality of Web service supplier;Server is used to receive the transactions requests that the user submits to through browser, and transactions requests comprises Transaction Identifier and time bar information; And server generation affairs coordinator, and this transactions requests is handed to affairs coordinator handle;Affairs coordinator is tabulated according to the subtransaction that the Transaction Identifier in this transactions requests finds out these affairs, and each subtransaction t iThe tabulation formed of Web service supplier, wherein, the subtransaction tabulation is designated as t 1, t 2..., t n, i representes the sequence number of subtransaction, 1≤i≤n, and Web service supplier tabulation is designated as p I1, p I2..., p Im, each Web service supplier p IjBe subtransaction t iSafeguard a time series table; M representes subtransaction t iWeb service supplier's number;Affairs coordinator sends the pre-scheduling request to all relevant Web service suppliers; All receive that the supplier of transactions requests will upgrade the time series table of these affairs in this node, and return essential information tuple { AT Ij, HT Ij, URI IjInformation gives affairs coordinator, and wherein, AT IjThe expression resource lock time, HT IjBe illustrated in the expected time of occupying resource lock when this node is carried out affairs, URI IjThe call address of representing this Web service;The essential information tuple that affairs coordinator returns according to the supplier is for each subtransaction is selected a Web service supplier;Affairs coordinator sends affairs to the Web service supplier who selects and submits request to;Each Web service supplier who participates in affairs carry out affairs, and the result that affairs are carried out sends to affairs coordinator after receiving affairs submission request;Affairs coordinator returns to the user with the execution result of each subtransaction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110399443.9A CN102546752B (en) | 2011-12-06 | 2011-12-06 | Distributed transaction processing method and system based on time limit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110399443.9A CN102546752B (en) | 2011-12-06 | 2011-12-06 | Distributed transaction processing method and system based on time limit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102546752A true CN102546752A (en) | 2012-07-04 |
| CN102546752B CN102546752B (en) | 2014-03-05 |
Family
ID=46352701
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110399443.9A Expired - Fee Related CN102546752B (en) | 2011-12-06 | 2011-12-06 | Distributed transaction processing method and system based on time limit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102546752B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106033437A (en) * | 2015-03-13 | 2016-10-19 | 阿里巴巴集团控股有限公司 | Method and system for processing distributed transaction |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100561920C (en) * | 2004-12-27 | 2009-11-18 | 北京航空航天大学 | Web service transacter and processing method |
| CN102073540A (en) * | 2010-12-15 | 2011-05-25 | 北京新媒传信科技有限公司 | Distributed affair submitting method and device thereof |
-
2011
- 2011-12-06 CN CN201110399443.9A patent/CN102546752B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100561920C (en) * | 2004-12-27 | 2009-11-18 | 北京航空航天大学 | Web service transacter and processing method |
| CN102073540A (en) * | 2010-12-15 | 2011-05-25 | 北京新媒传信科技有限公司 | Distributed affair submitting method and device thereof |
Non-Patent Citations (2)
| Title |
|---|
| 《电子科技大学硕士学位论文》 20090429 阮春荣 长事务处理协调框架--自治服务协调支持模块和原子事务支持模块的设计与实现 第29-43页 1-3 , * |
| 阮春荣: "长事务处理协调框架——自治服务协调支持模块和原子事务支持模块的设计与实现", 《电子科技大学硕士学位论文》, 29 April 2009 (2009-04-29), pages 29 - 43 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106033437A (en) * | 2015-03-13 | 2016-10-19 | 阿里巴巴集团控股有限公司 | Method and system for processing distributed transaction |
| CN106033437B (en) * | 2015-03-13 | 2020-01-10 | 阿里巴巴集团控股有限公司 | Distributed transaction processing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102546752B (en) | 2014-03-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111651244B (en) | Distributed transaction processing system | |
| US10250693B2 (en) | Idempotence for database transactions | |
| JP6223569B2 (en) | Computer apparatus, method and apparatus for scheduling business flows | |
| Wohed et al. | Analysis of web services composition languages: The case of BPEL4WS | |
| WO2021036768A1 (en) | Data reading method, apparatus, computer device, and storage medium | |
| US20130066949A1 (en) | Idempotence for database transactions | |
| US8538793B2 (en) | System and method for managing real-time batch workflows | |
| CN102073540A (en) | Distributed affair submitting method and device thereof | |
| US20200226011A1 (en) | Policy-based distributed transactional processing in a distributed system | |
| CN100561920C (en) | Web service transacter and processing method | |
| CN102413166B (en) | Distributed transaction method and system thereof | |
| Ben Lakhal et al. | FENECIA: failure endurable nested-transaction based execution of composite Web services with incorporated state analysis | |
| US9361477B2 (en) | Alternately processing messages | |
| Pardon et al. | Towards distributed atomic transactions over RESTful services | |
| CN102546752B (en) | Distributed transaction processing method and system based on time limit | |
| Erven et al. | The web services-businessactivity-initiator (ws-ba-i) protocol: an extension to the web services-businessactivity specification | |
| Singh et al. | Priority heuristic in mobile distributed real time database using optimistic concurrency control | |
| Tang et al. | Transaction management for reliable grid applications | |
| CN114356888A (en) | Transaction processing method and device, storage medium and electronic equipment | |
| US20060031498A1 (en) | Service-process providing system and service-process providing method | |
| Tang et al. | Automatic transaction compensation for reliable grid applications | |
| WO2017002249A1 (en) | Workflow management program, workflow management method, and workflow management device | |
| CN108572959B (en) | Method and device for interacting data with database | |
| AU2008201865B2 (en) | Alternating processing method, system, and computer program product | |
| Alrifai et al. | Nonblocking scheduling for web service transactions |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140305 Termination date: 20201206 |