|
John said: > We aren't talking about the real world. We are talking about a Java > Programmer wanting to prove her theory that loading the entire database to > an in-memory program and flash sorts is faster than recursive calls. Let her > have her 15 minutes. When it ends up in the drink, we can get back to issues > that really matter. Yes, you've hit it exactly. And since I am not a Java Programmer, my advice on the matter is less than interesting to Those Who Must Be Obeyed ('You are an iSeries guy. You do not know about Java.') Regarding the socket solution; we've bandied that about, and we were trying to come up with something that could be swapped out as simply as possible when the network guys come track me down. Since we're already using a stored procedure which returns a result set, the obvious thing is to see how large a result set RPG can return. It looks like 16Mb is the reasonable limit without getting into Teraspace. There isn't a way to reduce the dataset: it is an itemised corporate telephone bill for one month, and the spec calls for the end user to be able to see it all. Not my spec, but definitely my problem. For the record, my proposal is to limit the result set to something in the neighbourhood of a thousand rows, and use more sophisticated selection criteria (in effect, alter the spec.) One issue is that the database does not currently contain enough columns which are 'interesting' to the end-user; things like their internal general ledger account and so on. Thanks for the advice! --buck
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.