University of Cambridge > > Computer Laboratory Opera Group Seminars > Reading Group - Network Applications of Bloom Filters: A Survey

Reading Group - Network Applications of Bloom Filters: A Survey

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Pedro Brandao.

Note the unusual room

Slides available .

From the reading group list I’ll be ”reading” Network Applications of Bloom Filters: A Survey

Andrei Broder and Michael Mitzenmacher,Internet Math. Volume 1, Number 4 (2003), 485-509.


A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Bloom filters allow false positives but the space savings often outweigh this drawback when the probability of an error is controlled. Bloom filters have been used in database applications since the 1970s, but only in recent years have they become popular in the networking literature. The aim of this paper is to survey the ways in which Bloom filters have been used and modified in a variety of network problems, with the aim of providing a unified mathematical and practical framework for understanding them and stimulating their use in future applications.

This talk is part of the Computer Laboratory Opera Group Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity