-
公开(公告)号:US11436353B2
公开(公告)日:2022-09-06
申请号:US15703706
申请日:2017-09-13
Applicant: VMware, Inc.
Inventor: Abhishek Gupta , Richard P. Spillane , Kapil Chowksey , Rob Johnson , Wenguang Wang
Abstract: Embodiments of the present disclosure relate to techniques for performing a merge update for a database. In particular, certain embodiments of a method include generating a message comprising a first key and a first transaction associated with the first key, the first transaction indicating a transaction to perform other than for key-value pairs comprising the first key. The method further includes storing the message in a database. The method further includes merging the message with a first key-value pair stored in the database, the first-key value pair comprising the first key. The method further includes performing the first transaction based on merging the message with the first key-value pair.
-
公开(公告)号:US11354288B2
公开(公告)日:2022-06-07
申请号: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: G06F16/22 , G06F3/06 , G06F16/17 , G06F16/2453
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.
-
公开(公告)号:US11048678B2
公开(公告)日:2021-06-29
申请号: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 , G06F7/08 , G06F16/2455
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.
-
公开(公告)号:US11003555B2
公开(公告)日:2021-05-11
申请号:US15844539
申请日:2017-12-16
Applicant: VMware, Inc.
Inventor: Abhishek Gupta , Jorge Guerra Delgado , Kapil Chowksey , Sandeep Rangaswamy , Srinath Premachandran
Abstract: The subject matter described herein is generally directed towards tracking and recovering a disk allocation state. An on-disk log of operations is maintained to describe operations performed to an in-memory partial reference count map. Upon a crash of a host computing device during a checkpoint operation to an on-disk complete reference count map, the on-disk log of operations is used to undo and then redo the operations, or just redo the operations. In this manner, a disk allocation state prior to the crash is recreated in the on-disk complete reference count map with atomicity and crash consistency.
-
公开(公告)号:US10997144B2
公开(公告)日:2021-05-04
申请号:US16029463
申请日:2018-07-06
Applicant: VMware, Inc.
Inventor: Robert T Johnson , Ittai Abraham , Abhishek Gupta , Richard P Spillane , Sandeep Rangaswamy , Jorge Guerra Delgado , Srinath Premachandran , Kapil Chowksey
Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. After a time, packets in the uncompacted portion of a buffer are combined into compacted packets in the compacted portion of the buffer. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
-
公开(公告)号:US20200012735A1
公开(公告)日:2020-01-09
申请号:US16029463
申请日:2018-07-06
Applicant: VMware, Inc.
Inventor: Robert T Johnson , Ittai Abraham , Abhishek Gupta , Richard P Spillane , Sandeep Rangaswamy , Jorge Guerra Delgado , Srinath Premachandran , Kapil Chowksey
IPC: G06F17/30
Abstract: A buffer tree structure includes, at each internal node, a buffer having a compacted portion and an uncompacted portion. Insertion of data elements to the buffer tree can occur units called packets. A packet is initially stored in the uncompacted portion of a receiving node's buffer. After a time, packets in the uncompacted portion of a buffer are combined into compacted packets in the compacted portion of the buffer. A buffer-emptying (flush) operation pushes the compacted packets to children nodes.
-
公开(公告)号:US20190188097A1
公开(公告)日:2019-06-20
申请号:US15844412
申请日:2017-12-15
Applicant: VMware, Inc.
Inventor: Abhishek Gupta , Richard P. Spillane , Kapil Chowksey , Rob Johnson , Wenguang Wang
CPC classification number: G06F11/2056 , G06F3/0653 , G06F11/3034 , G06F11/3476
Abstract: Data storage system and method for managing transaction requests to the data storage system utilizes an active write ahead log and a standby write ahead log to apply the transaction requests to a storage data structure stored in a storage system of the data storage system.
-
公开(公告)号:US20190095460A1
公开(公告)日:2019-03-28
申请号:US15717704
申请日:2017-09-27
Applicant: VMware, Inc.
Inventor: Wenguang Wang , Abhishek Gupta , Richard P Spillane , Kapil Chowksey , Robert T Johnson
Abstract: A Bε-tree associated with a file system on a storage volume includes a hierarchy of nodes. Each node includes a buffer portion to store key-value pairs as messages in the buffer. Each node can be characterized by having a maximum allowable size that is periodically updated at run time. The buffers in the nodes of the Bε-tree are therefore characterized by having a maximum allowed size that can vary over time.
-
-
-
-
-
-
-