From: Matt Todd <chiology@...>
Date: 2006-09-08T07:36:39+09:00
Subject: Re: Faster datastructure for lookups wanted

------=_Part_254845_15849877.1157668427063
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

> My code spends most of its execution time doing lookups from
> a hashtable with about 1M keys. The keys are strings and the values
> are arrays of integers. Most of the time only of length 1.
>
> I do not care  how long the construction of the datastructure takes,
> but the lookup should be as fast as possible.


Would putting it into a database be a possible solution? I may be wrong, but
I'm pretty sure RDBMSes should be pretty quick to parse through and get
data. SQLite, PostgreSQL, or MySQL would be options.

Also, I'm thinking there may be a better method for finding the right
elements, though I'm not exactly sure what you're doing.

M.T.

------=_Part_254845_15849877.1157668427063--