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.
|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
by Cop on Oct 05, 2007 at 03:46 UTC