公开(公告)号：US20180137014A1

公开(公告)日：2018-05-17

申请号：US15354984

申请日：2016-11-17

Applicant: VMware, Inc.

Inventor： Cheng Li ,  Li Ding ,  Bret Needle ,  Mayank Rawat

IPC: G06F11/14 ,  G06F17/30

CPC classification number: G06F11/1458 ,  G06F16/128 ,  G06F2201/815

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.

公开(公告)号：US10067966B2

公开(公告)日：2018-09-04

申请号：US14869024

申请日：2015-09-29

Applicant: VMware, Inc.

Inventor： Serge Pashenkov ,  Ritesh Shukla ,  Li Ding ,  Bret Needle ,  Mayank Rawat

IPC: G06F17/30

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.

公开(公告)号：US20170091242A1

公开(公告)日：2017-03-30

申请号：US14869099

申请日：2015-09-29

Applicant: VMware, Inc.

Inventor： Ritesh Shukla ,  Serge Pashenkov ,  Li Ding ,  Bret Needle ,  Mayank Rawat

IPC: G06F17/30

CPC classification number: G06F17/30327

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.

公开(公告)号：US10802927B2

公开(公告)日：2020-10-13

申请号：US15354984

申请日：2016-11-17

Applicant: VMware, Inc.

Inventor： Cheng Li ,  Li Ding ,  Bret Needle ,  Mayank Rawat

IPC: G06F16/00 ,  G06F11/14 ,  G06F16/11

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.

公开(公告)号：US10262016B2

公开(公告)日：2019-04-16

申请号：US14869099

申请日：2015-09-29

Applicant: VMware, Inc.

Inventor： Ritesh Shukla ,  Serge Pashenkov ,  Li Ding ,  Bret Needle ,  Mayank Rawat

IPC: G06F17/30

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.

公开(公告)号：US20170091241A1

公开(公告)日：2017-03-30

申请号：US14869024

申请日：2015-09-29

Applicant: VMware, Inc.

Inventor： Serge Pashenkov ,  Ritesh Shukla ,  Li Ding ,  Bret Needle ,  Mayank Rawat

IPC: G06F17/30

CPC classification number: G06F17/30327 ,  G06F17/30958 ,  G06F17/30961

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.