|
I'm not starting that holy war again, but here is an example.
Take a couple of tables that are of a Parent/Child relationship. Large tables, say, a million records for the parent, and 3 million for the child. These tables have their primary keys defined. Now write a program that reads in a do loop, running another do loop for the read of the child file in order to print some sort of report. Run the program and see how long it takes.
Now, if you can, write a matching record program to print the same report.
The Cycle/MR will outperform the Full Procedural program by orders of magnatude.
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.