公开(公告)号：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.

公开(公告)号：WO2013043438A1

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

申请号：PCT/US2012/054925

申请日：2012-09-12

Applicant: NETAPP, INC. ,  LEWIS, Blake ,  EDWARDS, John, K. ,  DESHMUKH, Vijay ,  KUMAR, Kapil ,  DESAI, Rajesh

Inventor： LEWIS, Blake ,  EDWARDS, John, K. ,  DESHMUKH, Vijay ,  KUMAR, Kapil ,  DESAI, Rajesh

IPC: G06F12/00 ,  G06F3/06 ,  G06F9/06

CPC classification number: G06F17/30215 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/067 ,  G06F11/2094 ,  G06F11/2097

Abstract: A technique to name data is disclosed to allow preservation of storage efficiency over a link between a source and a destination in a replication relationship as well as in storage at the destination. The technique allows the source to send named data to the destination once and refer to it by name multiple times in the future, without having to resend the data. The technique also allows the transmission of data extents to be decoupled from the logical containers that refer to the data extents. Additionally, the technique allows a replication system to accommodate different extent sizes between replication source and destination while preserving storage efficiency.

Abstract translation: 公开了一种名称数据的技术，以允许通过复制关系中的源和目的地之间的链路以及在目的地的存储来保持存储效率。 该技术允许源将命名数据发送到目的地一次，并在将来多次引用它，而不必重新发送数据。 该技术还允许数据扩展区的传输与引用数据扩展区的逻辑容器进行解耦。 此外，该技术允许复制系统适应复制源和目的地之间的不同扩展大小，同时保持存储效率。

公开(公告)号：EP2758883A1

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

申请号：EP12833960.3

申请日：2012-09-12

Applicant: NetApp, Inc.

Inventor： LEWIS, Blake ,  EDWARDS, John, K. ,  DESHMUKH, Vijay ,  KUMAR, Kapil ,  DESAI, Rajesh

IPC: G06F12/00 ,  G06F3/06 ,  G06F9/06

CPC classification number: G06F17/30215 ,  G06F3/0608 ,  G06F3/0641 ,  G06F3/067 ,  G06F11/2094 ,  G06F11/2097

Abstract: A technique to name data is disclosed to allow preservation of storage efficiency over a link between a source and a destination in a replication relationship as well as in storage at the destination. The technique allows the source to send named data to the destination once and refer to it by name multiple times in the future, without having to resend the data. The technique also allows the transmission of data extents to be decoupled from the logical containers that refer to the data extents. Additionally, the technique allows a replication system to accommodate different extent sizes between replication source and destination while preserving storage efficiency.

公开(公告)号：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.