Rubrik, Inc.

International Business Machines Corporation

Salesforce Com, Inc.

Rohit Shekhar

Pin Zhou

Prasenjit Sarkar

Maohua Lu

Ajaykrishna Raghavan

Praveen Kumar Padia

Hyo Jun Kim

William James Scales

Rajath Subramanyam

Hyojun Kim

Francis Zhang

Embodiments disclosed herein provide systems, methods, and computer readable media for sub-cluster recovery in a data storage environment having a plurality of storage nodes. In a particular embodiment, the method provides scanning data items in the plurality of nodes. While scanning, the method further provides indexing the data items into an index of a plurality of partition groups. Each partition group includes data items owned by a particular one of the plurality of storage nodes. The method then provides storing the index.

Sub-cluster recovery using a partition group index

The method disclosed is for instantiating a second cluster based on a first cluster. For at least one node of a second plurality of nodes, generating per node data based on mappings between a plurality of partition groups and a first plurality of nodes, the first plurality of nodes corresponding to the first cluster. The method further discloses identifying data items included in the plurality of partition groups based on the mappings between the plurality of partition groups and the first plurality of nodes. The method further discloses each partition group corresponding to a node of the first plurality of nodes and comprising a subset of data items stored in the node. The method further discloses loading the data items included in the plurality of partition groups onto the second plurality of nodes, the second plurality of nodes corresponding to the second cluster.

The method disclosed includes scanning data items stored in the first plurality of nodes of a first cluster. While scanning, creating a partition group index indexing the data items into a plurality of partition groups. Each partition group corresponds to a node of the first plurality of nodes and comprises a subset of data items stored in the node. Storing the index. Instantiating a second cluster, comprising generating per node data, for each node of a second plurality of nodes, based on mappings between the partition groups and the first plurality of nodes. Identifying the data items included in the partition groups according to the partition group index and loading the data items included in the partition groups onto the second plurality of nodes.

Efficient backup of compaction based databases

Distributed storage reservation for distributed data recovery is described. A system identifies a total number of connected computers, a storage capacity of each connected computer, and a maximum storage capacity of the identified storage capacities of the connected computers. The system determines a reserved storage capacity based on the maximum storage capacity and a reduced total number of the connected computers. The system provisions the reserved storage capacity in each connected computer. The system stores replicas of a database on the connected computers and on multiple computers, the multiple computers being the same as or different than the connected computers. The system identifies that a connected computer storing a replica of the database is unavailable. The system restores a replica of the database from at least one computer storing one replica to the reserved storage capacity in each of multiple available connected computers.

Distributed storage reservation for recovering distributed data

Provided are a method, computer program product and system for network multi-pathing. Paths to a storage system are through a first network type and a second network type. The first network type has a higher Input/Output (I/O) per second performance characteristic than the second network type. A length is determined from a received I/O request. The I/O request is sent on one of the paths to the storage system through the first network type in response to determining that the length of the I/O request is below a threshold length. The I/O request is sent on one of the paths to the storage system through the second network type in response to determining that the length of the I/O request is above the threshold length.

Storage area network multi-pathing

A mechanism is provided to optimize performance of a storage system. A plurality of I/O requests is received. A subset of the plurality of I/O requests is selected. The size of each I/O request of the subset of the plurality of I/O requests is less than a predetermined size, but the combined size of the subset of the plurality of I/O requests is greater than the predetermined size. Furthermore, the subset of the plurality of I/O requests is associated with a single logical unit number. A data transfer command which includes the subset of the plurality of I/O requests is generated. The data transfer command is transmitted.

Growing community of inventors

Sunnyvale, CA, United States of America

Rohit Shekhar