Quote: Bloom filter (failure hash) by hashing to multiple bits; need at least half 0's and constant time processing

Quotation Skeleton

The hash area is considered as N individual … each message in the set to be stored … [p. 425] [Failure hash coding via multiple bits is better than hash coding to a n-bit secondary hash. This assumes constant time of addressing, accessing, and testing bits in the hash area.] … [p. 426] this means that the smallest hash area … [ multiple bit hashes] can be used occurs when half the bits are 1 …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hash filter (18 items)