System and method for clustering distributed hash table entries

    公开(公告)号:US11947510B2

    公开(公告)日:2024-04-02

    申请号:US18182294

    申请日:2023-03-10

    CPC classification number: G06F16/2255 G06F16/1873

    Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.

    SYSTEM AND METHOD FOR CLUSTERING DISTRIBUTED HASH TABLE ENTRIES

    公开(公告)号:US20230281181A1

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

    申请号:US18182294

    申请日:2023-03-10

    CPC classification number: G06F16/2255 G06F16/1873

    Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.

    SYSTEM AND METHOD FOR CLUSTERING DISTRIBUTED HASH TABLE ENTRIES

    公开(公告)号:US20220075767A1

    公开(公告)日:2022-03-10

    申请号:US17478671

    申请日:2021-09-17

    Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.

    System and method for clustering distributed hash table entries

    公开(公告)号:US11126605B2

    公开(公告)日:2021-09-21

    申请号:US16355557

    申请日:2019-03-15

    Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.

    System and method for fetching the latest versions of stored data objects

    公开(公告)号:US10528537B2

    公开(公告)日:2020-01-07

    申请号:US15877126

    申请日:2018-01-22

    Abstract: A distributed storage system may store data object instances in persistent storage and may cache keymap information for those data object instances. The system may cache a latest symbolic key entry for some user keys of the data object instances. When a request is made for the latest version of stored data object instances having a specified user key, the latest version may be determined dependent on whether a latest symbolic key entry exists for the specified user key, and keymap information for the latest version may be returned. When storing keymap information, a flag may be set to indicate that a corresponding latest symbolic key entry should be updated. The system may delete a latest symbolic key entry for a particular user key from the cache in response to determining that no other requests involving the keymap information for data object instances having the particular user key are pending.

    System and method for logical deletion of stored data objects
    6.
    发明授权
    System and method for logical deletion of stored data objects 有权
    用于存储数据对象的逻辑删除的系统和方法

    公开(公告)号:US09563578B2

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

    申请号:US14992915

    申请日:2016-01-11

    Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

    Abstract translation: 用于在存储系统中提供对象版本控制的系统和方法可以支持存储对象的逻辑删除。 响应于指定用户密钥和版本标识符的删除操作,存储系统可以永久删除具有指定密钥的对象的指定版本。 响应于指定用户密钥但不是版本标识符的删除操作,存储系统可以创建不包含对象数据的删除标记对象,并且可以为删除标记生成新的版本标识符。 删除标记可以存储为用户密钥的最新对象版本,并且可以使用包括用户密钥和新版本标识符的复合密钥在存储系统中可寻址。 在不指定版本标识符的情况下,随后尝试检索用户密钥可能会返回错误,尽管对象未被实际删除。

    SYSTEM AND METHOD FOR LOGICAL DELETION OF STORED DATA OBJECTS

    公开(公告)号:US20230092106A1

    公开(公告)日:2023-03-23

    申请号:US17929650

    申请日:2022-09-02

    Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

    System and method for fetching the latest versions of stored data objects
    10.
    发明授权
    System and method for fetching the latest versions of stored data objects 有权
    用于获取最新版本的存储数据对象的系统和方法

    公开(公告)号:US09053054B1

    公开(公告)日:2015-06-09

    申请号:US14177110

    申请日:2014-02-10

    Abstract: A distributed storage system may store data object instances in persistent storage and may cache keymap information for those data object instances. The system may cache a latest symbolic key entry for some user keys of the data object instances. When a request is made for the latest version of stored data object instances having a specified user key, the latest version may be determined dependent on whether a latest symbolic key entry exists for the specified user key, and keymap information for the latest version may be returned. When storing keymap information, a flag may be set to indicate that a corresponding latest symbolic key entry should be updated. The system may delete a latest symbolic key entry for a particular user key from the cache in response to determining that no other requests involving the keymap information for data object instances having the particular user key are pending.

    Abstract translation: 分布式存储系统可以将数据对象实例存储在持久存储器中,并且可以缓存那些数据对象实例的键盘映射信息。 系统可以缓存数据对象实例的一些用户密钥的最新符号密钥条目。 当对具有指定用户密钥的最新版本的存储数据对象实例进行请求时,可以根据对于指定的用户密钥是否存在最新的符号密钥条目来确定最新版本,并且最新版本的密钥映射信息可以是 回。 当存储键盘映射信息时,可以设置标志以指示相应的最新符号密钥条目应被更新。 响应于确定涉及具有特定用户密钥的数据对象实例的键盘映射信息的其他请求未被挂起,系统可以从缓存中删除特定用户密钥的最新符号密钥条目。

Patent Agency Ranking