× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



> Can anybody tell me which would be the fastest of the 3?
>
> I know I could code the 3 versions and run performance tests, but I'd hate
> to hear someone say later on: 'Oh, but I could have told you in advance
> that xxx would be much faster.'

I'm assuming that you won't need to access the data by key?  (I can't
think of a reason that you would!)  Therefore, user space access will be
faster than file access -- no reason to make a temp file in QTEMP.

Personally, I think I would load the relevant bits of the user space into
an array of qualified data structures.   An array in main storage will run
slightly faster than user space will (very slightly) but will be much
easier to read and work with. Since you'll be looping the array for every
record in the file, you might as well have something that's easy to work
with :)



As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.