Hi there, On Wed, 28 May 2003, Perrin Harkins wrote:
> simran wrote: [snip] > > * Lookup the _distance_ for the planet _mercury_ on the date _1900-01-01_ [snip] > you can get by with MLDBM or something similar. You might also want to investigate using a compiled C Btree library which could be tuned specifically to your dataset. Hard work. [snip] > > perhaps something such as copying the whole 800,000 rows to memory [snip] > That would be the fastest by far, but it will use a boatload of RAM. To economise on memory you could compress the data (or part of it) before storage/lookup using a fast compress/decompress algorithm. There would be a tradeoff between memory consumption and processor cycles of course. That kind of thing can get a bit complicated... :) 73, Ged.
