[Coco] [Color Computer] Re: the final stage of optimization

[jdiffendaffer]

I guess I should have been more clear here.
If you are dealing with on disk data, pointers would be record numbers and the compare reads the records and does the compare.

You can make operations significantly faster if you keep some part of the records in memory to reduce disk accesses since that is the slowest operation.  A hash of the records might be a good idea if you can come up with a decent one.

--- In ColorComputer at yahoogroups.com, "jdiffendaffer" <jdiffendaffer at ...> wrote:
>
> Wayne
> 
> If you are using strings you'll need a table of pointers to the actual data so you don't have to move strings around, which is much slower than pointers.