Reducing requests using probabilistic data structures
Assigneesalesforce.com, inc.
InventorsAtish Agrawal, Jameison Bear Martin
Life of this patent
Estimating the term…
Loading patent…
Assigneesalesforce.com, inc.
InventorsAtish Agrawal, Jameison Bear Martin
Estimating the term…
Techniques are disclosed relating to providing and using probabilistic data structures to at least reduce requests between database nodes. In various embodiments, a first database node processes a database transaction that involves writing a set of database records to an in-memory cache of the first database node. As part of processing the database transaction, the first database node may insert, in a set of probabilistic data structures, a set of database keys that correspond to the set of database records. The first database node may send, to a second database node, the set of probabilistic data structures to enable the second database node to determine whether to request, from the first database node, a database record associated with a database key.
A method, comprising:
A non-transitory computer-readable medium having program instructions stored thereon that are capable of causing a computer system to perform operations comprising:
A method, comprising:
Dependencies are inferred from the claim text.