公开(公告)号：WO2010040078A2

公开(公告)日：2010-04-08

申请号：PCT/US2009/059416

申请日：2009-10-02

Applicant: NETAPP, INC. ,  PERIYAGARAM, Subramanian ,  KHONA, Rahul ,  PAWAR, Dnyaneshwar ,  YADAV, Sandeep

Inventor： PERIYAGARAM, Subramanian ,  KHONA, Rahul ,  PAWAR, Dnyaneshwar ,  YADAV, Sandeep

IPC: G06F21/00 ,  G06F15/16 ,  G06F3/06 ,  G06F12/00 ,  H04L12/56

CPC classification number: G06F17/30159 ,  G06F3/061 ,  G06F3/0641 ,  G06F3/067 ,  G06F11/1453 ,  G06F17/30203 ,  H04L67/1097 ,  H04L67/2842

Abstract: A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple "chunks", where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.

Abstract translation: 用于组织数据以促进重复数据消除的技术包括将基于块的数据集划分为多个“块”，其中块边界独立于块边界（由于散列算法） 。 数据集的元数据（例如用于定位数据的块指针）被存储在包括多个级别的树结构中，其中每个级别都包括至少一个节点。 树的最低级别包括多个节点，每个节点包含与数据集的块有关的块元数据。 在缓冲树的最低级别的每个节点中，其中包含的块元数据标识至少一个块。 块（用户级数据）存储在一个或多个系统文件中，这些文件独立于缓冲区树，对用户不可见。

公开(公告)号：EP2756420A1

公开(公告)日：2014-07-23

申请号：EP12831528.0

申请日：2012-09-14

Applicant: NetApp, Inc.

Inventor： YADAV, Sandeep ,  PAWAR, Dnyaneshwar ,  NATARAJAN, Anand

IPC: G06F17/00

CPC classification number: G06F12/00 ,  G06F3/0613 ,  G06F3/0617 ,  G06F3/065 ,  G06F3/0683 ,  G06F11/1448 ,  G06F11/1453 ,  G06F17/30088

Abstract: Method and system for partially cloning a data container with compression is provided. A storage operating system determines if a portion of a source data container that is to be cloned includes a plurality of compressed blocks that are compressed using a non-variable compression group size. The operating system clones the plurality of compressed blocks with the non-variable compression group size and de-compresses a plurality of blocks of the data container that are not within the non-variable compression group size. The plurality of compressed blocks and the plurality of blocks that are not within the non-variable compression group size are then stored as a partially cloned copy of the source data container.

公开(公告)号：EP2724225A1

公开(公告)日：2014-04-30

申请号：EP12721631.5

申请日：2012-04-24

Applicant: NetApp, Inc.

Inventor： PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  LEWIS, Blake ,  FAITH, Rickard, E. ,  PRAKASH, Ashish ,  KESAVAN, Ram ,  SUBRAMANIAN, Ananthan

IPC: G06F3/06 ,  G06F17/30

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641

Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

公开(公告)号：WO2013040329A1

公开(公告)日：2013-03-21

申请号：PCT/US2012/055372

申请日：2012-09-14

Applicant: NETAPP, INC. ,  YADAV, Sandeep ,  PAWAR, Dnyaneshwar ,  NATARAJAN, Anand

Inventor： YADAV, Sandeep ,  PAWAR, Dnyaneshwar ,  NATARAJAN, Anand

IPC: G06F17/00

CPC classification number: G06F12/00 ,  G06F3/0613 ,  G06F3/0617 ,  G06F3/065 ,  G06F3/0683 ,  G06F11/1448 ,  G06F11/1453 ,  G06F17/30088

Abstract: Method and system for partially cloning a data container with compression is provided. A storage operating system determines if a portion of a source data container that is to be cloned includes a plurality of compressed blocks that are compressed using a non-variable compression group size. The operating system clones the plurality of compressed blocks with the non-variable compression group size and de-compresses a plurality of blocks of the data container that are not within the non-variable compression group size. The plurality of compressed blocks and the plurality of blocks that are not within the non-variable compression group size are then stored as a partially cloned copy of the source data container.

Abstract translation: 提供了用于部分克隆数据容器的压缩方法和系统。 存储操作系统确定要克隆的源数据容器的一部分是否包含使用非可变压缩组大小压缩的多个压缩块。 操作系统以非变量压缩组大小克隆多个压缩块，并且解压缩不在非可变压缩组大小内的数据容器的多个块。 然后将不在不可变压缩组大小内的多个压缩块和多个块存储为源数据容器的部分克隆副本。

公开(公告)号：WO2012177318A1

公开(公告)日：2012-12-27

申请号：PCT/US2012/034788

申请日：2012-04-24

Applicant: NETAPP, INC. ,  PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  LEWIS, Blake ,  FAITH, Rickard, E. ,  PRAKASH, Ashish ,  KESAVAN, Ram ,  SUBRAMANIAN, Ananthan

Inventor： PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  LEWIS, Blake ,  FAITH, Rickard, E. ,  PRAKASH, Ashish ,  KESAVAN, Ram ,  SUBRAMANIAN, Ananthan

IPC: G06F3/06 ,  G06F17/30

CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641

Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

Abstract translation: 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。

公开(公告)号：WO2012148734A1

公开(公告)日：2012-11-01

申请号：PCT/US2012/033942

申请日：2012-04-17

Applicant: NETAPP, INC. ,  FAITH, Rickard, E. ,  PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  PRAKASH, Ashish ,  LEWIS, Blake ,  KIMMEL, Jeff ,  DANIEL, Steve

Inventor： FAITH, Rickard, E. ,  PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  PRAKASH, Ashish ,  LEWIS, Blake ,  KIMMEL, Jeff ,  DANIEL, Steve

IPC: G06F3/06

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30203

Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.

Abstract translation: 基于范围的存储架构由存储服务器实现，所述存储服务器从客户端接收对范围的读取请求，其中所述扩展区包括一组连续的块，并且所述读请求包括文件块号。 存储服务器从第一排序数据结构检索区段标识符，其中存储服务器使用接收到的文件块号来遍历第一排序数据结构到区段标识符。 存储服务器从第二排序数据结构检索对范围的引用，其中存储服务器使用所检索的扩展名标识符遍历到引用的第二排序数据结构，并且其中第二排序数据结构在多个卷中是全局的 。 存储服务器使用引用从存储设备检索范围，并将该范围返回给客户端。

公开(公告)号：EP2702475A1

公开(公告)日：2014-03-05

申请号：EP12718513.0

申请日：2012-04-17

Applicant: NetApp, Inc.

Inventor： FAITH, Rickard, E. ,  PERIYAGARAM, Subramaniam ,  YADAV, Sandeep ,  PRAKASH, Ashish ,  LEWIS, Blake ,  KIMMEL, Jeff ,  DANIEL, Steve

IPC: G06F3/06

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0644 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30203

Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.