Cohesity, Inc.

Emc IP Holding Company LLC

Cloudera, Inc.

Emc Corporation

Prashant Pogde

Markose Thomas

Mohit Aron

Mahesh Kamat

Yamini Allu

Sunil Moolchandani

Fabiano C Botelho

Venkata Ranga Radhanikanth Guturi

Praveen Kumar Yarlagadda

Nitin Garg

Akshat Agarwal

Siddharth Jivan Wagle

Uma Maheswara Rao Gangumalla

Apurv Gupta

Ritesh H Shukla

Zheng Cai

Raghavendra Chowdary Maddipatla

Sureshbabu Murugesan

Arpit Ashok Agarwal

Karthik Krishnamoorthy

Adaikkappan Arumugam

Disclosed examples include writing first information blocks in first storage; transmitting second information blocks to second storage, the first and second information blocks including data blocks and parity blocks; determining whether a failed information block can be reconstructed based on available ones of the first information blocks in the first storage; and writing a reconstructed information block in the first storage to replace the failed information block.

Methods and apparatus to implement failure recovery of data

Disclosed examples create at least first and second database shards in a leader node, the leader node located in a consensus ring; and cause replication of first namespace metadata in the at least the first and second database shards of the leader node and in at least first and second database shards in a follower node, the follower node located in the consensus ring.

Methods and apparatus to organize an object store namespace

A request to obtain an identified content item is received. It is determined that the identified content item is stored in a plurality of locations. It is determined to obtain the identified content item from a first storage location storing a first serialized representation of a file system snapshot that includes the identified content item and a second storage location storing a second serialized representation of the file system snapshot that includes the identified content item based on available resources associated with the plurality of locations. The identified content item is extracted from the first serialized representation at the first storage location and from the second serialized representation at the second storage location including building a stubbed tree data structure using the first serialized representation and the second serialized representation. The extracted identified content item is provided using the stubbed tree data structure.

Restoration of specified content from an archive

A method and system for performing incremental backup of a network attached storage (NAS) device are described. A storage capture instance associated with a first time instance is received from a network attached storage device. At least a portion of metadata of tracked network packets associated with the network attached storage device is also received. At least one changed content item of the network attached storage device that has changed since the first time instance is identified by analyzing the at least the portion of the metadata of the tracked network packets received. An incremental backup of the network attached storage device is performed at a second time instance based at least in part on the at least one changed content item identified.

Packet-based differential backup of network-attached storage device content

A file directory tree structure of a selected storage snapshot is dynamically divided into different portions. A plurality of the different file directory tree structure portions are analyzed in parallel to identify any changes of the selected storage snapshot from a previous storage snapshot. To analyze each of the plurality of the different file directory tree structure portions, a processor is further configured to traverse and compare a corresponding file directory tree structure portion of the selected storage snapshot with a corresponding portion of a file directory tree structure of the previous storage snapshot while at least another one of the plurality of the different file directory tree structure portions of the selected storage snapshot is being analyzed in parallel.

Determining differences between two versions of a file directory tree structure

A method and system for obtaining identified content items that have been backed up is disclosed. The method includes receiving a request to obtain an identified content item. A backup location among a plurality of backup locations where the identified content item is stored is determined. It is determined whether the backup location corresponds to a serialized representation of a backup snapshot including the identified content item. In response to a determination that the backup location corresponds to the serialized representation, the identified content item is extracted from the serialized representation including building a stubbed snapshot tree using the serialized representation. As a response to the request, the identified content item is provided and extracted using the stubbed snapshot tree.

A compliance audit log of a data storage is obtained. The compliance audit log is analyzed to identify one or more files associated with a mounted storage volume that have changed since a previous backup snapshot of the mounted storage volume associated with the data storage. An incremental backup snapshot of the mounted storage volume is caused to be performed based on a result of the analysis of the compliance audit log.

Compliance audit logging based backup

In one embodiment, in response to a request received from a client for retrieving a data object stored in a storage system, a root key is obtained from the request. The data object is represented by metadata in a hierarchical structure having a plurality of levels. Each level includes a plurality of nodes and each node being one of a root node, a leaf node and an intermediate node. The hierarchical structure of metadata associated with the data object is traversed in a top-down approach to decrypt each of a plurality of nodes in the hierarchical structure using a key provided from its parent node, starting from the root node to the leaf nodes, including decrypting the root node using the root key. Decrypted data associated with the plurality of nodes is transmitted to the client.

Content aware hierarchical encryption for secure storage systems

Methods, systems, and apparatus for optimizing a cache memory device of a storage system are described. In one embodiment, a first base segment tree representing a first full backup including data and metadata describing the data is cached in a cache memory device. Subsequently, a plurality of incremental segment trees representing incremental backups to the first full backup are cached in the cache memory device. Each of incremental segment trees corresponding to the changes to the first full backup, without modifying the first base segment tree in response to the changes. At least two of the incremental segment trees are merged into an updated incremental segment tree to reduce a storage space of the cache memory device to store the incremental segment trees. The updated incremental segment tree comprises data and metadata represented by two or more incremental segment trees.

Method to optimize random IOS of a storage device for multiple versions of backups using incremental metadata

Methods, systems, and apparatus for providing data storage services of a storage system are described. In one embodiment, a first file representing a first full backup including data and metadata describing the data is cached as a first segment tree having a plurality of layers of nodes in a tree hierarchy. A second file representing an incremental backup of the first full backup is cached as a second segment tree in the cache memory device. The second segment tree describes changes of the data and the metadata of the incremental backup in view of the data and the metadata of the first full backup without caching any of nodes of the first segment tree again. The first and second segment trees are collectively used to represent a second full backup based on the incremental backup and the first full backup.

Sparse segment trees for high metadata churn workloads

Embodiments are directed to a method of minimizing latency and input/output (I/O) operations in a data storage system by defining a sparse metadata segment tree to identify changed data blocks, wherein a full version of the tree is stored in a memory and modified versions of the tree are stored in cache memory, and using the sparse metadata segment tree to perform at least one data storage application including file verification, file replication, file restores, and file system snapshots.

Sparse metadata segment tree for efficient file storage operations in evolving backup workloads

In one embodiment, metadata of a data object to be stored in a storage system is received, where the metadata is in a hierarchical structure having multiple levels, each level having multiple nodes and each node being one of a root node, a leaf node and an intermediate node. Each leaf node represents a deduplicated segment associated with the data object. The hierarchical structure is traversed to encrypt each of the nodes in a bottom-up approach, starting from leaf nodes, using different keys. A child key for encrypting content of a child node is stored in a parent node that references the child node, and the child key is encrypted by a parent key associated with the parent node. The encrypted content of the nodes are then stored in one or more storage units of the storage system in a deduplicated manner.

Growing community of inventors

Sunnyvale, CA, United States of America

Prashant Pogde