Patents by Inventor Bret Needle

Bret Needle 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).

  • System and method for checking and characterizing snapshot metadata using snapshot metadata database
    Patent number: 10802927
    Abstract: System and method for checking and characterizing metadata of snapshots utilize a snapshot metadata database to execute at least one of checking and characterizing operations on the metadata of snapshots. The snapshot metadata database includes information extracted from backing storage elements containing the metadata of snapshots.
    Type: Grant
    Filed: November 17, 2016
    Date of Patent: October 13, 2020
    Assignee: VMware, Inc.
    Inventors: Cheng Li, Li Ding, Bret Needle, Mayank Rawat
  • Tuning key space at the time of instantiation of a tree data structure
    Patent number: 10262016
    Abstract: Techniques for tuning the key space of an instance of a tree data structure are provided. In one embodiment, a computer system can receive a request to create the instance, where the request includes an expected key space value indicating an expected range of key values to be addressed by the instance. The computer system can further calculate a number of bits to allocate to each key of each node of the instance based on the expected key space value. The computer system can then, at a time of instantiating each node of the instance, allocate the keys for the node in accordance with the calculated number of bits.
    Type: Grant
    Filed: September 29, 2015
    Date of Patent: April 16, 2019
    Assignee: VMWARE, INC.
    Inventors: Ritesh Shukla, Serge Pashenkov, Li Ding, Bret Needle, Mayank Rawat
  • Leveraging hierarchy in a tree data structure to dynamically allocate keys
    Patent number: 10067966
    Abstract: Techniques for dynamically allocating keys in an instance of a tree data structure are provided. In one embodiment, a computer system can, at a time of instantiating each non-root node in the instance, determine a key space to be addressed by the non-root node, where the key space is based on a key subinterval in a parent node of the non-root node that is associated with a pointer to the non-root node. The computer system can further calculate a number of bits to allocate to each key of the non-root node in view of the determined key space. The computer system can then allocate the keys of the non-root node in accordance with the calculated number of bits.
    Type: Grant
    Filed: September 29, 2015
    Date of Patent: September 4, 2018
    Assignee: VMWARE, INC.
    Inventors: Serge Pashenkov, Ritesh Shukla, Li Ding, Bret Needle, Mayank Rawat
  • SYSTEM AND METHOD FOR CHECKING AND CHARACTERIZING SNAPSHOT METADATA USING SNAPSHOT METADATA DATABASE
    Publication number: 20180137014
    Abstract: System and method for checking and characterizing metadata of snapshots utilize a snapshot metadata database to execute at least one of checking and characterizing operations on the metadata of snapshots. The snapshot metadata database includes information extracted from backing storage elements containing the metadata of snapshots.
    Type: Application
    Filed: November 17, 2016
    Publication date: May 17, 2018
    Applicant: VMware, Inc.
    Inventors: Cheng Li, Li Ding, Bret Needle, Mayank Rawat
  • Tuning Key Space at the Time of Instantiation of a Tree Data Structure
    Publication number: 20170091242
    Abstract: Techniques for tuning the key space of an instance of a tree data structure are provided. In one embodiment, a computer system can receive a request to create the instance, where the request includes an expected key space value indicating an expected range of key values to be addressed by the instance. The computer system can further calculate a number of bits to allocate to each key of each node of the instance based on the expected key space value. The computer system can then, at a time of instantiating each node of the instance, allocate the keys for the node in accordance with the calculated number of bits.
    Type: Application
    Filed: September 29, 2015
    Publication date: March 30, 2017
    Inventors: Ritesh Shukla, Serge Pashenkov, Li Ding, Bret Needle, Mayank Rawat
  • LEVERAGING HIERARCHY IN A TREE DATA STRUCTURE TO DYNAMICALLY ALLOCATE KEYS
    Publication number: 20170091241
    Abstract: Techniques for dynamically allocating keys in an instance of a tree data structure are provided. In one embodiment, a computer system can, at a time of instantiating each non-root node in the instance, determine a key space to be addressed by the non-root node, where the key space is based on a key subinterval in a parent node of the non-root node that is associated with a pointer to the non-root node. The computer system can further calculate a number of bits to allocate to each key of the non-root node in view of the determined key space. The computer system can then allocate the keys of the non-root node in accordance with the calculated number of bits.
    Type: Application
    Filed: September 29, 2015
    Publication date: March 30, 2017
    Inventors: Serge Pashenkov, Ritesh Shukla, Li Ding, Bret Needle, Mayank Rawat