Centralized metaobject ingest using a temporally-expanded bloom filter
First Claim
1. A method comprising:
- identifying a first bloom filter using a schedule comprising a rotation of a plurality of bloom filters based on time;
identifying at least a first metaobject to evaluate for ingestion using the first bloom filter;
deriving a first hash value from the first metaobject;
identifying a first subset of the first hash value based on the schedule, wherein the first subset is smaller in size than the first hash value;
determining, by a server computer system, whether to add the first metaobject to a data store using the first bloom filter and the first subset of the first hash value;
identifying a second bloom filter using the rotation in the schedule;
identifying at least a second metaobject to evaluate for ingestion using the second bloom filter;
deriving a second hash value from the second metaobject;
identifying a second subset of the second hash value based on the schedule, wherein the second subset is smaller in size than the second hash value; and
determining, by the server computer system, whether to add the second metaobject to the data store using the second bloom filter and the second subset of the second hash value.
7 Assignments
0 Petitions
Accused Products
Abstract
A server computer system identifies a first bloom filter using a schedule that rotates bloom filters based on time. The system identifies a first set of metaobjects to evaluate for ingestion using the first bloom filter and determines whether to add one or more of the metaobjects to a data store using the first bloom filter. The system identifies a second bloom filter using the rotation in the schedule and identifies a second set of metaobjects to evaluate for ingestion using the second bloom filter. The second set of metaobjects includes one or more metaobjects that are the same as one or more metaobjects in the first set of metaobjects. The system determines whether to add one or more of the second set of metaobjects to the data store using the second bloom filter.
-
Citations
20 Claims
-
1. A method comprising:
-
identifying a first bloom filter using a schedule comprising a rotation of a plurality of bloom filters based on time; identifying at least a first metaobject to evaluate for ingestion using the first bloom filter; deriving a first hash value from the first metaobject; identifying a first subset of the first hash value based on the schedule, wherein the first subset is smaller in size than the first hash value; determining, by a server computer system, whether to add the first metaobject to a data store using the first bloom filter and the first subset of the first hash value; identifying a second bloom filter using the rotation in the schedule; identifying at least a second metaobject to evaluate for ingestion using the second bloom filter; deriving a second hash value from the second metaobject; identifying a second subset of the second hash value based on the schedule, wherein the second subset is smaller in size than the second hash value; and determining, by the server computer system, whether to add the second metaobject to the data store using the second bloom filter and the second subset of the second hash value. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system comprising:
- a memory; and
a processing device, coupled with the memory, to;identify a first bloom filter using a schedule comprising a rotation of a plurality of bloom filters based on time; identify at least a first metaobject to evaluate for ingestion using the first bloom filter; derive a first hash value from the first metaobject; identify a first subset of the first hash value based on the schedule, wherein the first subset is smaller in size than the first hash value; determine whether to add the first metaobject to a data store using the first bloom filter and the first subset of the first hash value; identify a second bloom filter using the rotation in the schedule; identify at least a second metaobject to evaluate for ingestion using the second bloom filter; derive a second hash value from the second metaobject; identify a second subset of the second hash value based on the schedule, wherein the second subset is smaller in size than the second hash value; and determine whether to add the second metaobject to the data store using the second bloom filter and the second subset of the second hash value. - View Dependent Claims (9, 10, 11, 12, 13, 14)
- a memory; and
-
15. A non-transitory computer readable storage medium including instructions that, when executed by a processing device, cause the processing device to perform a set of operations comprising:
-
identifying a first bloom filter using a schedule comprising a rotation of a plurality of bloom filters based on time; identifying at least a first metaobject to evaluate for ingestion using the first bloom filter; deriving a first hash value from the first metaobject; identifying a first subset of the first hash value based on the schedule, wherein the first subset is smaller in size than the first hash value; determining, by the processing device, whether to add the first metaobject to a data store using the first bloom filter and the first subset of the first hash value; identifying a second bloom filter using the rotation in the schedule; identifying at least a second metaobject to evaluate for ingestion using the second bloom filter; deriving a second hash value from the second metaobject; identifying a second subset of the second hash value based on the schedule, wherein the second subset is smaller in size than the second hash value; and determining, by the processing device, whether to add the second metaobject to the data store using the second bloom filter and the second subset of the second hash value. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification