公开(公告)号：US20210026825A1

公开(公告)日：2021-01-28

申请号：US16931219

申请日：2020-07-16

Applicant: VMware, Inc.

Inventor： Abhishek GUPTA ,  Richard P. SPILLANE ,  Robert T. JOHNSON ,  Srinath PREMACHANDRAN ,  Jorge GUERRA DELGADO ,  Kapil CHOWKSEY ,  Sandeep RANGASWAMY

IPC: G06F16/22 ,  G06F16/23 ,  G06F9/50 ,  G06F9/54

Abstract: Embodiments described herein are related to a method of scanning a B-tree. For example, a method comprises receiving a scan request to scan a B-tree having a plurality of levels, each level comprising one or more nodes, wherein for each of one or more levels of the plurality of levels, nodes are grouped into groups, where nodes of any given group are stored across sequential disk blocks. The method further comprises generating a queue for each level of the B-tree. For each queue, the method further comprises loading into memory a next group of nodes based upon determining a storage location of a node of the next group of nodes.

公开(公告)号：US20190294716A1

公开(公告)日：2019-09-26

申请号：US15927016

申请日：2018-03-20

Applicant: VMware, Inc.

Inventor： Abhishek GUPTA ,  Rob T. JOHNSON ,  Srinath PREMACHANDRAN ,  Richard P. SPILLANE ,  Sandeep RANGASWAMY ,  Jorge GUERRA DELGADO ,  Kapil CHOWKSEY ,  Wenguang WANG

IPC: G06F17/30

Abstract: Exemplary methods, apparatuses, and systems include a file system process reading a first node in a tree data structure from a first memory. The first node includes a first approximate membership query data structure (“AMQ”), a first plurality of child pointers, a first plurality of pivot values, and a first buffer. The file system process determines that the first plurality of child pointers exceeds a maximum size. Using a pivot value in the first plurality of pivot values, the file system process splits the first node into a second node and a third node. The file system process uses the pivot value to split the first buffer into a second buffer and a third buffer. Using the pivot value and the first AMQ, the file system process generates a second AMQ and a third AMQ.

公开(公告)号：US20180329645A1

公开(公告)日：2018-11-15

申请号：US15592834

申请日：2017-05-11

Applicant: VMware, Inc.

Inventor： Jorge GUERRA DELGADO ,  Jin ZHANG ,  Radhika VULLIKANTI ,  Abhishek GUPTA

IPC: G06F3/06 ,  G06F17/30 ,  H04L29/08 ,  G06F9/455

CPC classification number: G06F3/0647 ,  G06F3/0617 ,  G06F3/0641 ,  G06F3/0646 ,  G06F3/067 ,  G06F9/45558 ,  G06F16/174 ,  G06F16/1744 ,  G06F16/1748 ,  G06F16/2365 ,  G06F16/25 ,  G06F2009/45579 ,  H04L67/1097 ,  H04L67/38

Abstract: A logical group of data blocks stored in a first node is migrated to a second node according to a method that includes determining a first metric for each logical group of data blocks stored in the first node, the first metric representing a total size of the data blocks in the logical group, determining a second metric for each logical group of data blocks stored in the first node, the second metric representing a total size of the data blocks in the logical group that are uniquely stored in the first node, and selecting a logical group of data blocks for migration from the first node to the second node based on the first metric and the second metric.

公开(公告)号：US20230409545A1

公开(公告)日：2023-12-21

申请号：US17845683

申请日：2022-06-21

Applicant: VMware, Inc.

Inventor： Abhishek GUPTA ,  Christos KARAMANOLIS ,  Richard P. SPILLANE ,  Marin NOZHCHEV

IPC: G06F16/21 ,  G06F16/22

CPC classification number: G06F16/219 ,  G06F16/2219

Abstract: A version control interface provides for time travel with metadata management under a common transaction domain as the data. Examples generate a time-series of master branch snapshots for data objects stored in a data lake, with the snapshot comprising a tree data structure such as a hash tree and associated with a time indication. Readers select a master branch snapshot from the time-series, based on selection criteria (e.g., time) and use references in the selected master branch snapshot to read data objects from the data lake. This provides readers with a view of the data as of a specified time.

公开(公告)号：US20200293506A1

公开(公告)日：2020-09-17

申请号：US16353535

申请日：2019-03-14

Applicant: VMware, Inc.

Inventor： Abhishek GUPTA ,  Robert T. JOHNSON ,  Richard P. SPILLANE ,  Sandeep RANGASWAMY ,  Jorge GUERRA DELGADO ,  Srinath PREMACHANDRAN ,  Kapil CHOWKSEY

IPC: G06F16/22 ,  G06F16/2455 ,  G06F7/08

Abstract: Embodiments described herein are related to bulk loading data into a B-tree. Embodiments include generating a first leaf node of a B-tree by allocating a first page for the first leaf node from a leaf page queue comprising a first plurality of sequential pages; and writing one or more tuples to the first page allocated for the first leaf node. Embodiments further include generating an parent node for the first leaf node and a second leaf node of the B-tree by allocating a third page for the parent node from an parent page queue comprising a second plurality of sequential pages, the parent node comprising a first indication of the first leaf node and a second indication of the second leaf node, the first indication and the second indication stored in the third page allocated for the parent.

公开(公告)号：US20190311047A1

公开(公告)日：2019-10-10

申请号：US15947072

申请日：2018-04-06

Applicant: VMware, Inc.

Inventor： Jorge GUERRA DELGADO ,  Richard P. SPILLANE ,  Kapil CHOWKSEY ,  Sandeep RANGASWAMY ,  Abhishek GUPTA ,  Srinath PREMACHANDRAN

IPC: G06F17/30 ,  G06F9/455

Abstract: Embodiments described herein involve improved management of snapshots of a file system. Embodiments include copying a first root node of a first snapshot to a second snapshot, the second snapshot referencing other nodes of the first snapshot. Embodiments further include incrementing reference counts of the other nodes of the first snapshot. Embodiments further include adding a storage address of the first root node to a list. Embodiments further include, each time that a copy on write operation is performed for a node of the other nodes, adding a storage address of the node to the list and decrementing the reference count of the node. Embodiments further include iterating through the list and, for each storage address in the list, decrementing the reference count of the node corresponding to the storage address and, if the reference count of the node reaches zero, freeing storage space at the storage address.

公开(公告)号：US20190294710A1

公开(公告)日：2019-09-26

申请号：US15927025

申请日：2018-03-20

Applicant: VMware, Inc.

Inventor： Abhishek GUPTA ,  Rob T. JOHNSON ,  Srinath PREMACHANDRAN ,  Richard P. SPILLANE ,  Sandeep RANGASWAMY ,  Jorge GUERRA DELGADO ,  Kapil CHOWKSEY ,  Wenguang WANG

IPC: G06F17/30 ,  G06F3/06

Abstract: Exemplary methods, apparatuses, and systems include a file system process determining to a flush a node in a first tree. The first node includes a buffer structured as a second tree. The file system process generates an input/output instruction to load the buffer from a first memory to a second memory. The second tree is stored in two more non-contiguous locations in the first memory and the input/output operation includes a read operation corresponding to each of the two or more non-contiguous locations. The file system process causes the input/output instruction to be executed concurrently on the first memory.