Bloom filter - Wikipedia
A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either "possibly in set" or "definitely not in set". Elements can be added to the set, but not removed (though this can be addresse
Ruby/sbloomfilter
sBloomFilter - A C extension library of Bloom Filter for Ruby This is the C extension library of Bloom Filter. What is the Bloom Filter? Check here. Synopisis #!/usr/bin/env ruby require 'sbloomfilter' def main # m=100000000, k=4, random seed=1 bf = BloomFilter.new(100000000, 4, 1) num = 0 while line = ARGF.gets data = line.chop if bf.new_entry?(data) num += 1 bf.insert(data) end end print "#dist
Using Bloom Filters
Using Bloom Filters Apr 8, 2004 by Maciej Ceglowski Anyone who has used Perl for any length of time is familiar with the lookup hash, a handy idiom for doing existence tests: foreach my $e ( @things ) { $lookup{$e}++ } sub check { my ( $key ) = @_; print "Found $key!" if exists( $lookup{ $key } ); } As useful as the lookup hash is, it can become unwieldy for very large lists or in cases where the
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
