Bloom Filters, Related Data Structures, and their Applications
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Helen Innes.
Many network monitoring and measuring tasks are now making use of hash-based data structures, including Bloom filters and their many variations. In this talk, we review the basics and history of these data structures, explaining why they have become a key building block in a variety of networking algorithms. We cover both the mathematics underlying their performance, and some recent real-world applications. No previous background is required.
This talk is part of the Kuwait Foundation Lectures series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|