Silver Spoon - Some hacks based on Bloom filters
Silver spoon is some C code for that plays around with Bloom filters. Make of it what you will.
Bloom filters are a scheme for approximate testing if a item is a member of set. They are useful when the set is huge, for example they were first invented to test if spelling words are in the dictionary. Bloom filters can generate false positives.
Bloom counters are a varient of bloom filters that estimate how many times a given item occurs in a stream of items. Like the false positives of a bloom filter a bloom counter can over count some times.
Bloom filters are used for approximate membership testing, while bloom counters provide approximate accounting.
Silver spoon lives here: http://www.cozy.org/silverspoon/
See the README file found after you unpack the distribution.
See the README.dev file.
See the LICENSE file. Note that I'm currently hording the copyright; this will likely change.
See also:
- Network Applications of Bloom Filters: A Survey by Andrei Broder and Mitzenmacher (pdf, citeseer)
- Building a Better Bloom Filter by Adam Kirsch and Michael Mitzenmacher pdf)
- New Directions in Traffic Measurement and Accounting by Cristian Estan and George Varghese (citeseer)
Generated on Thu Jul 28 22:20:52 2005 for HTP - a library for realtime detection of hotspots by
1.4.4
