Method and apparatus for eventually consistent delete in a distributed data store

摘要

Techniques for effective delete operations in a distributed data store with eventually consistent replicated entries include determining to delete a particular entry from the distributed data store. Each entry includes a first field that holds data that indicates a key and a second field that holds data that indicates content associated with the key and a third field that holds data that indicates a version for the content. The method also comprises causing, at least in part, actions that result in marking the particular entry as deleted without removing the particular entry, and updating a version in the third field for the particular entry.

主权项

1. A method comprising:
receiving a request from at least one user to delete at least one entry from a distributed data store, wherein the distribute data store includes one or more replicates for the at least one entry; causing, at least in part, a marking of the at least one entry as deleted without removing the at least one entry, the one or more replicates, or a combination thereof from the distributed data store in response to the request; causing, at least in part, an initiation of at least one get command for the at least one entry; determining that there is at least one exception if one or more returned replicates of the at least one entry do not include an identical content value; and causing, at least in part, a presentation of at least one notification in at least one user interface based, at least in part, on the at least one exception, wherein the at least one entry includes, at least in part, a first field that holds a key, a second field that holds content associated with the key, and a third field that holds version information, and the marking of the at least one entry includes updating the version information held in the third field.