International Business Machines Corporation

Judy Y Tse

Richard G Hannan

Betty J Patterson

Bruce E Naylor

George S Denny

Francis Joseph Ricchio

Sandra L Stoob

Janna L Mansker

Anuradha V Vakkalagadda

Jim W Bahls

Anu V Vakkalagadda

Richard C Schneider

Jack Chiu-Chiu Yuan

Steve T Kuo

Vern Lee Watts

Mark Neal Ziebarth

Terry Lee Krein

Steven Michael Bock

Thomas Phillip Bridges

Jerome Joseph Zentner

Karen D Paffendorf

James W Bahls

Gregory Walter Vance

Karen Alicia Ranson

Jeffrey G Fontaine

Dean Lynn Grover

Thanh Tien

Claudia S Ho

John Charles Barmettler

Angelique Nicole Greenhaw

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.

Capturing change data of deferred updates

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.

Apparatus and system for communicating with multiple data stores

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.

Apparatus, system, and method for autonomously maintaining a single system image in a parallel systems complex

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.

System and method for automatically identifying a unit of change requiring upgrade in a database management system

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.

System and method for processing transactions in a multisystem database environment

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.

Method for communicating with multiple data stores

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.

Computer program product for a shared queue structure for data integrity

Shared queue structure for data integrity

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. If it is determined that the data object is larger than available storage capacity of the working storage, then the computer program product enables the processor to generate a private key for the data object, enables the processor to divide the data object into N segments, enables the processor to cause segments 2 through N of the data object to be stored in the staging queue via the working storage (the private key is also stored with each of the segments 2 through N in the staging queue), and enables the processor to cause segment 1 of the data object, the public key, and the private key to be stored in the ready queue. The private key becomes available to all applications once stored in the ready queue.

Computer program product for queuing and retrieving data objects to and

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. The application determines whether any segments of the data object are stored on the staging queue. If one or more segments of the data object are stored on the staging queue, then the application causes any records having the private key stored within them to be retrieved from the staging queue in the order in which the records were stored on the staging queue.

System and method for queuing an retrieving data objects to and from a

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. If it is determined that 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, then the computer program product enables the processor to enter an overflow mode such that an overflow mode condition exists. Once in the overflow mode, the computer program product enables the processor to select one or more data structures currently stored in the primary storage medium, and enables the processor to move the selected data structures from the primary storage medium to the overflow storage medium.

Computer program product for overflow queue processing

Growing community of inventors

San Jose, CA, United States of America

Judy Y Tse