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

    公开(公告)号:US08996831B1

    公开(公告)日:2015-03-31

    申请号:US13953447

    申请日:2013-07-29

    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 toggling a storage system versioning feature
    12.
    发明授权
    System and method for toggling a storage system versioning feature 有权
    用于切换存储系统版本控制功能的系统和方法

    公开(公告)号:US08943279B1

    公开(公告)日:2015-01-27

    申请号:US14212145

    申请日:2014-03-14

    CPC classification number: G06F11/1435 G06F21/6209 G06F21/64

    Abstract: Systems and methods providing a versioning feature in a storage system may allow the versioning feature to be toggled on and/or off during operation. Access operations targeting data objects stored in the system (e.g., delete and store type operations) may behave differently depending on whether versioning is (or has ever been) enabled for the storage system or a storage bucket thereof, or is not (or has never been) enabled for the storage system or storage bucket. For example, if versioning is off or suspended, a store operation may overwrite existing data. However, if versioning is enabled, a store type operation may create and store a new, unique object. If versioning has never been enabled, a delete operation may delete a stored object. However, if versioning has ever been enabled, a delete operation may create a new, unique delete marker object and may or may not delete any objects or data.

    Abstract translation: 在存储系统中提供版本特征的系统和方法可以允许版本特征在操作期间被切换和/或关闭。 针对存储在系统中的数据对象的访问操作(例如,删除和存储类型操作)可能会有所不同,具体取决于对存储系统或其存储桶是否启用了版本控制(或已经被启用),或者不是(或从未) 已启用)存储系统或存储桶。 例如,如果版本控制关闭或暂停,则存储操作可能会覆盖现有数据。 但是,如果启用版本控制,则存储类型操作可能会创建并存储新的唯一对象。 如果版本控制从未启用,则删除操作可能会删除存储的对象。 但是,如果版本控制已被启用,删除操作可能会创建一个新的唯一的删除标记对象,并且可能删除或不删除任何对象或数据。

    System and method for clustering distributed hash table entries

    公开(公告)号:US11604781B2

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

    申请号: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 logical deletion of stored data objects

    公开(公告)号:US10534726B2

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

    申请号:US15979327

    申请日:2018-05-14

    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 CLUSTERING DISTRIBUTED HASH TABLE ENTRIES

    公开(公告)号:US20190213179A1

    公开(公告)日:2019-07-11

    申请号:US16355557

    申请日:2019-03-15

    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 logical deletion of stored data objects

    公开(公告)号:US11436163B2

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

    申请号:US16739763

    申请日:2020-01-10

    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 LOGICAL DELETION OF STORED DATA OBJECTS

    公开(公告)号:US20200151114A1

    公开(公告)日:2020-05-14

    申请号:US16739763

    申请日:2020-01-10

    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.

Patent Agency Ranking