Google ã°ã«ã¼ãã§ã¯ããªã³ã©ã¤ã³ ãã©ã¼ã©ã ãã¡ã¼ã« ãã¼ã¹ã®ã°ã«ã¼ããä½æãããããããããã©ã¼ã©ã ãã°ã«ã¼ãã«åå ããããããã¨ã§ã大å¢ã®ã¦ã¼ã¶ã¼ã¨æ å ±ã®å ±æããã£ã¹ã«ãã·ã§ã³ãè¡ããã¨ãã§ãã¾ãã
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
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
å¦çãå®è¡ä¸ã§ã
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}