Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?

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?

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (8)
As of 2015-11-29 15:32 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (751 votes), past polls