What is a bloom filter?

A bloom filter is an algorithm that lets web developers build caching mechanisms to improve the performance of dynamically generated web pages. It uses less memory and is faster than traditional hashed mapped functions. It also possess useful properties for easily sharing data between different web applications.

Why haven't I heard of Bloom Filters before?

The Bloom Filter algorithm was originally documented in the Communications of the ACM in 1970( Volume 13; Number 7 ) by Burton H. Bloom. At this time, the performance characteristics of storage devices limited the effective use of bloom filters. Over time, the benefits of bloom filters only decreased as storage devices increased in capacity and performance. However, after the Internet became commercial, the performance issue of caching data becomes more relevant due to the relative slow performance of networks when compared to desktop and server processing speeds. The need for scalable software has also increased the need for caching mechanisms such as the Bloom filter.

What is in this seminar?

This one day seminar, performed on client premises, gives web developers a complete understanding of Bloom filters, both theoretical and practical. Participants will understand how to architect, implement and tune Bloom filters for their own web applications. Each participant will receive printed documentation of the seminar and software including source code for implementing Bloom filters in their applications.

Who is this seminar designed for?

This seminar is designed for mid-level to very experienced web developers. The participant should be an experienced programmer using C, C++ or Java. The source code to this seminar is authored in C++. Each participant should understand basic web protocols ( HTTP, ... ) or have experience designing TCP/IP based applications. While not a requirement, participants will find a background in statistical mathematics useful.

What is the availability and price for this seminar?

This page contains the most recent details for this seminar.