‎2007 Aug 02 7:18 PM
Hi Experts,
There is a custom program ZRGUREC10 which is a modified version of standard program <b>RGUREC10</b>.
<b>The modification made was</b> just addition of GL account number as another selection parameter to be able to select by account number within a document.
<b>The problem is</b> a runtime issue with this program when running it for large companies and a posting date range. If you do not enter specific document numbers, the program is selecting all documents from the document header table (BKPF) and then looping through all documents to find the selected GL account numbers in the document detail table (BSEG).
Please refer RGUREC10 program for more clarification.
<b>Please, suggest</b> as how i can modify this program to improve the runtime.
Thanks for your help.
Regards,
Pankaj Singh
points assured
‎2007 Aug 02 7:30 PM
It's a big change and you probably won't want to do it, but try BSIS and BSAS rather than BKPF.
Rob
‎2007 Aug 02 7:35 PM
Hi Rob,
I was thinking we could possibly eliminate the loop of the selected BKPF entries and just select from BSEG to get everything we need.
But it will be a big change..
Is there anything else you can suggest ?
Thanks,
Pankaj
‎2007 Aug 02 7:43 PM
Selecting from BSEG without BUKRS and BELNR will probably be slower. BSIS and BSAS are the secondary index tables for the GL. If you're willing to make the change you suggested, you should look at this instead.
Rob
‎2007 Aug 02 7:45 PM
‎2007 Aug 02 7:53 PM
It looks like a fairly complex program and has multiple paths for selecting from BKPF. You might want to see if you can simplify based on your users requirements and force a single path where you get the data from BSIS and BSAS.
You may also need additoinal data that you can only get from BKPF or BSEG. but BSIS and BSAS will give you the document numbers and you will be able to get them efficiently.
Good luck.
Rob
‎2007 Aug 03 12:56 PM
hi
recently i got the same problem
then you take the basis people help and reduce the output load on the parameter
so u can solve the problem
reward if usefull