US 7,584,474 B2Grant
Systems and methods for transaction chaining
Issue Date:2009-09-01
•6 Claims
•5 Drawing Sheets
Abstract
A transaction management engine, such as a business process management (BPM) engine, can allow an application to define transaction demarcations in order to ensure that portions of a workflow are processed atomically. In one such system, a JMS message is queued to the workflow as part of an existing transaction. If that transaction commits, the queued JMS message ensures that the workflow will be invoked in a new transaction that allows the workflow to perform the next unit of work in the newly initiated transaction. When the unit of work is completed, the workflow queues another JMS message. If this transaction commits, the transaction ensures the unit of work has executed in a transaction. When the workflow is invoked again due to the second JMS message, the workflow can continue its operation in a different transaction.
Metadata
Assignee
- BEA Systems, Inc.
Inventors
- Albert Gondi
- Michael Blow
- Pal Takacsi-Nagy
Application Information
Application Number:US 10/785,702
Filing Date:2004-02-24
Priority Date:2003-02-25
Art Unit:2195
Classifications
IPC:
G06F9/46G06F11/00G06F3/00G06F17/30
Patent Drawings (5 sheets)
Description
Claim of Priority
[0001] This application claims priority to U.S. Patent Provisional Application 60/449,925 entitled “SYSTEMS AND METHODS FOR TRANSACTION CHAINING,” by Gondi et al., filed Feb. 25, 2003.
Copyright Notice
[0002] A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document of the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
Cross-Referenced Cases
[0003] The following applications are cross-referenced and incorporated herein by reference:
[0004] U.S. Provisional Patent Application No. 60/376,906 entitled “COLLABORATIVE BUSINESS PLUG-IN FRAMEWORK,” by Mike Blevins, filed May 1, 2002;
[0005] U.S. Provisional Patent Application No. 60/377,157 entitled “SYSTEM AND METHOD FOR COLLABORATIVE BUSINESS PLUG-INS” by Mike Blevins, filed May 1, 2002.
[0006] U.S. Provisional Patent Application No. 60/450,074 entitled “SYSTEMS AND METHODS UTILIZING A WORKFLOW DEFINITION LANGUAGE” by Pal Takacsi-Nagy, filed Feb. 25, 2003.
Field of the Invention
[0007] The present invention relates to the filtering of messages in a subscription-based messaging model.
Background
[0008] In a normal transaction management approach, a first transaction for a first application is “followed” by a second transaction for either the first application or for a second application. Any resources that the first application is holding against a database or resource manager are deleted when the first transaction completes. Further, any context for the first transaction is deleted upon completion. When the second transaction begins, all resources for that transaction must be re-established, including any resources used for the first transaction. This can be inefficient if any of those resources are being used by multiple transactions.
Brief Summary
[0009] Systems and methods in accordance with one embodiment of the present invention overcome deficiencies in existing transaction management systems by taking advantage of transaction chaining. A transaction management engine, such as a business process management (BPM) engine, can allow an application to define transaction demarcations in order to ensure that portions of a workflow are processed atomically.
[0010] Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.
Brief Description of the Drawings
[0011] FIG. 1 is a diagram showing a workflow that can be used in accordance with one embodiment of the present invention.
[0012] FIG. 2 is a diagram of another workflow that can be used in accordance with one embodiment of the present invention.
[0013] FIG. 3 is a code example showing transaction demarcations within a workflow that can be used with the diagram of FIG. 2 .
[0014] FIG. 4 is a chart showing an execution path that can be used with the diagram of FIG. 2 .
Detailed Description
[0015] Transaction managers can be used to provide atomicity for a transaction. The “atomicity” of a transaction refers to the fact that a transaction should be done as a single “atomic” unit of work, such that the entire transaction either commits or fails. If a transaction includes multiple updates to a database table, for example, a transaction manager can be used to ensure that either all of the updates get committed to the database, or that none of the updates get committed. Ensuring atomicity through a transaction manager can be substantially more complicated, however, as a transaction manager can be responsible for managing multiple, distributed transactions on a number of databases distributed throughout a system or across a network or server cluster.
[0016] Systems and methods in accordance with the present invention provide a transaction manager with the ability to manage a “chained” transaction, or a transaction chain. When allowing for a transaction chain, a transaction manager can maintain certain resources, or can maintain a transaction context, for subsequent transactions. A transaction management engine, such as a business process management (BPM) engine, can allow an application to define transaction demarcations. For example, two tasks can be completed in a business process that transfers money between accounts. First, a specific amount of money needs to be deducted from a first account. Second, that money needs to be transferred into a second account. Assuming that these are separate items of work, it can be desirable to bracket these two activities in a transaction to be an atomic work item, such that either both work items process or neither of them process. It would be undesirable to deduct money from the first account if the money did not actually get added to the second account, and it would not be desirable to add money to the second account if that money was not actually taken out of the first account.
[0017] Systems and methods in accordance with one embodiment of the present invention utilize an entity bean to implement this BPM, which can take advantage of transaction bracketing. By utilizing an entity bean, transactions can be managed by an EJB container. When demarcating a transaction boundary for application activities within BPM, the transaction can simply continue to process normally until a transaction bracket is encountered. When a bracket is encountered, a persistent message is queued to the system, such as a JMS message. The queued JMS message allows the system to store context for the transaction. This allows the system to know that, upon the next transaction invoke, the system should start with the next activity within the transaction boundary. In other words, the system is processing the first transaction, then queuing a context that can be picked up and used by the next transaction.
[0018] An inbound message bean, or message-drive bean (MDB), can be created if this context is persisted through JMS. The MDB can pull this JMS message from the queue and invoke the BPM with the appropriate message. That message can include information about the next activity that to be executed as part of the transaction, allowing the transaction to maintain context.
[0019] If a J2EE-compliant system is being utilized, a mechanism such as a J2EE API could be used for suspending and resuming transactions. When encountering a transaction bracket, the system could suspend the first transaction, process those tasks included within the brackets in the new transaction, commit the new transaction, and resume the original transaction. A problem with such an approach exists, however, as the original transaction can fail after being resumed. The system has then processed an activity beyond the execution path, with no way to automatically undo or rollback the successfully committed transaction when the original transaction rolls back.
[0020] In an example shown in FIG. 1 , there are three activities 104, or operations, to be performed under a single transaction. Since all three activities are under a single transaction, if the execution of any activity fails for any reason, the transaction rolls back 112 and begins again at the first activity. If the operations succeed 106, the transaction can be committed 108. This can be guaranteed by the transaction semantics. Using a system in accordance with the present invention, activities two and three can be bracketed to be done atomically, or as a single unit of work. In order to bracket activities two and three, the user can place an opening transaction tag before activity two and a closing transaction tag after activity three. These tags can indicate that the second and third activities should be done atomically, such that both activities succeed or neither succeeds.
[0021] When a message is queued as part of the transaction, the transaction can be paused to start a new transaction, in order to implement a new transaction block. If the new transaction fails, since the JMS message is in the first queue, the JMS message can be resent. This can ensure that the transaction manager always continues from the correct location. Since the JMS message is queued, an object is only sent to get that message if the transaction commits. If the queued JMS message and the transaction roll back, the system is basically one step behind and can again attempt to go forward along the path of execution. An example of one such execution path is given in FIG. 4 .
[0022] A transaction manager can be configured to control the number of retries, or the period of time for retrying a transaction. Attributes in the workflow can be used to specify, for example, a retry count. The transaction itself can also have a retry count. If a JMS message is queued and the message does not commit, the system can generate a callback due to the failure, and that message can have a retry count. So even if the first attempt failed, the user can indicate how many times the message should be retried. These transactions can be implemented as an annotation of a Java Web service (JWS) file in the workflow language (WFL).
[0023] When a workflow is implemented in J2EE as an entity bean with container-managed transactions, it can be desirable to have a mechanism to demarcate parts of the workflow as atomic units of work. In other words, it is desirable to commit the existing container-initiated transaction and start a new transaction in order to perform the next unit of work. An example of such a workflow is shown in FIG. 2 , where once the workflow is started 200, a message is received 202 to execute the first transaction 204, followed by a message 206 to execute the second transaction 208. After executing the transactions, or failing to execute the transactions, a reply 210 can be sent that can indicate an end 212 to the workflow. Committing the existing transaction and having the ability to do the next unit of work in a new transaction can be treated as a single operation.
[0024] In order to achieve atomicity, a JMS message can be queued to the workflow as part of the existing transaction. If the existing transaction commits, the transaction ensures that the workflow will be invoked, due to the queued JMS message, in a different transaction that can allow the workflow to perform the next unit of work in the newly initiated transaction. When the unit of work is completed, the workflow can queue another JMS message. If this transaction commits, the transaction can ensure that the unit of work has executed in a transaction. When the workflow is invoked again, due to the second JMS message, the workflow can continue its operation in a different transaction.
[0025] A transaction can have a tag called <transaction>. A user can include tasks to be performed atomically within the transaction tags. The implication is that all the tasks to be performed should be executed under a single transaction. For example, consider the following workflow:
[0026]
| <process> | |
| <invoke someMethod/> | |
| <transaction> | |
| <invoke method1> | |
| <invoke method2> | |
| </transaction> | |
| <invoke someOtherMethod/> | |
| </process> | |
[0027] In the above example, someMethod will be executed in a first transaction. The methods method1 and method2 will be executed in a second transaction, demarcated by the opening and closing <transaction> tags. Yet another transaction can be used to execute someOtherMethod. When the workflow encounters a <transaction> tag, the workflow can queue a JMS message containing the information as to the next activity that needs to be executed. Queuing a JMS message as part of an existing transaction also ensures that the workflow will continue only if that transaction commits. The next unit of work is then “chained” to the previous work in the process.
[0028] The <transaction> tags ensure that method1 and method2 can be executed atomically. Without such a mechanism, there is no way to demarcate method1 and method2 as a single unit of work using J2EE transactional APIs. It is not possible to simply suspend the current transaction, start a new transaction to do the unit of work, and resume the original transaction, as there will be problems if the new transaction commits and the original transaction rolls back.
[0029] Transaction blocks not only can ensure that all operations within a transaction block are performed atomically, but a transaction block can also provide a timeout value for the operations to complete. A transaction block can also provide for retrying the operations in case of failures or timeouts. For example, as shown in FIG. 3 , a user can set separate timeout and retry values for each transaction within a workflow. In the first transaction, the timeout value is set to 30 seconds with a retry count of 3, while in the second transaction the timeout value is 20 seconds and the retry count is 2.
Atomic Transactions
[0030] Atomic transactions are known as “all-or-nothing” transactions. Actions taken prior to committing an atomic transaction are considered to be tentative or pending, and not persistent or visible to other activities. When an application finishes, the application can make a request to a coordination component to determine an outcome for the transaction. The coordination component can determine whether any of the units of work failed, such as by asking the processes doing those units of work to “vote” or reply whether or not the work items processed successfully. If all the processes vote indicate successful execution, the coordination component can commit all the actions taken. If a process indicates an aborted execution, or does not respond to the request, the coordination component can abort all actions and roll back the transaction. A commit operation makes the tentative actions persistent and visible to other transactions, while a rollback makes the tentative actions appear as if the actions never happened. Atomic transactions can provide consistent failure and recovery semantics, so applications do not need to deal with the mechanics of determining a mutually agreed outcome decision or to figure out how to recover from a large number of possible inconsistent states.
[0031] The foregoing description of preferred embodiments of the present invention has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations will be apparent to one of ordinary skill in the art. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, thereby enabling others skilled in the art to understand the invention for various embodiments and with various modifications that are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the following claims and their equivalence.
Claims
Post-issuance certificates present
The text shown below may not reflect later post-issuance changes.
What is claimed is:
1. A method for ensuring atomicity in a workflow, comprising:
demarcating tasks in the workflow to be processed atomically using transaction tags;
suspending a first transaction and executing a task from the demarcated tasks in a new transaction when the workflow encounters the transaction tags indicating the new transaction;
retrying the task for a configurable number of retries or period of time if the task is not performed successfully within a configurable timeout period;
resuming the first transaction when the task in the new transaction is executed using a processor;
wherein when one of the transaction tags is encountered, a context relating to the first transaction is queued as a Java Messaging Service (JMS) message as part of the first transaction;
wherein the JMS message is queued as part of the first transaction, the first transaction is paused to start the new transaction;
wherein if the new transaction fails, the new transaction rolls back and the queued JMS message is resent from the JMS queue;
wherein after the new transaction rolls back due to failure and the JMS message is resent, the transaction attempts again to go forward along a path of execution;
wherein the JMS message is obtained from the queue if the new transaction commits; and
wherein the transaction tags indicate which tasks are to be performed as a group.
2. A method according to claim 1, further comprising:
committing the tasks if all the tasks to be processed atomically are successfully processed.
3. A method according to claim 1, further comprising:
aborting the tasks if any of the tasks to be processed atomically are not successfully processed.
4. A computer program product stored in a storage medium in a general purpose or a specialized digital computer or microprocessor for ensuring atomicity in a workflow, comprising:
computer code for demarcating tasks in the workflow to be processed atomically using transaction tags;
computer code for suspending a first transaction and executing a task from the demarcated tasks in a new transaction when the workflow encounters one of the transaction tags indicating the new transaction;
computer code for retrying the task for a configurable number of retries or period of time if the task is not performed successfully within a configurable timeout period;
computer code for atomically processing the task;
computer code resuming the first transaction when the task in the new transaction is executed;
wherein when one of the transaction tags is encountered, a context relating to the first transaction is queued as a Java Messaging Service (JMS) message as part of the first transaction;
wherein the JMS message is queued as part of the first transaction, the first transaction is paused to start the new transaction;
wherein if the new transaction fails, the new transaction rolls back and the queued JMS message is resent from the JMS queue;
wherein after the new transaction rolls back due to failure and the JMS message is resent, the transaction attempts again to go forward along a path of execution;
wherein the JMS message is obtained from the queue if the new transaction commits; and
wherein the transaction tags indicate which tasks are to be performed as a group.
5. A computer implemented system comprising a processor for ensuring atomicity in a workflow, comprising:
means for demarcating tasks in the workflow to be processed atomically using transaction tags;
means for suspending a first transaction and executing a task from the demarcated tasks in a new transaction when the workflow encounters the transaction tags indicating the new transaction;
means for retrying the task for a configurable number of retries or period of time if the task is not performed successfully within a configurable timeout period
means for atomically processing the task;
means for resuming the first transaction when the task in the new transaction is executed;
wherein when one of the transaction tags is encountered, a context relating to the first transaction is queued as a Java Messaging Service (JMS) message as part of the first transaction;
wherein the JMS message is queued as part of the first transaction, the first transaction is paused to start the new transaction;
wherein if the new transaction fails, the new transaction rolls back and the queued JMS message is resent from the JMS queue;
wherein after the new transaction rolls back due to failure and the JMS message is resent, the transaction attempts again to go forward along a path of execution;
wherein the JMS message is obtained from the queue if the new transaction commits; and
wherein the transaction tags indicate which tasks are to be performed as a group.
6. A computer system comprising:
a processor;
object code executed by said processor, said object code configured to:
demarcate tasks in a workflow to be processed atomically using transaction tags to indicate the new transaction;
suspend a first transaction and execute a task from the demarcated tasks in a new transaction when the workflow encounters one of the transaction tags indicating the new transaction;
retry the task for configurable number of retries or period of time if the task is not performed successfully within a configurable timeout period;
atomically process the task;
resume the first transaction when the task in the new transaction is executed;
wherein when one of the transaction tags is encountered, a context relating to the first transaction is queued as a Java Messaging Service (JMS) message as part of the first transaction;
wherein the JMS message is queued as part of the first transaction, the first transaction is paused to start the new transaction;
wherein if the new transaction fails, the new transaction rolls back and the queued JMS message is resent from the JMS queue;
wherein after the new transaction rolls back due to failure and the JMS message is resent, the transaction attempts again to go forward along a path of execution;
wherein the JMS message is obtained from the queue if the new transaction commits; and
wherein the transaction tags indicate which tasks are to be performed as a group.
Patent Citations (164)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5469562(A) | 1995-11-01 | Saether | Applicant |
| US5604860(A) | 1997-02-01 | McLaughlin et al. | Applicant |
| US5630131(A) | 1997-05-01 | Palevich et al. | Applicant |
| US5680610(A) | 1997-10-01 | Smith et al. | Examiner |
| US5872971(A) | 1999-02-01 | Knapman et al. | Examiner |
| US5944794(A) | 1999-08-01 | Okamoto et al. | Applicant |
| US5946316(A) | 1999-08-01 | Chen et al. | Examiner |
| US5966535(A) | 1999-10-01 | Benedikt et al. | Applicant |
| US6009405(A) | 1999-12-01 | Leymann et al. | Examiner |
| US6012083(A) | 2000-01-01 | Savitzky et al. | Applicant |
| US6012094(A) | 2000-01-01 | Leymann et al. | Examiner |
| US6016495(A) | 2000-01-01 | McKeehan et al. | Applicant |
| US6018730(A) | 2000-01-01 | Nichols et al. | Applicant |
| US6023578(A) | 2000-02-01 | Birsan et al. | Applicant |
| US6029000(A) | 2000-02-01 | Woolsey et al. | Applicant |
| US6067623(A) | 2000-05-01 | Blakley et al. | Applicant |
| US6070184(A) | 2000-05-01 | Blount et al. | Applicant |
| US6141701(A) | 2000-10-01 | Whitney | Applicant |
| US6148336(A) | 2000-11-01 | Thomas et al. | Applicant |
| US6212546(B1) | 2001-04-01 | Starkovich et al. | Applicant |
| US6219666(B1) | 2001-04-01 | Krishnaswamy et al. | Examiner |
| US6222533(B1) | 2001-04-01 | Notani et al. | Applicant |
| US6243737(B1) | 2001-06-01 | Flanagan et al. | Applicant |
| US6243778(B1) | 2001-06-01 | Fung et al. | Examiner |
| US6292932(B1) | 2001-09-01 | Baisley et al. | Applicant |
| US6311327(B1) | 2001-10-01 | O'Brien et al. | Applicant |
| US6330569(B1) | 2001-12-01 | Baisley et al. | Applicant |
| US6334114(B1) | 2001-12-01 | Jacobs et al. | Applicant |
| US6343265(B1) | 2002-01-01 | Glebov et al. | Applicant |
| US6360358(B1) | 2002-03-01 | Elsbree et al. | Applicant |
| US6367068(B1) | 2002-04-01 | Vaidyanathan et al. | Applicant |
| US6377939(B1) | 2002-04-01 | Young | Applicant |
| US6408311(B1) | 2002-06-01 | Baisley et al. | Applicant |
| US6411698(B1) | 2002-06-01 | Bauer et al. | Applicant |
| US6445711(B1) | 2002-09-01 | Scheel et al. | Applicant |
| US6470364(B1) | 2002-10-01 | Prinzing | Applicant |
| US6516322(B1) | 2003-02-01 | Meredith | Examiner |
| US6560769(B1) | 2003-05-01 | Moore et al. | Applicant |
| US6584454(B1) | 2003-06-01 | Hummel et al. | Applicant |
| US6594700(B1) | 2003-07-01 | Graham et al. | Applicant |
| US6601113(B1) | 2003-07-01 | Koistinen et al. | Applicant |
| US6609115(B1) | 2003-08-01 | Mehring et al. | Applicant |
| US6615258(B1) | 2003-09-01 | Barry et al. | Applicant |
| US6625602(B1) | 2003-09-01 | Meredith et al. | Examiner |
| US6636491(B1) | 2003-10-01 | Kari et al. | Applicant |
| US6637020(B1) | 2003-10-01 | Hammond | Applicant |
| US6654932(B1) | 2003-11-01 | Bahrs et al. | Applicant |
| US6678518(B2) | 2004-01-01 | Eerola | Applicant |
| US6684388(B1) | 2004-01-01 | Gupta et al. | Applicant |
| US6687702(B2) | 2004-02-01 | Vaitheeswaran et al. | Applicant |
| US6687848(B1) | 2004-02-01 | Najmi | Applicant |
| US6721740(B1) | 2004-04-01 | Skinner et al. | Applicant |
| US6721779(B1) | 2004-04-01 | Maffeis | Applicant |
| US6748420(B1) | 2004-06-01 | Quatrano et al. | Applicant |
| US6754884(B1) | 2004-06-01 | Lucas et al. | Applicant |
| US6789054(B1) | 2004-09-01 | Makhlouf | Applicant |
| US6804686(B1) | 2004-10-01 | Stone et al. | Applicant |
| US6823495(B1) | 2004-11-01 | Vedula et al. | Applicant |
| US6832238(B1) | 2004-12-01 | Sharma et al. | Examiner |
| US6836883(B1) | 2004-12-01 | Abrams et al. | Applicant |
| US6847981(B2) | 2005-01-01 | Song et al. | Applicant |
| US6850979(B1) | 2005-02-01 | Saulpaugh et al. | Applicant |
| US6853876(B2) | 2005-02-01 | Wehrung et al. | Examiner |
| US6859180(B1) | 2005-02-01 | Rivera | Applicant |
| US6874143(B1) | 2005-03-01 | Murray et al. | Applicant |
| US6889244(B1) | 2005-05-01 | Gaither et al. | Applicant |
| US6915519(B2) | 2005-07-01 | Williamson et al. | Applicant |
| US6918053(B1) | 2005-07-01 | Thatte et al. | Examiner |
| US6918084(B1) | 2005-07-01 | Slaughter et al. | Applicant |
| US6922792(B2) | 2005-07-01 | Moser et al. | Examiner |
| US6922827(B2) | 2005-07-01 | Vasilik et al. | Applicant |
| US6950872(B2) | 2005-09-01 | Todd, II | Applicant |
| US6963914(B1) | 2005-11-01 | Breitbart et al. | Applicant |
| US6971096(B1) | 2005-11-01 | Ankireddipally et al. | Applicant |
| US6973657(B1) | 2005-12-01 | Ahmad et al. | Examiner |
| US6976086(B2) | 2005-12-01 | Sadeghi et al. | Applicant |
| US6988099(B2) | 2006-01-01 | Wiser et al. | Examiner |
| US7000219(B2) | 2006-02-01 | Barrett et al. | Applicant |
| US7017146(B2) | 2006-03-01 | Dellarocas et al. | Applicant |
| US7039671(B2) | 2006-05-01 | Cullen | Examiner |
| US7043722(B2) | 2006-05-01 | Bau, III | Applicant |
| US7051316(B2) | 2006-05-01 | Charisius et al. | Applicant |
| US7054858(B2) | 2006-05-01 | Sutherland | Applicant |
| US7062718(B2) | 2006-06-01 | Kodosky et al. | Applicant |
| US7069507(B1) | 2006-06-01 | Alcazar et al. | Applicant |
| US7072934(B2) | 2006-07-01 | Helgeson et al. | Applicant |
| US7073167(B2) | 2006-07-01 | Iwashita | Applicant |
| US7076772(B2) | 2006-07-01 | Zatloukal | Applicant |
| US7096422(B2) | 2006-08-01 | Rothschiller et al. | Applicant |
| US7107578(B1) | 2006-09-01 | Alpern | Applicant |
| US7111243(B1) | 2006-09-01 | Ballard et al. | Applicant |
| US7117214(B2) | 2006-10-01 | Wiser et al. | Examiner |
| US7117504(B2) | 2006-10-01 | Smith et al. | Applicant |
| US7127704(B2) | 2006-10-01 | Van De Vanter et al. | Applicant |
| US7143186(B2) | 2006-11-01 | Stewart et al. | Applicant |
| US7146422(B1) | 2006-12-01 | Marlatt et al. | Applicant |
| US7155705(B1) | 2006-12-01 | Hershberg et al. | Applicant |
| US7184967(B1) | 2007-02-01 | Mital et al. | Applicant |
| US7206805(B1) | 2007-04-01 | McLaughlin, Jr. | Examiner |
| US7240331(B2) | 2007-07-01 | Vion-Dury et al. | Applicant |
| US7260599(B2) | 2007-08-01 | Bauch et al. | Applicant |
| US7380166(B2) | 2008-05-01 | Thatte et al. | Examiner |
| US7391735(B2) | 2008-06-01 | Johnson | Examiner |
| US2002/0004848(A1) | 2002-01-01 | Sudarshan et al. | Applicant |
| US2002/0010781(A1) | 2002-01-01 | Tuatini | Applicant |
| US2002/0010803(A1) | 2002-01-01 | Oberstein et al. | Applicant |
| US2002/0035604(A1) | 2002-03-01 | Cohen et al. | Applicant |
| US2002/0049788(A1) | 2002-04-01 | Lipkin et al. | Applicant |
| US2002/0073236(A1) | 2002-06-01 | Helgeson et al. | Applicant |
| US2002/0073396(A1) | 2002-06-01 | Crupi et al. | Applicant |
| US2002/0083075(A1) | 2002-06-01 | Brummel et al. | Applicant |
| US2002/0111922(A1) | 2002-08-01 | Young et al. | Applicant |
| US2002/0120685(A1) | 2002-08-01 | Srivastava et al. | Applicant |
| US2002/0143960(A1) | 2002-10-01 | Goren et al. | Applicant |
| US2002/0152106(A1) | 2002-10-01 | Stoxen et al. | Applicant |
| US2002/0161826(A1) | 2002-10-01 | Arteaga et al. | Applicant |
| US2002/0174178(A1) | 2002-11-01 | Stawikowski | Applicant |
| US2002/0174241(A1) | 2002-11-01 | Beged-Dov et al. | Applicant |
| US2002/0184610(A1) | 2002-12-01 | Chong et al. | Applicant |
| US2002/0194244(A1) | 2002-12-01 | Raventos | Applicant |
| US2002/0194267(A1) | 2002-12-01 | Flesner et al. | Applicant |
| US2002/0194495(A1) | 2002-12-01 | Gladstone et al. | Applicant |
| US2003/0004746(A1) | 2003-01-01 | Kheirolomoom et al. | Applicant |
| US2003/0005181(A1) | 2003-01-01 | Bau et al. | Applicant |
| US2003/0014439(A1) | 2003-01-01 | Boughannam | Applicant |
| US2003/0018661(A1) | 2003-01-01 | Darugar | Applicant |
| US2003/0018832(A1) | 2003-01-01 | Amirisetty et al. | Applicant |
| US2003/0023957(A1) | 2003-01-01 | Bau et al. | Applicant |
| US2003/0028364(A1) | 2003-02-01 | Chan et al. | Applicant |
| US2003/0028579(A1) | 2003-02-01 | Kulkarni et al. | Applicant |
| US2003/0043191(A1) | 2003-03-01 | Tinsley et al. | Applicant |
| US2003/0046591(A1) | 2003-03-01 | Asghari-Kamrani et al. | Applicant |
| US2003/0051066(A1) | 2003-03-01 | Pace et al. | Applicant |
| US2003/0055868(A1) | 2003-03-01 | Fletcher et al. | Applicant |
| US2003/0055878(A1) | 2003-03-01 | Fletcher et al. | Applicant |
| US2003/0074217(A1) | 2003-04-01 | Beisiegel et al. | Applicant |
| US2003/0079029(A1) | 2003-04-01 | Garimella et al. | Applicant |
| US2003/0110446(A1) | 2003-06-01 | Nemer | Applicant |
| US2003/0120593(A1) | 2003-06-01 | Bansal et al. | Examiner |
| US2003/0126136(A1) | 2003-07-01 | Omoigui | Applicant |
| US2003/0149791(A1) | 2003-08-01 | Kane et al. | Applicant |
| US2003/0167358(A1) | 2003-09-01 | Marvin et al. | Applicant |
| US2003/0196168(A1) | 2003-10-01 | Hu | Applicant |
| US2004/0019645(A1) | 2004-01-01 | Goodman et al. | Applicant |
| US2004/0019684(A1) | 2004-01-01 | Potter et al. | Applicant |
| US2004/0025169(A1) | 2004-02-01 | Wiser et al. | Examiner |
| US2004/0040011(A1) | 2004-02-01 | Bosworth et al. | Applicant |
| US2004/0078373(A1) | 2004-04-01 | Ghoneimy et al. | Applicant |
| US2004/0103406(A1) | 2004-05-01 | Patel | Applicant |
| US2004/0148336(A1) | 2004-07-01 | Hubbard et al. | Applicant |
| US2004/0204976(A1) | 2004-10-01 | Oyama et al. | Applicant |
| US2004/0216086(A1) | 2004-10-01 | Bau | Applicant |
| US2004/0260715(A1) | 2004-12-01 | Mongeon | Applicant |
| US2005/0050068(A1) | 2005-03-01 | Vaschillo et al. | Applicant |
| US2005/0144170(A1) | 2005-06-01 | Wiser et al. | Examiner |
| US2005/0278585(A1) | 2005-12-01 | Spencer | Applicant |
| US2006/0206856(A1) | 2006-09-01 | Breeden et al. | Applicant |
| US2006/0234678(A1) | 2006-10-01 | Juitt et al. | Applicant |
| US2007/0038500(A1) | 2007-02-01 | Hammitt et al. | Applicant |
| CA2248634 | 2000-03-01 | Applicant | |
| JP10069418(A) | 1998-03-01 | Examiner | |
| JP2001188696(A) | 2001-07-01 | Examiner | |
| WO9923558 | 1999-05-01 | Applicant | |
| WO29924 | 2000-05-01 | Applicant |
Non-Patent Literature (27)
- HP NonStop Tuxedo Release Guide, 8.0; Nov. 2002.Examiner
- Stefan Tai “Dependency-spheres: A global transaction context for distributed objects and messages”, IEEE 2001, pp. 105-115.Examiner
- Sharma, “J2EE Connector Architecture Specification, Version 1.0 Final Release”, Java 2 Enterprise Edition, Aug. 2001, 90 pages, Sun Microsystems.Applicant
- Allamaraju, et al., “Professional Java Server Programming J2EE 1.3 Edition”, Sep. 2001, pp. 1009-1057, WROX.Applicant
- Supplementary European Search Report for EP 02784131.1 dated Aug. 8, 2007, 4 pages.Applicant
- Microsoft, “Microsoft.net Framework”, Microsoft Corporation, 2001, 54 pages.Applicant
- Willink, “Meta-Compilation for C++”, University of Surrey, Jan. 4, 2000, 379 pages.Applicant
- Alonso et al., “Advanced Transaction Models in Workflow Contexts”, IEEE, Feb. 1996, Proceedings of 12th International Conference on Data Engineering, retrieved from: http://citeseer.ist.psu.edualonso96advanced.html., pp. 574-581.Applicant
- Van Der Aalst et al., “XML Based Schema Definition for Support of Inter-Organizational Workflow”, University of Colorado and University of Eindhoven report, 2000, retrieved from http://citeseer.ist.psu.edu/vanderaalst00mxl.html, 39 pages.Applicant
- Plaindoux, “XML transducers in Java”, May 2002, The Eleventh International World Wide Conference, retrieved from: http://www2002.org/CDROM/poster/132/index.html., 6 pages.Applicant
- Bogunovic, “A Programming Model for Composing Data Flow Collaborative Applications”, Proceedings of the IEEE International Conference on Engineering of Computer Based Systems, Mar. 7-12, 1999, pp. 106-112.Applicant
- Sung et al. , “A Multimedia Authoring Tool for the Internet”, IEEE Transactions on Consumer Electronics, 1997. pp. 304-308.Applicant
- Smith, et al. “Marching Towards a Software Reuse Future”, ACM Ada Letters, Nov./Dec. 1994, pp. 62-72 vol. 14, No. 6.Applicant
- Mohan et al., “Aries: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging”, ACM Transactions on Database Systems (TODS), Mar. 1992, pp. 94-162, vol. 17, Issue 1.Applicant
- Bea Systems, Inc., “Transforming Data Using Xquery Mapper”, BEA AquaLogic Service Bus 2.0 Documentation, 2006, 19 pages.Applicant
- Stylus Studio, “Xquery Mapper”, 2007, 6 pages, Stylus Studios.Applicant
- Altova, “XML-toXML Mapping”, 2007, 3 pages, Altova Map Force.Applicant
- Jamper, “Jamper-Java XML Mapper”, 2007, 4 pages, Sourceforge.Applicant
- Sosnoski, “XML and Java technologies: Data binding, Part 1: Code generation approaches—JAXB and more,” IBM, Jan. 1, 2003, http://www-128.ibm.com/developerworks/library/x-databdopt/index.html, pp. 1-11.Applicant
- Chen, et al., “eCo Architecture for Electronic Commerce Interoperability,” CommerceNet eCo Framework Project, Jun. 29, 1999, CommerceNet, Inc., pp. 1-107.Applicant
- Java Debug Interface—definition, retrieved from <URL http://java.sun.com/j2se/1.4.2/docs/guide/jpda/jdi/overview-summary.html on Feb. 21, 2007, pp. 1-3.Applicant
- Kilgore, “Multi-Language, Open-Source Modeling Using the Microsoft.NET Architecture,” Proceedings of the 2002 Winter Simulation Conference, Dec. 8-11, 2002, IEEE, vol. 1, pp. 629-633.Applicant
- Embury, et al., “Assisting the Comprehension of Legacy Transactions,” Proceedings of the Eighth Working Conference on Reverse Engineering, Oct. 2-5, 2001, pp. 345-354.Applicant
- Mays, et al., “A Persistent Store for Large Shared Knowledge Bases,” IEEE Transactions on Knowledge and Data Engineering, vol. 3, No. 1, Mar. 1991, pp. 33-41.Applicant
- Tang, et al., “Integrating Remote Invocation and Distributed Shared State,” Proceedings of the 18th International Parallel and Distributed Processing Symposium, (IPDPS '04), Apr. 26-30, 2004, 10 pages.Applicant
- Liebmann, et al., “Adaptive Data Dissemination and Caching for Edge Service Architectures built with the J2EE”, 2004 Symposium on Applied Computing, Nicosia, Cyprus, Mar. 14-17, 2004, ACM Press, pp. 1717-1724.Applicant
- HP, “HP Application Server Developer's Guide,” Version 8.0 Hewlett-Packard Company, 1999-2001, pp. 27-81, 127-160, 195-271.Applicant