Patent ID: 8024377

Claim:
A method for excluding a first tuple from subsequent data retrieval operations operating on a distributed datastore comprising a plurality of storage locations, comprising the steps of: propagating said first tuple from a client to at least one destination among said plurality of storage locations using an insertion procedure; and propagating a second tuple from the client, distinct from said first tuple, to each of said at least one destination using said insertion procedure; excluding said first tuple from subsequent data retrieval operations upon arrival of said second tuple at said at least one destination, wherein each of said first tuple and said second tuple comprise a plurality of key values, one key value for each of a plurality of keys, wherein said insertion procedure operates based on a subset of said keys, wherein said first tuple and said second tuple have equal key values for each key within said subset of keys; whereby said insertion procedure ensures that said second tuple arrives at each of said at least one destination, wherein said first tuple and said second tuple comprise a binary indicator in the form of a deletion key, wherein a key value of said deletion key distinguishes said first tuple and said second tuple from one another, and wherein said deletion key is not within said subset of keys.