X hits on this document

110 views

0 shares

0 downloads

0 comments

23 / 38

23

juliandyke.com

© 2007 Julian Dyke

Result Cache Bloom Filter

Use a contiguous array of bits in memory

Initially all bits set to zero

Hash function applied to incoming keys determines location of bit in array

If bit is already set then bloom filter returns true

If bit is not set then bloom filter sets bit and returns false

0

0

0

0

1

0

0

0

0

0

1

0

0

0

0

0

0

0

0

1

0

gkeo4j3k

1

Document info
Document views110
Page views110
Page last viewedSat Dec 10 11:19:03 UTC 2016
Pages38
Paragraphs703
Words2667

Comments