Abstract: The capturing of change data of deferred updates begins with the receipt of an update request call for one or more changes to a database. A processing of the update request call is deferred until a commit point is issued, where call information associated with the update request call is determined, and the call information is stored and associated with the update request call. During a processing of the commit point, data information for the one or more changes to the database is determined. The data information for the one or more changes is combined with the stored call information associated with the update request call.

Abstract: The capturing of change data of deferred updates begins with the receipt of an update request call for one or more changes to a database. A processing of the update request call is deferred until a commit point is issued, where call information associated with the update request call is determined, and the call information is stored and associated with the update request call. During a processing of the commit point, data information for the one or more changes to the database is determined. The data information for the one or more changes is combined with the stored call information associated with the update request call.

Abstract: Method for generating an alternate logical database structure of a hierarchical database by a computing device, includes: determining a target level of a physical hierarchical database structure corresponding to a root level of a logical hierarchical database structure; accessing a current level of the physical hierarchical database structure equal to the target level; decrementing the current level by the computing device; accessing the decremented current level of the physical hierarchical database structure; and in response to determining that the decremented current level is a root level of the physical hierarchical database structure, repositioning the current level to the target level. In response to determining that the decremented current level is not the root level of the physical hierarchical database structure, repeating the decrementing of the current level and the accessing of the decremented current level of the physical hierarchical database structure by the computing device.

Abstract: An apparatus and system are disclosed for communicating with multiple data stores. The present invention includes a control module that communicates with a plurality of data stores. The control module is in communication with a connection module. The connection module communicates with a first association module that is in communication with a first data store. The control module communicates with the first data store through the connection module and the first association module. In addition, the first association module communicates with a second association module. The second association module communicates with a second data store. The control module also communicates with the second data store through the connection module, the first association module, and the second association module.

Abstract: An apparatus, system, and method for autonomously maintaining a single system image in a parallel systems complex. A computer program product causes the relevant systems in a parallel systems complex to receive requests with a global scope from a user. The request is sent to each IMS system in the sysplex, and each IMS system applies the resource information and logs the resource information for recovery. The request is written to a shared medium which IMS sysplex members can access. When an IMS member is brought online, the IMS member restores status information first from local recovery logs. The IMS member then checks the information against the global medium to determine if requests were issued while the IMS was offline. If so, the IMS inherits the information in the global medium before processing work. An IMS added into the sysplex applies the information from the global medium before processing work.

Abstract: A system and method to automatically identify resources requiring upgrade in a hierarchical database management system. The system may include an input module to receive input identifying a single resource for upgrade. A comparator module may compare an active resource library to a staging library to identify additional resources for upgrade, and an incorporation module may incorporate the single input resource and the additional resources into an upgrade list. A generation module may then automatically derive a unit of change from this list, where the unit of change includes the single input resource as well as additional resources that interact with the input resource.

Abstract: A system for satisfying a request from a client for a send-then-commit transaction includes a front-end information management system (IMS) server. Shared message queues (SMQ) communicate with the front-end IMS server and plural back-end IMS. The front-end IMS server receives the request from the client and transmits the request to the SMQ. A back-end IMS server accesses the SMQ and generates a transaction output in response to the request. The back-end IMS server transmits the result to the front-end IMS server and the front-end IMS server interfaces with the client to communicate the response thereto. The back-end IMS server and front-end IMS server operate in separate system images, but work together in a resource recovery services (RRS) environment to commit or backout the transaction output.

Abstract: An apparatus and system are disclosed for communicating with multiple data stores. The present invention includes a control module that communicates with a plurality of data stores. The control module is in communication with a connection module. The connection module communicates with a first association module that is in communication with a first data store. The control module communicates with the first data store through the connection module and the first association module. In addition, the first association module communicates with a second association module. The second association module communicates with a second data store. The control module also communicates with the second data store through the connection module, the first association module, and the second association module.

Abstract: A method is disclosed for communicating with multiple data stores. The present invention includes a control module that communicates with a plurality of data stores. The control module is in communication with a connection module. The connection module communicates with a first association module that is in communication with a first data store. The control module communicates with the first data store through the connection module and the first association module. In addition, the first association module communicates with a second association module. The second association module communicates with a second data store. The control module also communicates with the second data store through the connection module, the first association module, and the second association module.

Abstract: An apparatus, system, and method for autonomously maintaining a single system image in a parallel systems complex. A computer program product causes the relevant systems in a parallel systems complex to receive requests with a global scope from a user. The request is sent to each IMS system in the sysplex, and each IMS system applies the resource information and logs the resource information for recovery. The request is written to a shared medium which IMS sysplex members can access. When an IMS member is brought online, the IMS member restores status information first from local recovery logs. The IMS member then checks the information against the global medium to determine if requests were issued while the IMS was offline. If so, the IMS inherits the information in the global medium before processing work. An IMS added into the sysplex applies the information from the global medium before processing work.

Abstract: A system for satisfying a request from a client for a send-then-commit transaction includes a front-end information management system (IMS) server. Shared message queues (SMQ) communicate with the front-end IMS server and plural back-end IMS. The front-end IMS server receives the request from the client and transmits the request to the SMQ. A back-end IMS server accesses the SMQ and generates a transaction output in response to the request. The back-end IMS server transmits the result to the front-end IMS server and the front-end IMS server interfaces with the client to communicate the response thereto. The back-end IMS server and front-end IMS server operate in separate system images, but work together in a resource recovery services (RRS) environment to commit or backout the transaction output.

Abstract: A system for satisfying a request from a client for a send-then-commit transaction includes a front-end information management system (IMS) server. Shared message queues (SMQ) communicate with the front-end IMS server and plural back-end IMS. The front-end IMS server receives the request from the client and transmits the request to the SMQ. A back-end IMS server accesses the SMQ and generates a transaction output in response to the request. The back-end IMS server transmits the result to the front-end IMS server and the front-end IMS server interfaces with the client to communicate the response thereto. The back-end IMS server and front-end IMS server operate in separate system images, but work together in a resource recovery services (RRS) environment to commit or backout the transaction output.

Abstract: An apparatus, system, and method are disclosed for autonomically managing multiple queues in a data processing system. A receiver module receives a message that specifies a computing task. A time stamp module appends a time stamp recording a time the message is received to the message. An assignment module assigns the message to a local queue if the local queue has less than a specified threshold number of messages else assign the message to a global queue. A processor module processes a specified initial number of next messages from the local queue and process a next message from the local queue if a time stamp of the local queue next message is less than a time stamp of a last message processed from the global queue else processes the next message from the global queue.

Abstract: A system and method to automatically identify resources requiring upgrade in a hierarchical database management system. The system may include an input module to receive input identifying a single resource for upgrade. A comparator module may compare an active resource library to a staging library to identify additional resources for upgrade, and an incorporation module may incorporate the single input resource and the additional resources into an upgrade list. A generation module may then automatically derive a unit of change from this list, where the unit of change includes the single input resource as well as additional resources that interact with the input resource.

Abstract: A system for satisfying a request from a client for a send-then-commit transaction includes a front-end information management system (IMS) server. Shared message queues (SMQ) communicate with the front-end IMS server and plural back-end IMS. The front-end IMS server receives the request from the client and transmits the request to the SMQ. A back-end IMS server accesses the SMQ and generates a transaction output in response to the request. The back-end IMS server transmits the result to the front-end IMS server and the front-end IMS server interfaces with the client to communicate the response thereto. The back-end IMS server and front-end IMS server operate in separate system images, but work together in a resource recovery services (RRS) environment to commit or backout the transaction output.

Abstract: A shared queue is provided to allow any of a plurality of systems to process messages received by clients of a data processing environment. A received message is enqueued onto the shared queue. Any of the plurality of systems having available processing capacity can retrieve the message from the shared queue and process the message. A response to the message, where appropriate, is enqueued onto the shared queue for delivery back to the client. A unique list structure is provided to implement the queue. The list structure is comprised of a plurality of sublists, or queue types. Each queue type is divided into a plurality of list headers. List entries, containing data from the received messages, are chained off of the list headers. A common queue server is used to interface to the queue and to store messages thereon. The common queue server stores message data in storage buffers, and then transfers this data to the list entries. Thus, common queue server coordinates the enqueuing of data onto the shared queue.

Abstract: A shared queue is provided to allow any of a plurality of systems to process messages received by clients of a data processing environment. A received message is enqueued onto the shared queue. Any of the plurality of systems having available processing capacity can retrieve the message from the shared queue and process the message. A response to the message, where appropriate, is enqueued onto the shared queue for delivery back to the client. A unique list structure is provided to implement the queue. The list structure is comprised of a plurality of sublists, or queue types. Each queue type is divided into a plurality of list headers. List entries, containing data from the received messages, are chained off of the list headers. A common queue server is used to interface to the queue and to store messages thereon. The common queue server stores message data in storage buffers, and then transfers this data to the list entries. Thus, common queue server coordinates the enqueuing of data onto the shared queue.

Abstract: A computer program product comprising a computer useable medium having computer program logic recorded on it for enabling a processor in a computer system to interact with a shared storage medium comprising a ready queue is described and a staging queue. The computer program logic enables the processor to determine whether a data object is larger than available storage capacity of a working storage associated with an application. A public key is associated with the data object and is available to all applications.

Abstract: A system and method for interacting with a shared storage medium comprising a ready queue and a staging queue is described. To store a data object, whether the data object is larger than available storage capacity of a working storage associated with an application is first determined. If the data object is larger than available storage capacity of the working storage, then a private key for the data object is generated. The application then divides the data object into N segments, and causes segments 2 through N to be stored in the staging queue via the working storage. The private key is stored with each of segments 2 through N in the staging queue. Then, the application causes segment 1 of the data object, the public key, and the private key to be stored in the ready queue. To retrieve a data object, an application causes a record having a public key stored therein to be retrieved from the ready queue. Stored in the record are at least a portion of a data object and a private key.

Abstract: Described herein is a computer program product comprising a computer useable medium having computer program logic recorded thereon for enabling a processor in a computer system to manage a plurality of data structures stored in a computer storage medium. The computer storage medium includes a primary storage medium and an overflow storage medium. The computer program logic enables the processor to receive a request to store a data object in a target data structure, and enables the processor to determine whether an overflow mode condition currently exists. If it is determined that an overflow mode condition does not currently exist, then the computer program product enables the processor to determine whether a combined size of all data structures stored in the primary storage medium plus a size of the data object is greater than a predetermined threshold.