DATA BLOCK NAME BASED EFFICIENT RESTORE OF MULTIPLE FILES FROM DEDUPLICATED STORAGE

    公开(公告)号:EP3477481A3

    公开(公告)日:2020-03-25

    申请号:EP18203064.3

    申请日:2018-10-29

    Applicant: NetApp, Inc.

    Abstract: A storage appliance can be designed to facilitate efficient restore of multiple backed up files in a system that allows files to share data blocks. A data management application or storage OS names data blocks and communicates those names to the storage appliance when backing up to or through the storage appliance. The storage appliance can leverage the data block names when restoring a group of files by restoring at data block granularity instead of file granularity. Restoring at the granularity of the data blocks by their names allows the storage appliance to avoid repeatedly sending a same data block to the restore requestor (e.g., a storage OS or data management application) while still instructing the restore requestor how to reconstruct the corresponding file(s) with mappings between valid data ranges and the named data blocks.

    MANAGEMENT OF EXTENT BASED METADATA WITH DENSE TREE STRUCTURES WITHIN A DISTRIBUTED STORAGE ARCHITECTURE
    14.
    发明公开
    MANAGEMENT OF EXTENT BASED METADATA WITH DENSE TREE STRUCTURES WITHIN A DISTRIBUTED STORAGE ARCHITECTURE 审中-公开
    密集的树形结构管理硕士学位,基于元数据在分布式存储体系

    公开(公告)号:EP3036616A1

    公开(公告)日:2016-06-29

    申请号:EP14781721.7

    申请日:2014-09-11

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, a node coupled to one or more storage devices executes a storage input/output (I/O) stack having a volume layer. The volume layer manages volume metadata embodied as mappings from offsets of a logical unit (LUN) to extent keys associated with storage locations for extents on the one or more storage devices. Volume metadata is maintained as a dense tree metadata structure representing successive points in time. The dense tree metadata structure has multiple levels, wherein a top level of the dense tree metadata structure represents newer volume metadata changes and descending levels of the dense tree metadata structure represent older volume metadata changes. The node accesses a latest version of changes to the volume metadata by searching from the top level to the descending levels in the dense tree metadata structure.

    Abstract translation: 在一个,实施例的耦合到一个或多个存储设备执行具有层卷的存储输入/输出(I / O)堆栈的节点。 体积层管理体现为从与用于所述一个或多个存储装置的存储盘区的位置相关联程度密钥的逻辑单元(LUN)的偏移映射体积元数据。 卷元数据被保持作为表示时间连续点的致密树元数据结构。 致密树元数据结构有多个级别,worin致密树元数据结构的顶层darstellt较新的体积元数据的变化和降序致密树元数据结构的电平表示的年龄较大的体积元数据的变化。 节点通过从顶层到在茂密的树元数据结构的下降水平搜索访问最新版本更改卷的元数据。

    INTELLIGENT SNAPSHOT TIERING
    15.
    发明公开

    公开(公告)号:EP3477482A3

    公开(公告)日:2019-08-21

    申请号:EP18203066.8

    申请日:2018-10-29

    Applicant: NetApp, Inc.

    Abstract: Intelligent snapshot tiering facilitates efficient management of snapshots and efficient restore of snapshots. For intelligent snapshot tiering, a storage appliance can limit cross-tier migration to invalidated data blocks of a snapshot instead of an entire snapshot. Based on a policy, a storage appliance can identify a snapshot to be migrated to another storage tier and then determine which data blocks are invalidated by an immediately succeeding snapshot. This would limit network bandwidth consumption to the invalidated data blocks and maintain the valid data blocks at the faster access storage tier since the more recent snapshots are more likely to be restored.

    INTELLIGENT SNAPSHOT TIERING
    16.
    发明公开

    公开(公告)号:EP3477482A2

    公开(公告)日:2019-05-01

    申请号:EP18203066.8

    申请日:2018-10-29

    Applicant: NetApp, Inc.

    Abstract: Intelligent snapshot tiering facilitates efficient management of snapshots and efficient restore of snapshots. For intelligent snapshot tiering, a storage appliance can limit cross-tier migration to invalidated data blocks of a snapshot instead of an entire snapshot. Based on a policy, a storage appliance can identify a snapshot to be migrated to another storage tier and then determine which data blocks are invalidated by an immediately succeeding snapshot. This would limit network bandwidth consumption to the invalidated data blocks and maintain the valid data blocks at the faster access storage tier since the more recent snapshots are more likely to be restored.

    DATA BLOCK NAME BASED EFFICIENT RESTORE OF MULTIPLE FILES FROM DEDUPLICATED STORAGE

    公开(公告)号:EP3477481A2

    公开(公告)日:2019-05-01

    申请号:EP18203064.3

    申请日:2018-10-29

    Applicant: NetApp, Inc.

    Abstract: A storage appliance can be designed to facilitate efficient restore of multiple backed up files in a system that allows files to share data blocks. A data management application or storage OS names data blocks and communicates those names to the storage appliance when backing up to or through the storage appliance. The storage appliance can leverage the data block names when restoring a group of files by restoring at data block granularity instead of file granularity. Restoring at the granularity of the data blocks by their names allows the storage appliance to avoid repeatedly sending a same data block to the restore requestor (e.g., a storage OS or data management application) while still instructing the restore requestor how to reconstruct the corresponding file(s) with mappings between valid data ranges and the named data blocks.

Patent Agency Ranking