On 06/06/11 14:02, jig wrote: > > Thank you Jordan, > > You're right about OPENSEQ and READSEQ. However it depends on what you want > to do with these long lists. > What we do is either merge the lists or find the difference or find the > union. And the way we have done it in the past is extremely efficient. > For instance if we want to find the difference between two lists we run > LIST.DIFF etc. However in order to do that the system sometimes has to read > both lists. With normal lists up to 1 million elements it takes 1 or 2 > seconds, but with larger lists it just falls over. To do the same using > READSEQ it would take much longer than 1 or 2 secs and we only have a couple > of secs to play with. > In the old PICK we used to do it with User exits (Assembler code). But the > LIST.DIFF, LIST.INTER etc are just as efficient when they work. > > The issue is not the how to do it but the why it fails so abruptly and what > are the limits ? > Also is there a uvconfig variable that affects or can improve such a thing ? > These are my specific questions. > > thanks for your suggestion anyway. > jack > > What OS are you using? aiui, on nix at least, UV simply calls out to the sort command anyway. (Although I could be wrong :-)
It might be easier to rewrite the commands to do that (or is the source provided with UV? You could fix that?) Cheers, Wol _______________________________________________ U2-Users mailing list U2-Users@listserver.u2ug.org http://listserver.u2ug.org/mailman/listinfo/u2-users
