Xor Filters: Faster and Smaller Than Bloom Filters – Daniel Lemire's blog
In software, you frequently need to check whether some objects is in a set. For example, you might have a list of forbidden Web addresses. As someone enters a new Web address, you may want to check whether it is part of your black list. Or maybe you have a large list of already used passwords and you want to check whether the proposed new password is part of this list of compromised passwords. The
Bloom Filters
Everyone is always raving about bloom filters. But what exactly are they, and what are they useful for? Operations The basic bloom filter supports two operations: test and add. Test is used to check whether a given element is in the set or not. If it returns: false then the element is definitely not in the set. true then the element is probably in the set. The false positive rate is a function of
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
GitHub - andreiz/bloomy: PHP extension implementing Bloom filters
Bitbucket
Bitbucket
GitHub - bitly/dablooms: scaling, counting, bloom filter library
GitHub - axiak/pybloomfiltermmap: Fast Python Bloom Filter using Mmap
Reconfigurable Networking Group : Publications
