. Assume we want to use bloom filtering to filter product numbers. Assume we are only interested in keeping product numbers 4 and 7. We want to ignore all other product numbers. Assume we use two hash functions to build the Bloom filter bit array. The two hash functions that each receive a product number as input are given below (x is the product number): o h1(x) = (x mod 10) + 1 o h2(x) = ((2x + 2) mod 10) + 1 Assume the size of the bit array is ten and its first index is 1, and its last index is 10.
[Mining Data Streams]
14. Assume we want to use bloom filtering to filter product numbers. Assume we are
only interested in keeping product numbers 4 and 7. We want to ignore all other product
numbers.
Assume we use two hash functions to build the Bloom filter bit array. The two hash functions
that each receive a product number as input are given below (x is the product number):
o h1(x) = (x mod 10) + 1
o h2(x) = ((2x + 2) mod 10) + 1
Assume the size of the bit array is ten and its first index is 1, and its last index is 10.
First, build the Bloom filter bit array (a single bit array).
Second, determine if the following product numbers will pass this Bloom filter or not.
Justify your answer.
a) The product number is 6
b) The product number is 9
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
