Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^2: Lookup closest hash key

by Just in (Sexton)
on Jan 25, 2011 at 16:02 UTC ( #884159=note: print w/replies, xml ) Need Help??

in reply to Re: Lookup closest hash key
in thread Lookup closest hash key

I have possibly over simplified my concern. But your replies negate the need for a hash, which confirms my suspicions. The module pointers are excellent, their reading will prove useful for similar problems.

That said Tie::RangeHash looks very useful, and I'll do some benchmarking to see if it's worth while.

The hash implementation I used should work for the time being, however I suspect that the actual data source will grow in magnitudes making db interaction and SQL statements more attractive. Again more benchmarking.

My most heartiest thanks for the pointers and replies.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (4)
As of 2021-01-17 13:30 GMT
Find Nodes?
    Voting Booth?