International Business Machines Corporation

Terri A Menendez

Debra J Benjamin-Deckert

David Carl Frank

Donna N Dillenberger

Paul Michael Cadarette

Robert Stanley Gensler, Jr

Gary Stuart Puchkoff

Wayne Erwin Rhoten

Austin Willoughby

Robert Daniel Love

Gerard Maclean Dearing

Roity Prieto Perez

Jason C Lee

Lawrence L Law

Joseph L Kidd

John J Thomas

Lawrence L T Law

Neal E Bohling

Tony Xu

Brian Lee

Elaine Lai

Gary Pizl

In one embodiment, a method includes receiving an unstructured data record and parsing the unstructured data record to determine a characterization of the unstructured data record. The characterization includes determination of: a number of fields, a length for the fields, and an order of the fields as stored in the unstructured data record. The method also includes obtaining a first key pair that includes a primary key-name associated with a first key-value and hashing at least the first key-value to obtain a hash value. In addition, the method includes updating the unstructured data record to include the hash value as an indexing key thereby creating a modified data record. Also, the method includes storing the modified data record in a structured database. Moreover, the method includes updating an index of the structured database to include an entry for the modified data record, the entry including the hash value.

Storing unstructured data in a structured framework

In one embodiment, a system includes at least one processor and logic configured to receive a request to process data stored in one or more index records in a keyed index of a database, determine an active key range for the one or more index records, and group the one or more index records into a number of groups for parallel processing thereof. In another embodiment, a method for utilizing a keyed index includes receiving a request to process data stored in index records in a keyed index of a database, determining an active key range for the index records, grouping the index records into a number of groups without prior knowledge of a key distribution for dividing the one or more index records into key ranges for parallel processing thereof; and processing the groups of index records in parallel.

Parallel processing of a keyed index file system

In one embodiment, a method includes receiving, at a job control manager, a command specifying execution of a batch application. The method also includes receiving, at the job control manager, a commit count associated with the batch application, and initiating the batch application, with the batch application processing a group of records. The method also includes locking a first record of the group of records in response to the first record being processed by the batch application with the proviso that the batch application does not cause the first record to be unlocked unless the batch application has finished processing a last record in the group of records. Moreover, the method includes committing, in response to the batch application having completed processing of an nth record of the group of records, all records of the group of records that are locked resulting from execution of the batch application.

Preventing long running transactions from holding record locks

A computer-implemented method according to one embodiment includes establishing a predetermined checkpoint and storing a log of duplicate read data in association with the predetermined checkpoint during a running of an application that is processing at least one data set, the duplicate read data including an image of all data retrieved from the at least one data set in response to a plurality of data reads made by the application before the predetermined checkpoint; identifying a first failure of the application; and restarting the application and performing a first replay of the application in response to the first failure.

Replaying processing of a restarted application

In one embodiment, a method for providing alternate keys in a keyed index includes creating a first base record in a keyed index of a database, the first base record including a first unique key and a first data record, wherein the first data record includes at least one sub key and at least one first value, each sub key being correlated with a different one of the at least one first value in a sub key/value pair, and creating one or more alternate key records in the database, each of the alternate key records including one of the at least one sub key which is correlated with the first base record and the first unique key of the first base record. The database adheres to virtual storage access method (VSAM) in some approaches. In other approaches, a number of alternate key records created is equal to a number of first sub keys in the first data record.

Dynamic alternate keys for use in file systems utilizing a keyed index

Provided are a computer program product, system, and method for replicating a source data set to a target data store. A point-in-time copy of the source data set is generated having a data structure identifying the data in the source data set as of a point-in-time. A restore operation is initiated to copy the source data set represented by the point-in-time copy to a restored copy of the source data set consistent with the source data set. The source data set records are transferred from the restored copy to the target data store in the target storage.

Replicating a source data set to a target data store

A computer-implemented method according to one embodiment includes restarting an application at a second system in response to a failure of the application at a first system, receiving replicated logged data from the first system at the second system, updating a second data set at the second system to reflect a first data set at the first system, utilizing the replicated logged data, identifying a first plurality of data reads from the restarted application at the second system, where the first plurality of data reads occur before a predetermined checkpoint, and in response to the first plurality of data reads, retrieving the replicated logged data from the second system, and returning the replicated logged data to the restarted application at the second system.

In various embodiments, a method, system, and computer program product for injecting error code include logic and/or program instructions configured to determine, by a local processor, critical points in executing code of software under test on a remote system, build, by the local processor, a testcase to invoke the software under test on the remote system, determine, by the local processor, an appropriate response action for each critical point based on an error encountered at each critical point as reported by a remote processor of the remote system, cause, by the local processor, the remote processor to inject a critical point segment into the executing code at a corresponding critical point, and receive, by the local processor, a unique identifier of each critical point segment output by the remote processor in response to injecting the critical point segment into the executing code.

System, method, and computer program product for error code injection

In one embodiment, a system includes at least one processor and logic configured to receive a request to process data stored in one or more index records in a keyed index of a database, determine an active key range for the one or more index records, and group the one or more index records into a number of groups for parallel processing thereof. In another embodiment, a method for utilizing a keyed index includes receiving a request to process data stored in index records in a keyed index of a database, determining an active key range for the index records, wherein the active key range is determined based on any of: a type of the index records, a horizontal pointer to a next index record, and a low key value for each index record, and grouping the index records into a number of groups for parallel processing thereof.

A method is described for determining whether to trigger an early commit of a micro-batch transaction. The method includes, during the micro-batch transaction, requesting access to a record using a record retrieval get record call. The method further includes receiving a response to the record retrieval get record call, and determining whether the response includes the record or a flag. The record is processed in response to a determination that the response includes the record. Additionally, in response to a determination that the response includes the flag, it is determined whether to trigger an early commit of the micro-batch transaction.

Opportunistic wait-triggered elastic commit

In one embodiment, a system includes at least one processor and logic integrated with and/or executable by the at least one processor, the logic configured to create a first base record in a keyed index of a database, the first base record including a first unique key and a first data record, wherein the first data record includes at least one sub key and at least one first value, each sub key being correlated with a different one of the at least one first value in a sub key/value pair, and create one or more alternate key records in the database, each of the alternate key records including one of the at least one sub key which is correlated with the first base record and the first unique key of the first base record. More embodiments of systems, methods, and computer program products for providing alternate keys are also presented.

In one general embodiment, a computer-implemented method includes identifying a record having a lock being held being held by a first process, where the process is running within a first system of a plurality of systems, sending an identification of the lock for the record to a second system of the plurality of systems, receiving, at the first system, from the second system, information associated with a first request for the lock of the record, determining at the first system a second request for the lock of the record held by the first process, and conditionally releasing the lock being held by the first process, based on an analysis of the information associated with the first request and information associated with the second request.

Conditionally releasing locks in response to requests

A computer-implemented method according to one embodiment includes establishing a predetermined checkpoint and storing duplicate read data in association with the predetermined checkpoint during a running of an application that is processing at least one data set, identifying a failure of the application, restarting the application in response to the failure, and enabling a replay of the processing of the at least one data set by the restarted application, utilizing the predetermined checkpoint and the duplicate read data.

Growing community of inventors

Richmond, MA, United States of America

Terri A Menendez