Distributed, Scalable Key-Value Store
    171.
    发明申请
    Distributed, Scalable Key-Value Store 审中-公开
    分布式可扩展键值存储

    公开(公告)号:US20160321294A1

    公开(公告)日:2016-11-03

    申请号:US14700615

    申请日:2015-04-30

    Applicant: VMware, Inc.

    CPC classification number: G06F16/182 H04L67/1097 H04L67/2842

    Abstract: Techniques for implementing a distributed, scalable key-value store (DSKVS) across a plurality of nodes are provided. In one embodiment, each node in the plurality of nodes can store: (1) a hash table in a nonvolatile storage of the node, where the hash table is configured to hold a partition of a total set of key-value data maintained by the DSKVS; (2) a logical log in the nonvolatile storage, where the logical log is configured to hold transaction log records corresponding to key-value update operations performed on the node; and (3) a cache in a volatile memory of the node, where the cache is configured to hold key-value data that has been recently updated on the node via one or more of the key-value update operations.

    Abstract translation: 提供了跨多个节点实现分布式可扩展键值存储(DSKVS)的技术。 在一个实施例中,多个节点中的每个节点可以存储:(1)在节点的非易失性存储器中的散列表,其中散列表被配置为保存由所述节点保持的总组密钥值数据的分区 DSKVS; (2)非易失性存储器中的逻辑日志,其中逻辑日志被配置为保存与在该节点上执行的键值更新操作相对应的事务日志记录; 以及(3)在所述节点的易失性存储器中的高速缓存,其中所述高速缓存被配置为保持经由所述键值更新操作中的一个或多个在所述节点上最近更新的键值数据。

    Reverse deletion of a chain of snapshots

    公开(公告)号:US11748300B2

    公开(公告)日:2023-09-05

    申请号:US17455519

    申请日:2021-11-18

    Applicant: VMware, Inc.

    CPC classification number: G06F16/128 G06F16/125 G06F16/14

    Abstract: A method for the reverse deletion of a plurality of snapshots in a chain of snapshots is provided. The method includes in reverse order, starting from a latest snapshot in time to an earliest snapshot in time of the plurality of snapshots: identifying at least one of a first set of one or more data blocks of a snapshot that are shared with an earlier snapshot in time in the chain of snapshots or a second set of one or more data blocks of the snapshot that are owned by the snapshot and processing the second set of one or more data blocks and skipping processing the first set of one or more data blocks, wherein processing the second set of one or more data blocks comprises performing one or more actions to maintain and/or delete data blocks of the second set of one or more data blocks.

    Enhanced locking mechanism for B+ tree data structures

    公开(公告)号:US11663186B2

    公开(公告)日:2023-05-30

    申请号:US17177686

    申请日:2021-02-17

    Applicant: VMware, Inc.

    CPC classification number: G06F16/2246 G06F16/2343 G06F16/24552 G06F16/288

    Abstract: A method for modifying key-value pairs of a B+ tree is provided. The method receives a request to modify a particular key-value pair. Each node of the tree has a modification number. The method traverses a path on the tree from the root node toward the particular node. The traversing includes upon reaching a parent node of the path, acquiring a shared lock on both the parent node and a child node one level below the parent node. Upon determining that the child node is the particular node, the method stores the modification number of the particular node, releases the shared lock on the particular node, compares a current modification number of the node with its stored number, and acquires an exclusive lock on the node if the numbers are the same. The method increments the current modification number of the node and modifies it while in the exclusive lock.

    Enhanced data encryption in distributed datastores using random tweaks stored in data blocks

    公开(公告)号:US11573711B2

    公开(公告)日:2023-02-07

    申请号:US16827692

    申请日:2020-03-23

    Applicant: VMware, Inc.

    Abstract: A method for encrypting data in one or more data blocks is provided. The method receives a first data block to be written to a physical storage that includes one or more physical disks. The method applies a first random tweak to data indicative of the first data block to generate a first encrypted data block, and writes the first encrypted data block and the first random tweak to a first physical block of the physical storage. The method receives a second data block to be written to the physical storage. The method then applies a second random tweak, different than the first random tweak, to data indicative of the second data block to generate a second encrypted data block, and writes the second encrypted data block and the second random tweak to a second physical block of the physical storage.

    Deleting snapshot pages using sequence numbers and page lookups

    公开(公告)号:US11537297B1

    公开(公告)日:2022-12-27

    申请号:US17479594

    申请日:2021-09-20

    Applicant: VMware, Inc.

    Abstract: The present disclosure is related to methods, systems, and machine-readable media for deleting snapshot pages using sequence numbers and page lookups. A monotonically-increasing sequence number (SN) can be assigned to each created page of a first snapshot of a storage volume. A first snapshot sequence number (snapSN) can be assigned to the first snapshot responsive to a creation of a second snapshot, wherein the first snapSN is equal to a largest SN of the first snapshot. An SN can be assigned to each created page of the second snapshot, wherein a first page of the second snapshot is assigned an SN monotonically increased from the first snapSN. A second snapSN can be assigned to the second snapshot responsive to a creation of a third snapshot, wherein the second snapSN is equal to a largest SN of the second snapshot. An SN can be assigned to each created page of the third snapshot, wherein a first page of the third snapshot is assigned an SN monotonically increased from the second snapSN. A deletion process can be performed in response to receiving a request to delete the second snapshot that includes deleting a particular page of the second snapshot responsive to determining that the particular page is not shared between the second snapshot and the first snapshot or between the second snapshot and the third snapshot.

    AGGREGATING BLOCK MAPPING METADATA TO IMPROVE LINKED CLONE READ PERFORMANCE

    公开(公告)号:US20220398115A1

    公开(公告)日:2022-12-15

    申请号:US17346607

    申请日:2021-06-14

    Applicant: VMware, Inc.

    Abstract: Linked clone read performance when retrieving data from a clone is improved at least by aggregating block mapping metadata efficiently. Primary metadata for a child clone maps a logical block address (LBA) for data in a data region of the child clone to a physical sector address (PSA) for data in the data region of the child clone. At least a portion of primary metadata for a parent clone of the child clone is copied into archival metadata for the child clone. In response to a read request, data is returned from the child clone, parent clone, or another ancestor of the child clone based on whether or not a read request LBA is within the primary metadata for the child clone, or within the archival metadata.

Patent Agency Ranking