Download now Free registration required
Bloom filters are widely used with many applications in the domain of networks. One application of interest is representing large file lists; for example lists of shared files in servers or caches to enable determination if a given file name is in a list of shared files. The key performance measures for a Bloom filter are membership testing time (also called computation time), memory requirements, and probability of false positive. Membership testing time is the time to determine if an element belongs to the set represented by the Bloom filter.
- Format: PDF
- Size: 144.6 KB