摘要:
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.
摘要:
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.
摘要:
A method for preventing unnecessary data movement in a tiered storage environment is disclosed. In one embodiment, such a method migrates a data set from a storage area of a first storage tier to a second storage tier, and makes the storage area available to store other data. The method is further configured to recall the data set from the second storage tier to the first storage tier. When performing such a recall, the method checks whether the storage area has been at least partially overwritten with other data. In the event the storage area has not been at least partially overwritten, the method recovers the data set on the storage area. In the event the storage area has been at least partially overwritten, the method migrates the data set from the second storage tier to the first storage tier. A corresponding system and computer program product are also disclosed.
摘要:
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.