International Business Machines Corporation

Derek Logan Erdmann

David C Reed

Max D Smith

Thomas C Reed

Franklin Emmert McCune

Miguel Angel Perez

Sosuke Matsui

Michael Robert Scott

Dustin A Helak

Eric J Harris

Franklin E Mccune

Provided are a computer program product, system, and method for generating node access information for a transaction accessing nodes of a data set index. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. A transaction is processed with respect to the data set that involves accessing the internal and leaf nodes in the tree data structure, wherein the transaction comprises a read or write operation. Node access information is generated in transaction information, for accessed nodes comprising nodes in the tree data structure accessed as part of processing the transaction. The node access information includes a pointer to the page allocated to the accessed node prior to the transaction in response to the node being modified during the transaction.

Generating node access information for a transaction accessing nodes of a data set index

A method for storing data includes establishing an extended generation group comprising a plurality of data sets. The plurality of data sets includes a first data set containing primary members and a first number of generations of each of the primary members, and a second data set containing a second number of generations of each of the primary members. The method further indicates, in the metadata of the first data set, a maximum number of generations allowable in each of the first and second data sets When a primary member is modified in the first data set, the method automatically moves an oldest generation in the first data set to the second data set, and deletes an oldest generation in the second data set to ensure that the extended generation group does not exceed the maximum number.

PDSE extended generation grouping for tiered storage systems

Methods that can parallel search a partitioned data set extended (PSDE) indexes are provided. One method includes managing a set of quick indexes in a memory device in which the set of quick indexes include references to storage locations for a subset of members of a PDSE stored in a set of long-term storage devices. The method further includes receiving a request to determine a storage location of a member of the PDSE and, in response to the request, searching the set of quick indexes to determine the storage location. Systems and computer program products for performing the above method are also provided.

Parallel search of a partitioned data set extended (PDSE) in parallel

Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set. At least at least one duration parameter indicates an amount of time after which an unused page implement one of the internal nodes or leaf nodes is eligible for reuse. Selection is made of at least one selected page allocated to at least one of the leaf nodes and the internal nodes that has not been used for one of the at least one duration parameter for reuse.

Selecting pages implementing leaf nodes and internal nodes of a data set index for reuse

Provided are a computer program product, system, and method for an application to provide for, in one embodiment, using hierarchical storage management to respond to a request to delete a data set by migrating the data set to another storage tier in a storage system before deleting the data set from its current location. As a result, the data set is stored on another tier to provide an opportunity to reverse the decision to delete the data set. In one embodiment, a temporary interval of time is provided to reverse the deletion decision and restore the data set from the migrated data set, before the data set is permanently deleted.

Data set management

A computer-implemented method according to one embodiment includes intercepting one or more updates made to a catalog data set, storing the one or more updates in an update buffer, retrieving the one or more updates from the update buffer, sequentially applying the one or more updates to a backup catalog data set, identifying a request to replace the catalog data set, and replacing the catalog data set with the backup catalog data set, in response to the request.

Catalog backup and recovery using logical mirroring

A method for managing volumes in a scratch pool of a virtual tape system is disclosed. In one embodiment, such a method provides a scratch pool containing volumes for use in a virtual tape system. The method further enables a user to predefine an external pool of volumes residing outside of the scratch pool. This external pool may be hidden to a host system accessing the virtual tape system. The method monitors current and/or past usage of the volumes in the scratch pool and, based on the usage, predicts a future need for volumes in the scratch pool. The method automatically moves volumes between the external pool and the scratch pool in accordance with the future need. A corresponding system and computer program product are also disclosed.

Dynamic scratch pool management on a virtual tape system

A method for storing data includes establishing an extended generation group comprising a plurality of data sets. The plurality of data sets include a first data set containing primary members and a first number of generations of each of the primary members, and a second data set containing a second number of generations of each of the primary members. The first data set and the second data set are stored on different tiers of a tiered storage system, and may even be stored on different volumes. The first data set may be stored on higher performance storage media and the second data set may be stored on lower performance storage media. Additionally, the second number will typically be greater than the first number so that more generations are stored on lower performance storage media. A corresponding system and computer program product are also disclosed.

A method for anonymizing a data set dump includes detecting an error in an original data set and generating a copy of the original data set. Like the original data set, the copy contains an index and a plurality of members. The method reads the index to locate members within the copy that are reachable by the index. The method then converts the copy to a scrubbed copy by overwriting customer data within the members, while retaining the index, structure of the members, and quantity of data within the data set. In certain embodiments, the method further locates lost members within the copy that are not referenced by the index, and overwrites customer data within the lost members. The scrubbed copy may then be transmitted to a technician for examination since all potentially sensitive/confidential data has been removed. A corresponding system and computer program product are also disclosed.

Growing community of inventors

Tucson, AZ, United States of America

Derek Logan Erdmann