Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

Re: Efficient code.

by NiJo (Friar)
on Jan 30, 2006 at 20:40 UTC ( #526557=note: print w/ replies, xml ) Need Help??


in reply to Efficient code.

Bloom filters are very efficient, especially with low hit rates.

Speed, linear time behavior and low memory are major advantages. Disadvantages include a tunable rate of false positives and not telling which line did match.

Reimplement the algorithm using Bit::Vector if you need more speed.


Comment on Re: Efficient code.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://526557]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (5)
As of 2015-04-01 01:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When putting a smiley right before a closing parenthesis, do you:









    Results (677 votes), past polls