Patents by Inventor Rohit Shekhar

Rohit Shekhar has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20250077522
    Abstract: Systems and methods for optimizing database routing in accordance with embodiments of the invention are illustrated. One embodiment includes a tiered database. The tiered database includes a data warehouse used to store obtained data. The tiered database includes a relational layer that stores a copy of a subset of the obtained data within a certain period of recency. The tiered database includes a query planner. The query planner is configured to receive a new query and determine a query plan to respond to the query. The query planner is configured to compute, from a set of database metrics and the preliminary query plan, a storage access cost. The query planner is configured to route the query based on the storage access cost, wherein the query is routed: to the data warehouse when the storage access cost exceeds a predetermined threshold; and to the relational layer otherwise.
    Type: Application
    Filed: August 30, 2024
    Publication date: March 6, 2025
    Applicant: ZettaBlock, Inc
    Inventors: Rohit Shekhar, Chi Zhang, Ruisheng Shi
  • Patent number: 12216944
    Abstract: 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.
    Type: Grant
    Filed: October 6, 2023
    Date of Patent: February 4, 2025
    Assignee: Rubrik, Inc.
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Publication number: 20240104495
    Abstract: A system for tracking inventory inside a warehouse with put-away accuracy is provided. The system 100 includes unmanned aerial vehicle (UAV) 102 including image capturing device 102A, warehouse 104, inventory tracking unit 106, user device 108, cloud server 110, and network 112. The UAV 102 is configured to capture media contents of pre-defined space within the warehouse 104 using image capturing device 102A. The pre-defined space includes rack bays with unique rack bay identifier and inventory items stocked on rack bays with pallet identifier that is similar to corresponding unique rack bay identifier. The inventory tracking unit 106 determines inventory data including empty space, inventory mismatch, and inventory record by processing the media contents using machine learning models 106A-B. The inventory tracking unit 106 sends empty space alert and mismatch alert to user and transmits inventory data to cloud server 110 and user device 108 through network 112.
    Type: Application
    Filed: November 17, 2022
    Publication date: March 28, 2024
    Inventors: Job Varughese Philip, Rohit Shekhar Pingulkar, Gourav Raju Bhure, Rajesh Jagnarayan Roy
  • Publication number: 20240036773
    Abstract: 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.
    Type: Application
    Filed: October 6, 2023
    Publication date: February 1, 2024
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Patent number: 11822827
    Abstract: 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.
    Type: Grant
    Filed: March 14, 2022
    Date of Patent: November 21, 2023
    Assignee: Rubrik, Inc.
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Publication number: 20220197512
    Abstract: 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.
    Type: Application
    Filed: March 14, 2022
    Publication date: June 23, 2022
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Patent number: 11340838
    Abstract: 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.
    Type: Grant
    Filed: June 2, 2021
    Date of Patent: May 24, 2022
    Assignee: Rubrik, Inc.
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Patent number: 11340839
    Abstract: 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.
    Type: Grant
    Filed: June 2, 2021
    Date of Patent: May 24, 2022
    Assignee: Rubrik, Inc.
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Patent number: 11294603
    Abstract: 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.
    Type: Grant
    Filed: October 22, 2020
    Date of Patent: April 5, 2022
    Assignee: Rubrik, Inc.
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Publication number: 20210286522
    Abstract: 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.
    Type: Application
    Filed: June 2, 2021
    Publication date: September 16, 2021
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Publication number: 20210286521
    Abstract: 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.
    Type: Application
    Filed: June 2, 2021
    Publication date: September 16, 2021
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Publication number: 20210278971
    Abstract: 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.
    Type: Application
    Filed: October 22, 2020
    Publication date: September 9, 2021
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Patent number: 10877934
    Abstract: 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.
    Type: Grant
    Filed: June 29, 2017
    Date of Patent: December 29, 2020
    Assignee: RUBRIK, INC.
    Inventors: Rajath Subramanyam, Pin Zhou, Prasenjit Sarkar, Rohit Shekhar, Hyojun Kim
  • Patent number: 10852998
    Abstract: 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.
    Type: Grant
    Filed: February 27, 2017
    Date of Patent: December 1, 2020
    Assignee: RUBRIK, INC.
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Patent number: 10754735
    Abstract: 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.
    Type: Grant
    Filed: November 20, 2017
    Date of Patent: August 25, 2020
    Assignee: salesforce.com, inc.
    Inventors: Rohit Shekhar, Francis Zhang
  • Publication number: 20190155698
    Abstract: 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.
    Type: Application
    Filed: November 20, 2017
    Publication date: May 23, 2019
    Inventors: Rohit Shekhar, Francis Zhang
  • Publication number: 20190005059
    Abstract: 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.
    Type: Application
    Filed: June 29, 2017
    Publication date: January 3, 2019
    Inventors: Rajath Subramanyam, Pin Zhou, Prasenjit Sarkar, Rohit Shekhar, Hyojun Kim
  • Publication number: 20170249087
    Abstract: 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.
    Type: Application
    Filed: February 27, 2017
    Publication date: August 31, 2017
    Inventors: Rohit Shekhar, Hyo Jun Kim, Prasenjit Sarkar, Maohua Lu, Ajaykrishna Raghavan, Pin Zhou
  • Patent number: 9621466
    Abstract: 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.
    Type: Grant
    Filed: May 23, 2014
    Date of Patent: April 11, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Praveen K. Padia, William J. Scales, Rohit Shekhar
  • Patent number: 9483188
    Abstract: 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.
    Type: Grant
    Filed: February 12, 2016
    Date of Patent: November 1, 2016
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Praveen K. Padia, Rohit Shekhar