× 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.



Hello Cesar,

Hello I have a question that I hope some one can help with please.I
have written ILE RPG program application that use SCAN operation (15
times by record) to re-format data. The record length is 350.

The SCAN op-code is about as efficient as possible for what it does. There's no way to make SCAN (or the %scan() BIF) more efficient than it already is.

Essentially these are the things you can do to improve performance (from most effective to least effective):

1) Improve the design of your database so record can be searched for by indexes instead of having to read each record and scan it.

2) Reduce the number of records you have to read.

3) Reduce the number of times you have to scan each record.

I realize that these suggestions are very general and vague -- but then, so was the question you asked. The only piece of information you gave us about your situation is that you're using SCAN. Remember, we don't work in your shop, and we're not familiar with your environment! So if all we know is that you're using SCAN, the only possible answer would be how to improve the SCAN op-code. If that isn't an option (and it isn't) then all we can really say is "no, there's no way to make SCAN faster". On the other hand, if you had explained the scenario in broader terms and told us about the business dilemna you're trying to solve (instead of which tool you're trying to use to solve it) then we might have more suggestions for you.

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.