Patents by Inventor Harsh Verma

Harsh Verma 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: 20250106275
    Abstract: A technique may include receiving, by a management service a plurality of instance configurations from a client device. The technique may then include receiving, by the management service, information identifying a launch request for a compute instance. The technique may include determining, by the management service, one or more candidate shapes for the compute instance based at least in part on the plurality of instance configurations. The technique may include selecting, by the management service and from the one or more candidate shapes, a launch shape for the compute instance and launching the compute instance using the launch shape. The technique may then include providing, the client device access to the compute instance, launched based on the launch shape.
    Type: Application
    Filed: December 10, 2024
    Publication date: March 27, 2025
    Applicant: Oracle International Corporation
    Inventors: Jonathan Luke Herman, Art Plata, Joshua Potter, John Matthew Mullins, Nathan Cook, Nathan Turner, Tianyi Wei, Amit Vasudevan, Haifeng Ren, Harsh Verma, Jiafeng Yang, John David Martinez, Daniel Stuart Goldfein, Mahima Tomer
  • Patent number: 12206729
    Abstract: A technique may include receiving, by a management service a plurality of instance configurations from a client device. The technique may then include receiving, by the management service, information identifying a launch request for a compute instance. The technique may include determining, by the management service, one or more candidate shapes for the compute instance based at least in part on the plurality of instance configurations. The technique may include selecting, by the management service and from the one or more candidate shapes, a launch shape for the compute instance and launching the compute instance using the launch shape. The technique may then include providing, the client device access to the compute instance, launched based on the launch shape.
    Type: Grant
    Filed: April 7, 2023
    Date of Patent: January 21, 2025
    Assignee: Oracle International Corporation
    Inventors: Jonathan Luke Herman, Art Plata, Joshua Potter, John Matthew Mullins, Nathan Cook, Nathan Turner, Tianyi Wei, Amit Vasudevan, Haifeng Ren, Harsh Verma, Jiafeng Yang, John David Martinez, Daniel Stuart Goldfein, Mahima Tomer
  • Publication number: 20240340336
    Abstract: A technique may include receiving, by a management service a plurality of instance configurations from a client device. The technique may then include receiving, by the management service, information identifying a launch request for a compute instance. The technique may include determining, by the management service, one or more candidate shapes for the compute instance based at least in part on the plurality of instance configurations. The technique may include selecting, by the management service and from the one or more candidate shapes, a launch shape for the compute instance and launching the compute instance using the launch shape. The technique may then include providing, the client device access to the compute instance, launched based on the launch shape.
    Type: Application
    Filed: April 7, 2023
    Publication date: October 10, 2024
    Applicant: Oracle International Corporation
    Inventors: Jonathan Luke Herman, Art Plata, Joshua Potter, John Matthew Mullins, Nathan Cook, Nathan Turner, Tianyi Wei, Amit Vasudevan, Haifeng Ren, Harsh Verma, Jiafeng Yang, John David Martinez, Daniel Stuart Goldfein, Mahima Tomer
  • Patent number: 12105742
    Abstract: Embodiments are directed to managing data. A data model that includes data type nodes and relationship edges may be provided. Other data types and other data type relationships may be provided and included in the data model. If a portion of the nodes in the data model may be downstream of leaf nodes in the graphlet: the data model may be traversed to visit the downstream nodes; shortcut edges may be generated to each downstream node associated with shortcut nodes. If a second portion of the nodes in the data model may be upstream of the leaf nodes: the data model may be traversed upwards from the leaf nodes; other shortcut edges may be generated to each node visited in the upwards traversal associated with shortcut nodes.
    Type: Grant
    Filed: January 31, 2022
    Date of Patent: October 1, 2024
    Assignee: Tableau Software, LLC
    Inventors: Harsh Verma, Ramakrishna Casturi, Tyler James-Buker Doyle, Arun Durairaju, Tao Tao
  • Publication number: 20240111791
    Abstract: A method executes at a computing device having one or more processors and memory. The device identifies a set of objects for a data visualization platform, each object in the set of objects representing a database, a data source, a table, a data field, a user, a visualization worksheet, or a calculated field. The device generates a data model from the set of objects. Each object of the set of objects is represented as a node in the data model and each directed edge in the data model identifies a relationship between a pair of objects. The device generates one or more shortcuts in the data model according to object types of the objects in the set of objects. Each shortcut represents a relationship, between a respective pair of objects, not represented by a directed edge. Then the device stores the data model, including the generated shortcuts, in the memory.
    Type: Application
    Filed: December 14, 2023
    Publication date: April 4, 2024
    Inventors: Harsh Verma, Ramakrishna Casturi, Tyler James-Buker Doyle, Arun Durairaju, Tao Tao
  • Publication number: 20230065227
    Abstract: Embodiments are directed to managing data. A data model that includes data type nodes and relationship edges may be provided. Other data types and other data type relationships may be provided and included in the data model. If a portion of the nodes in the data model may be downstream of leaf nodes in the graphlet: the data model may be traversed to visit the downstream nodes; shortcut edges may be generated to each downstream node associated with shortcut nodes. If a second portion of the nodes in the data model may be upstream of the leaf nodes: the data model may be traversed upwards from the leaf nodes; other shortcut edges may be generated to each node visited in the upwards traversal associated with shortcut nodes.
    Type: Application
    Filed: January 31, 2022
    Publication date: March 2, 2023
    Inventors: Harsh Verma, Ramakrishna Casturi, Tyler James-Buker Doyle, Arun Durairaju, Tao Tao
  • Publication number: 20230059083
    Abstract: Embodiments are directed to managing data. A data model that includes data types, data type relationships, shortcuts may be provided. In response to a query for determining a directed path in the data model for a shortcut further actions may be performed including: determining candidate nodes and traversal edges based on the data model, a target data type, and a source data type; generating a tree based on the candidate nodes and the traversal edges; removing leaf nodes of the tree that are not the target data type; removing duplicate branches of the tree that correspond to duplicate traversal edges; determining the directed path in the data model connecting the source data type to the target data type based on the remaining candidate nodes and traversal edges; and generating a response to the query based on the directed path.
    Type: Application
    Filed: August 23, 2021
    Publication date: February 23, 2023
    Inventors: Harsh Verma, Ramakrishna Casturi, Tyler James-Buker Doyle, Arun Durairaju, Tao Tao
  • Patent number: 8639773
    Abstract: Search engines may utilize web crawlers to discover desirable content that may be provided to users as search results. Unfortunately, document providers, such as websites, may return junk web pages and/or maintenance web pages as document results, which may be undesirable for a search engine to provide as search results. Accordingly, document providers may be grouped into provider clusters. Profiles may be assigned to provider clusters, where a profile may comprise parameters representing “expected” parameters historically returned from normal document fetch operations to document providers within the provider cluster. Parameters of a profile for a provider cluster comprising a document provider may be compared with current document fetch parameters of a current document fetch operation. If the parameters of the profile and the current document fetch parameters do not match, then an alert may be generated.
    Type: Grant
    Filed: June 17, 2010
    Date of Patent: January 28, 2014
    Assignee: Microsoft Corporation
    Inventors: Balaji B. Shyamkumar, Puneet Sahni, Harsh Verma
  • Publication number: 20110314122
    Abstract: Search engines may utilize web crawlers to discover desirable content that may be provided to users as search results. Unfortunately, document providers, such as websites, may return junk web pages and/or maintenance web pages as document results, which may be undesirable for a search engine to provide as search results. Accordingly, document providers may be grouped into provider clusters. Profiles may be assigned to provider clusters, where a profile may comprise parameters representing “expected” parameters historically returned from normal document fetch operations to document providers within the provider cluster. Parameters of a profile for a provider cluster comprising a document provider may be compared with current document fetch parameters of a current document fetch operation. If the parameters of the profile and the current document fetch parameters do not match, then an alert may be generated.
    Type: Application
    Filed: June 17, 2010
    Publication date: December 22, 2011
    Applicant: Microsoft Corporation
    Inventors: Balaji B. Shyamkumar, Puneet Sahni, Harsh Verma