A method for generating a randomized data structure for representing sets, based on bloom filters

摘要

A method for representing sets of elements in a randomized data structure, adapted to reduce the false-positive probability in a time-constraint system, according to which a memory space is partitioned to two layers. A first layer functions as a regular Bloom filter bits, representing buckets and a second layer that comprises digest symbols. The first layer of buckets and the second layer of digest symbols are partitioned into sets, where sets of symbols are assigned to sets of buckets. The properties of elements that belong to the buckets sets are represented as values in their corresponding symbols.