Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

c programming Problem 1 : Hashing (3%) Bloom filter consists of m bit of memory and h uniform and independent hash functions f1,,fh. Each fi

c programming

image text in transcribed

Problem 1 : Hashing (3\%) Bloom filter consists of m bit of memory and h uniform and independent hash functions f1,,fh. Each fi hashes a key k to an integer in the range [1,m]. Initially all m filter bits are zero, and the differential index and file are empty. When key k is added to the differential index, bits f1(k),,fh(k) of the filter are set to 1 . When a query of the type "Is key k in the differential index?" is made, bits f1(k),,fh(k) are examined. Assume that there are u records stored in the bloom filter. The probability of a false positive is P(h)=(1(11/m)uh)h Problem By differentiating P(h) with respect to h, show that P(h) is minimized when h=(loge2)m/u. ( Write a program to validate the result shown in the problem by investigating P(u) with various h's. )

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Concepts of Database Management

Authors: Philip J. Pratt, Joseph J. Adamski

7th edition

978-1111825911, 1111825912, 978-1133684374, 1133684378, 978-111182591

More Books

Students also viewed these Databases questions

Question

2. Identify issues/causes for the apparent conflict.

Answered: 1 week ago