公开(公告)号：US09477420B2

公开(公告)日：2016-10-25

申请号：US14286900

申请日：2014-05-23

Applicant: NetApp, Inc.

Inventor： Sandeep Yadav ,  Rickard E. Faith ,  Subramaniam V. Periyagaram ,  Blake H. Lewis ,  Ashish Prakash

IPC: G06F9/00 ,  G06F9/315 ,  G06F3/06 ,  G06F17/30

CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30153 ,  G06F2211/1014 ,  G06F2212/401

Abstract: Partially overwriting a compression group without decompressing compressed data can consumption of resources for the decompression. A storage server partially overwrites the compression group when a file block identifier of a client's write request resolves to the compression group. The compression group remains compressed while the partial overwriting is performed.

Abstract translation: 部分覆盖压缩组而不解压压缩数据可以消耗资源进行解压缩。 当客户机的写入请求的文件块标识符解析为压缩组时，存储服务器部分地覆盖压缩组。 在执行部分重写时，压缩组保持压缩。

公开(公告)号：US20150205816A1

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

申请号：US14552292

申请日：2014-11-24

Applicant: NetApp, Inc.

Inventor： Subramanian Periyagaram ,  Rahul Khona ,  Dnyaneshwar Pawar ,  Sandeep Yadav

IPC: G06F17/30

CPC classification number: G06F16/1752 ,  G06F3/061 ,  G06F3/0641 ,  G06F3/067 ,  G06F11/1453 ,  G06F16/183 ,  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: 用于组织数据以便于重复数据删除的技术包括将基于块的数据集划分成多个“块”，其中块边界独立于块边界（由于散列算法）。 数据集的元数据（例如用于定位数据的块指针）被存储在包括多个级别的树结构中，每个级别包括至少一个节点。 树的最低级别包括多个节点，每个节点包含与数据集块大小相关的块元数据。 在缓冲树的最低级别的每个节点中，其中包含的块元数据标识至少一个块。 块（用户级数据）存储在与缓冲树分开的一个或多个系统文件中，并且对用户不可见。

公开(公告)号：US20240061603A1

公开(公告)日：2024-02-22

申请号：US18497925

申请日：2023-10-30

Applicant: NetApp, Inc.

Inventor： Kevin Daniel Varghese ,  Ananthan Subramanian ,  Parag Sarfare ,  Sandeep Yadav ,  Suhas Urkude ,  Rajesh Khandelwal

IPC: G06F3/06

CPC classification number: G06F3/0644 ,  G06F3/064 ,  G06F3/067 ,  G06F3/0613 ,  G06F3/0623 ,  G06F3/0659

Abstract: Methods and systems for co-locating journaling and data storage are provided. Separate journal and volume partitions may be maintained within each logical storage unit (e.g., Logical Unit Number (LUN)) of a distributed storage system. Journaling of metadata associated with write requests received from one or more clients may be distributed by identifying a destination logical storage unit to which data associated with a given write request is to be stored and causing the data and metadata to be persisted to disk by journaling the metadata and the data to respective portions of an active log within the journal partition of the destination logical storage unit. By using the same logical storage unit for both journaling of write requests and writing the data associated with such write requests, the bottleneck due to there being only a single device or storage unit handling all metadata for all write requests can be avoided.

公开(公告)号：US20190018605A1

公开(公告)日：2019-01-17

申请号：US16133284

申请日：2018-09-17

Applicant: NETAPP, INC.

Inventor： Sandeep Yadav ,  Subramanian Periyagaram

IPC: G06F3/06 ,  G06F12/0871 ,  G06F17/30 ,  G06F11/14

Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.

公开(公告)号：US20160070495A1

公开(公告)日：2016-03-10

申请号：US14929018

申请日：2015-10-30

Applicant: NetApp, Inc.

Inventor： Subramaniam Periyagaram ,  Sandeep Yadav ,  Blake H. Lewis ,  Rickard E. Faith

IPC: G06F3/06 ,  G06F12/02 ,  G06F12/12

CPC classification number: G06F3/0619 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0641 ,  G06F3/065 ,  G06F3/067 ,  G06F3/0689 ,  G06F11/00 ,  G06F11/2056 ,  G06F12/023 ,  G06F12/121 ,  G06F2211/1014 ,  G06F2212/1044 ,  G06F2212/401 ,  H04L67/1097

Abstract: A system and method for logically organizing compressed data. In one aspect, a destination storage server receives a write request that includes multiple data blocks and specifies corresponding file block numbers. An extent-based file system executing on the storage server accesses intermediate block entries that each associates one of the file block numbers with a respective extent block number. The file system, in cooperation with a compression engine, compresses the data blocks into a set of one or more compressed data blocks. The file system stores the compressed data blocks at physical locations corresponding to physical block numbers and allocates, within an extent map, pointers from an extent ID to the extent block numbers, and pointers from the extent ID to the physical block numbers.

Abstract translation: 一种用于逻辑组织压缩数据的系统和方法。 一方面，目的地存储服务器接收包含多个数据块的写请求，并指定相应的文件块号。 在存储服务器上执行的基于范围的文件系统访问中间块条目，每个条目将文件块号码之一与相应的扩展块号码相关联。 与压缩引擎协作的文件系统将数据块压缩成一组一个或多个压缩数据块。 文件系统将压缩数据块存储在对应于物理块号码的物理位置处，并且在盘区图中分配从盘区ID到块号码的指针，以及从盘区ID到物理块号的指针。

公开(公告)号：US09043287B2

公开(公告)日：2015-05-26

申请号：US14087345

申请日：2013-11-22

Applicant: NetApp, Inc.

Inventor： Subramaniam Periyagaram ,  Sandeep Yadav ,  Blake Lewis ,  Rickard E. Faith ,  Ashish Prakash ,  Ram Kesavan ,  Ananthan Subramanian

IPC: G06F17/30 ,  G06F3/06

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

Abstract: It is determined that a first data block contains the same data as a second data block. The first data block is associated with a first extent and the second data block is associated with a second extent. In response to determining that the first data block contains the same data as the second data block, the second data block is associated with the first extent and the first data block is disassociated with the second extent.

Abstract translation: 确定第一数据块包含与第二数据块相同的数据。 第一数据块与第一范围相关联，并且第二数据块与第二范围相关联。 响应于确定第一数据块包含与第二数据块相同的数据，第二数据块与第一扩展区相关联，并且第一数据块与第二扩展区分离。

公开(公告)号：US20150039818A1

公开(公告)日：2015-02-05

申请号：US14516308

申请日：2014-10-16

Applicant: NetApp, Inc.

Inventor： Sandeep Yadav ,  Subramanian Periyagaram

IPC: G06F3/06 ,  G06F12/08

CPC classification number: G06F3/0641 ,  G06F3/0608 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0679 ,  G06F11/1453 ,  G06F12/0871 ,  G06F16/1748 ,  G06F16/1824 ,  G06F16/24 ,  G06F2206/1014 ,  G06F2212/222

Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.

Abstract translation: 一种消除磁盘上特殊数据的冗余分配和释放的方法和系统，其中通过提供专门分配存储系统的特殊数据的创新技术，消除了磁盘上特殊数据的冗余分配和释放。 特别分配的数据是在磁盘上预先分配并存储在存储系统的存储器中的数据。 “特殊数据”可以包括任何预先决定的数据，超过预定义共享阈值的数据的一个或多个部分，和/或用户已经被特别识别的数据的一个或多个部分。 例如，在一些实施例中，零填充数据块由存储系统专门分配。 作为另一示例，在一些实施例中，特别分配其内容对应于特定类型文档头的数据块。

公开(公告)号：US12223193B2

公开(公告)日：2025-02-11

申请号：US18497925

申请日：2023-10-30

Applicant: NetApp, Inc.

Inventor： Kevin Daniel Varghese ,  Ananthan Subramanian ,  Parag Sarfare ,  Sandeep Yadav ,  Suhas Urkude ,  Rajesh Khandelwal

IPC: G06F3/06

Abstract: Methods and systems for co-locating journaling and data storage are provided. Separate journal and volume partitions may be maintained within each logical storage unit (e.g., Logical Unit Number (LUN)) of a distributed storage system. Journaling of metadata associated with write requests received from one or more clients may be distributed by identifying a destination logical storage unit to which data associated with a given write request is to be stored and causing the data and metadata to be persisted to disk by journaling the metadata and the data to respective portions of an active log within the journal partition of the destination logical storage unit. By using the same logical storage unit for both journaling of write requests and writing the data associated with such write requests, the bottleneck due to there being only a single device or storage unit handling all metadata for all write requests can be avoided.

公开(公告)号：US11409457B1

公开(公告)日：2022-08-09

申请号：US17239189

申请日：2021-04-23

Applicant: NetApp, Inc.

Inventor： Kevin Daniel Varghese ,  Ananthan Subramanian ,  Parag Sarfare ,  Sandeep Yadav ,  Suhas Urkude ,  Rajesh Khandelwal

IPC: G06F3/06

Abstract: A method and system for co-locating journaling and data storage based on write requests. A write request that includes metadata and data is received from a client. A logical storage unit for storing the metadata and the data is identified. The logical storage unit is divided into a journal partition and a volume partition. The journal partition includes a first log and a second log. Which of the first log and the second log is an active log and which of the first log and the second log is an inactive log are identified. The metadata is recorded in a first location in the active log and the data is recorded in a second location in the active log during a single I/O operation. A reply is sent to the client after the metadata and the data are recorded in the journal partition.

公开(公告)号：US20190050416A1

公开(公告)日：2019-02-14

申请号：US16155645

申请日：2018-10-09

Applicant: NetApp, Inc.

Inventor： Ananthan Subramanian ,  Sandeep Yadav ,  Manish Katiyar

IPC: G06F17/30

Abstract: A file system layout apportions an underlying physical volume into one or more virtual volumes of a storage system. The virtual volumes having a file system and one or more files organized as buffer trees, the buffer trees utilizing indirect blocks to point to the data blocks. The indirect block at the level above the data blocks are grouped into compression groups that point to a set of physical volume block number (pvbn) block pointers.