| Projects on Google Code | Results 1 - 10 of 12 |
C++ Bloom Filter Library, with the following capabilities:
# Optimal parameter selection based on expected false positive rate.
# Union, intersection and difference operations between bloom filters.
# Compression of in-use table (increase in false positive probability vs space)
# Porta...
bloom,
filter,
hash,
cPlusPlus,
fastlookup,
algorithm,
probabilistic,
query,
code,
difference,
intersection,
bloomier,
fast,
lookup,
union
C++ Bloom Filter Library, with the following capabilities:
# Optimal parameter selection based on expected false positive rate.
# Union, intersection and difference operations between bloom filters.
# Compression of in-use table (increase in false positive probability vs space)
# Porta...
bloom,
filter,
c,
algorithm,
probabilistic,
query,
fastlookup,
intersection,
difference,
union,
bloomier,
blockbased,
bloomfilter,
cplusplus,
set
This is a stand-alone implementation of a Bloom filter, as described here:
http://en.wikipedia.org/wiki/Bloom_filter.
The latest release is 0.9 and can be downloaded from [http://code.google.com/p/java-bloomfilter/downloads/ here]. The latest version of BloomFilter.java is also available in the...
= Introduction =
_In goes gross, out comes lovely_
Gross is a greylisting server. The features that make gross
stand out from other greylisters are:
* it's blazingly fast
* it's amazingly resource efficient
* it can be configured to query DNSBL databases, and enforce greylisting on...
The General Hash Function Algorithm library contains implementations for a series of commonly used additive and rotative string hashing algorithm in the Object Pascal, C and C++, Java, Python and Ruby programming languages
For more information please visit:
http://www.partow.net/programming/hash...
hash,
function,
algorithm,
cPlusPlus,
java,
ruby,
python,
pascal,
bloom,
filter,
framework,
message,
digest,
routine,
table
This is an attempted port of Maciej Ceglowski's CPAN's Bloom::Filter to PHP.
Source:
http://search.cpan.org/src/MCEGLOWS/Bloom-Filter-1.0/Filter.pm
CPAN Bloom:Filter page
http://search.cpan.org/~mceglows/Bloom-Filter-1.0/Filter.pm
From CPAN Description:
A Bloom filter is a probabilisti...
A working port of the bloom filter implementation documented here: http://www.coolsnap.net/kevin/?p=13 along with a port of the BitField class here: http://snippets.dzone.com/posts/show/4234 to save on space and because gmp_bittest isn't going to be in a stable release of php before 5.3 which forces...
Bloomin-J is a bloom filter implementation in
Java, with 2 particular differences which may
make it stand out from other implementations.
* high capacity (64-bit)
* language/network interoperability
On that note, there will also be Ruby and
possibly other implementations.
Information retrieval is a traditional application for computers, which has become even more prominent with the advent of the World Wide Web. The process of retrieving content from a text corpus (collection of text files) is normally managed by analyzing the text files to produce an index, and then ...
A Bloom Filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.
=Usage=
{{{
B0 = bloom:new(2000, 0.001).
bloom:is_bloom(B0).
B1 = bloom:add_element(Key, B0).
bloom:is_element(Key, B1).
}}}