Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: optimizing a linear search by Indexed or bucketed hashing

by Cop
on Oct 05, 2007 at 01:47 UTC ( #642804=note: print w/replies, xml ) Need Help??


in reply to optimizing a linear search by Indexed or bucketed hashing

This is like a simplified B-Tree, with hash you can easily do this yourself.

Don't want to do this yourself, then put this in a database, it will do this for you. You should use database any way.

  • Comment on Re: optimizing a linear search by Indexed or bucketed hashing

Replies are listed 'Best First'.
Re^2: optimizing a linear search by Indexed or bucketed hashing
by GrandFather (Sage) on Oct 05, 2007 at 01:50 UTC

    actually it's more like an a-z tree ;).


    Perl is environmentally friendly - it saves trees

      You are obviously right ;-)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (3)
As of 2020-07-05 01:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?