Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

Re^3: 32bit/64bit hash function: Use perls internal hash function?

by Fletch (Bishop)
on Apr 09, 2022 at 02:34 UTC ( [id://11142864]=note: print w/replies, xml ) Need Help??


in reply to Re^2: 32bit/64bit hash function: Use perls internal hash function?
in thread 32bit/64bit hash function: Use perls internal hash function?

Two (possibly off base, but given your description . . .) ideas that come to mind:

  • use a Bloom Filter (edit: probably not relevant)
  • use DB_File and let it build a btree (backed on disk) for you rather than you manually (basically) doing similar

Edit: tweaked; upon rereading I don't get that your dataset's necessarily sparse (in that you need to quickly check for membership or not) so the bloom suggestion's off base probably.

The cake is a lie.
The cake is a lie.
The cake is a lie.

  • Comment on Re^3: 32bit/64bit hash function: Use perls internal hash function?

Replies are listed 'Best First'.
Re^4: 32bit/64bit hash function: Use perls internal hash function?
by Tux (Canon) on Apr 09, 2022 at 12:28 UTC

    Or (shameless plug) a real database using Tie::Hash::DBD, though that might be slow.


    Enjoy, Have FUN! H.Merijn
[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://11142864]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others avoiding work at the Monastery: (6)
As of 2024-04-24 08:38 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found