公开(公告)号：US10521159B2

公开(公告)日：2019-12-31

申请号：US15786682

申请日：2017-10-18

Applicant: NETAPP, INC.

Inventor： Nikul Patel ,  Prathamesh Deshpande ,  Rupa Natarajan ,  Anureita Rao ,  Vikhyath Rao

IPC: G06F3/06 ,  G06F16/27 ,  G06F16/242 ,  G06F16/176 ,  G06F16/11

Abstract: Presented herein are system and method for providing a non-disruptive mechanism for splitting a parent volume located on a first aggregate into a new volume, the method comprising: splitting the parent volume, by the network storage system, into a new volume, wherein the new volume comprises an application; and providing a snapshot of the parent volume at the new volume.

公开(公告)号：US11593229B2

公开(公告)日：2023-02-28

申请号：US17030043

申请日：2020-09-23

Applicant: NETAPP, INC.

Inventor： Vikhyath Rao ,  Nikul Y. Patel ,  Ananthan Subramanian ,  Vijayabhaskar Rao Sirigineni ,  Vetrivelan Kaliyaperumal

IPC: G06F11/14 ,  G06F16/21 ,  G06F16/23 ,  G06F16/27

Abstract: Data protection methods and systems for a storage environment are provided. A first-in-first out (FIFO) structure stores a logical representation of a first storage location that retains previous data for a data container, after new data for the data container is stored at a second storage location. The FIFO structure also stores a logical representation of a file system tree structure that is stored in persistent storage, after a consistent point operation. In response to an event, the file system tree structure is selected, based on the file system tree structure being closest to a transaction. A snapshot is generated using the file system tree structure. Thereafter, the data container is restored from the snapshot or from a copy of the snapshot.

公开(公告)号：US20220091943A1

公开(公告)日：2022-03-24

申请号：US17030043

申请日：2020-09-23

Applicant: NETAPP, INC.

Inventor： Vikhyath Rao ,  Nikul Y. Patel ,  Ananthan Subramanian ,  Vijayabhaskar Rao Sirigineni ,  Vetrivelan Kaliyaperumal

IPC: G06F11/14 ,  G06F16/27 ,  G06F16/23 ,  G06F16/21

Abstract: Data protection methods and systems for a storage environment are provided. A first-in-first out (FIFO) structure stores a logical representation of a first storage location that retains previous data for a data container, after new data for the data container is stored at a second storage location. The FIFO structure also stores a logical representation of a file system tree structure that is stored in persistent storage, after a consistent point operation. In response to an event, the file system tree structure is selected, based on the file system tree structure being closest to a transaction. A snapshot is generated using the file system tree structure. Thereafter, the data container is restored from the snapshot or from a copy of the snapshot.

公开(公告)号：US20240045848A1

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

申请号：US18491940

申请日：2023-10-23

Applicant: NetApp Inc.

Inventor： Sanjay Subramanian Seshadri ,  Arindam Banerjee ,  Manan Dahyabhai Patel ,  Raymond Jordan Go ,  Anil Paul Thoppil ,  Ananthan Subramanian ,  Santhosh Selvaraj ,  Nikul Y. Patel ,  Vikhyath Rao ,  Meera Odugoudar ,  Kevin Daniel Varghese

IPC: G06F16/22 ,  G06F16/21 ,  G06F16/248 ,  G06F16/2457 ,  G06F16/2455 ,  G06F16/215

CPC classification number: G06F16/2246 ,  G06F16/217 ,  G06F16/248 ,  G06F16/24573 ,  G06F16/24553 ,  G06F16/215

Abstract: Techniques are provided for key-value store and file system integration to optimize key value store operations. A key-value store is integrated within a file system of a node. A log structured merge tree of the key-value store may be populated with a key corresponding to a content hash of a value data item stored separate from the key. A random distribution search may be performed upon a sorted log of the log structured merge tree to identify the key for accessing the value data item. A starting location for the random distribution search is derived from key information, a log size of the sorted log, and/or a keyspace size of a keyspace associated with the key.

公开(公告)号：US11797510B2

公开(公告)日：2023-10-24

申请号：US17234894

申请日：2021-04-20

Applicant: NetApp Inc.

Inventor： Sanjay Subramanian Seshadri ,  Arindam Banerjee ,  Manan Dahyabhai Patel ,  Raymond Jordan Go ,  Anil Paul Thoppil ,  Ananthan Subramanian ,  Santhosh Selvaraj ,  Nikul Y. Patel ,  Vikhyath Rao ,  Meera Odugoudar ,  Kevin Daniel Varghese

IPC: G06F16/22 ,  G06F16/21 ,  G06F16/248 ,  G06F16/2457 ,  G06F16/2455 ,  G06F16/215

CPC classification number: G06F16/2246 ,  G06F16/215 ,  G06F16/217 ,  G06F16/248 ,  G06F16/24553 ,  G06F16/24573

Abstract: Techniques are provided for key-value store and file system integration to optimize key value store operations. A key-value store is integrated within a file system of a node. A log structured merge tree of the key-value store may be populated with a key corresponding to a content hash of a value data item stored separate from the key. A random distribution search may be performed upon a sorted log of the log structured merge tree to identify the key for accessing the value data item. A starting location for the random distribution search is derived from key information, a log size of the sorted log, and/or a keyspace size of a keyspace associated with the key.

公开(公告)号：US20220335027A1

公开(公告)日：2022-10-20

申请号：US17234894

申请日：2021-04-20

Applicant: NetApp Inc.

Inventor： Sanjay Subramanian Seshadri ,  Arindam Banerjee ,  Manan Dahyabhai Patel ,  Raymond Jordan Go ,  Anil Paul Thoppil ,  Ananthan Subramanian ,  Santhosh Selvaraj ,  Nikul Y. Patel ,  Vikhyath Rao ,  Meera Odugoudar ,  Kevin Daniel Varghese

IPC: G06F16/22 ,  G06F16/21 ,  G06F16/215 ,  G06F16/2457 ,  G06F16/2455 ,  G06F16/248

Abstract: Techniques are provided for key-value store and file system integration to optimize key value store operations. A key-value store is integrated within a file system of a node. A log structured merge tree of the key-value store may be populated with a key corresponding to a content hash of a value data item stored separate from the key. A random distribution search may be performed upon a sorted log of the log structured merge tree to identify the key for accessing the value data item. A starting location for the random distribution search is derived from key information, a log size of the sorted log, and/or a keyspace size of a keyspace associated with the key.