http://qs321.pair.com?node_id=642804


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 ;-)