Anti-item for deletion of content in a distributed datastore
First Claim
Patent Images
1. A method of excluding a first item from a retrieval operation operating on a distributed datastore data-store, said method comprising:
- inserting a second item into said distributed datastore using an insertion procedure, wherein said first item was previously inserted into said distributed datastore with said insertion procedure, wherein said distributed datastore comprises a plurality of storage locations, and wherein said insertion procedure propagates said first item and said second item to a common set of one or more destinations among said plurality of storage locations;
wherein said first item and said second item each comprise a plurality of key values, one key value for each of a plurality of keys, wherein said retrieval operation is specified using a set of keys from said plurality of keys, wherein said insertion procedure operates based only on said set of keys;
wherein said first item and said second item have equal key values for each key within said set of keys; and
wherein arrival of said second item within said distributed data-store excludes said first item from said retrieval operation.
3 Assignments
0 Petitions
Accused Products
Abstract
The invention provides an efficient apparatus and method for deleting items within a distributed datastore. Deletion of items is accomplished using anti-items having the same structure as a conventional data item, but for a single tag, flag, or bit which indicates that it is an anti-item, wherein the single tag, flag, or bit but does not affect the location at which a data item or anti-item is ultimately stored within the datastore, thereby ensuring that, upon insertion, the anti-item reaches the same location or locations within the datastore as the original data item.
-
Citations
6 Claims
-
1. A method of excluding a first item from a retrieval operation operating on a distributed datastore data-store, said method comprising:
-
inserting a second item into said distributed datastore using an insertion procedure, wherein said first item was previously inserted into said distributed datastore with said insertion procedure, wherein said distributed datastore comprises a plurality of storage locations, and wherein said insertion procedure propagates said first item and said second item to a common set of one or more destinations among said plurality of storage locations; wherein said first item and said second item each comprise a plurality of key values, one key value for each of a plurality of keys, wherein said retrieval operation is specified using a set of keys from said plurality of keys, wherein said insertion procedure operates based only on said set of keys; wherein said first item and said second item have equal key values for each key within said set of keys; and wherein arrival of said second item within said distributed data-store excludes said first item from said retrieval operation. - View Dependent Claims (2, 3, 4, 5, 6)
-
Specification