|
In the project I'm working on that involves taking a rather Rube Goldberg contrivance of OPNQRYF calls, and re-implementing it in SQL, part of the complexity of the old OPNQRYF implementation was that with a complex query involving 2 levels of AND and OR across a bunch of files, trying to do it in a single OPNQRYF would take far longer (order of FOREVER) than breaking it down into a bunch of simpler OPNQRYFs. Am I likely to encounter the same problem with SQL?
-- JHHL
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.