|
I understand that, statistically, sequential search is much slower when there is a big amount of data to be searched. However, I'm kind of surprise to hear you said that a database search could be faster than array search. Is it because %lookup will not use binary search when passing the start index? Reason for not using logical: The particular data file is our master "decode" table. It's divided into two sections, the key and data. The data portion is a long text field that can be sub-divided into separate field from an application. My application happens to need to search this file by the data portion. Although not every often, other programmers could go into the application to change the position of the field which will cause by logical to not work correctly. -----Original Message----- From: Hans Boldt [mailto:boldt@xxxxxxxxxx] Second, since the data is already in a file, why not just define a logical view of it and use that to search for what you want? That's much easier, and probably faster too.
As an Amazon Associate we earn from qualifying purchases.
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.
midrange.com
