Data set management
    32.
    发明授权

    公开(公告)号:US09715353B2

    公开(公告)日:2017-07-25

    申请号:US14488223

    申请日:2014-09-16

    IPC分类号: G06F3/06

    摘要: 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.

    INTELLIGENT DATA MOVEMENT PREVENTION IN TIERED STORAGE ENVIRONMENTS

    公开(公告)号:US20170123716A1

    公开(公告)日:2017-05-04

    申请号:US14929359

    申请日:2015-11-01

    IPC分类号: G06F3/06

    摘要: 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.

    SELECTING PAGES IMPLEMENTING LEAF NODES AND INTERNAL NODES OF A DATA SET INDEX FOR REUSE
    34.
    发明申请
    SELECTING PAGES IMPLEMENTING LEAF NODES AND INTERNAL NODES OF A DATA SET INDEX FOR REUSE 有权
    选择页面执行数据集索引的叶子和内部重现

    公开(公告)号:US20160266809A1

    公开(公告)日:2016-09-15

    申请号:US15159716

    申请日:2016-05-19

    摘要: 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.

    摘要翻译: 提供了一种用于选择实现叶节点和数据集索引的内部节点的页面以在存储器中重新使用的计算机程序产品,系统和方法。 存储器中的页面被分配给表示数据集的数据集索引的全部或一部分的树数据结构的内部节点和叶节点。 至少一个持续时间参数指示一个时间量,未使用的页面实现内部节点或叶节点之一有资格重用。 选择分配给至少一个叶节点和内部节点的至少一个选定页面,该至少一个叶节点和内部节点尚未用于至少一个持续时间参数中的一个用于重用。