DSXchange

You have two types of approaches to doing this: (a) using the functionality of the "dsjob" command to create a text file which contains the job run status. This can the be parsed (using a UNIX tool or a DataStage job) to get the information you want and then written to the database (b) using a DS/Ba...

Try a very simple job, create a dummy source file with 10 records; in your transform stage put a constant derivation of " " for an output data type of CHAR(1) that goes to your table. I prefer to use a row generator stage, but stick with the source sequential file if you haven't done this before. Wh...

srikanth, How are you starting these jobs? If you start them through the dsjob command then you might have mis-spelled your project name. On the sequencer question, there really is no limit to the absolute number of jobs; it depends how you structure your sequencer, how many of the jobs you want to ...

royhhlai, Please ask your administrator to enable the deadlock daemon. You need to attach to the DataStage engine directory, edit the file dsdlockd.config and set the line "start=1" to enable it. It will get started automatically the next time that the DataStage server gets started; you can also sta...

I think it can be done with a query since the data is actually contained within the DS_JOBOBJECTS hashed file, and I know it can be done with a BASIC program.

Santosh, please read the Parallel Job Advanced Programmer's Guide , page 6-25 for the specific information for the APT_ORACLE_PRESERVE_BLANKS information; it is very easy to include in your job parameters and of course you want to force it to preserve blanks so the setting would be "TRUE". In additi...

I just did a test with the surrogate key generator stage in PX and can see the limitations - since the values aren't persistant across runs you are quite correct in asserting that the stage is of limited value! I think I'd prefer to use a buildop or a PX transform stage with logic instead of resorti...

I would to an export into a .DSX or .XML file and then use string searches to find those jobs that do so. There is no builtin method to do this.

Appendix B-1 of the Parallel Job Developer's Guide lists the functions you can use, in your case DateFromDaysSince look like the appropriate one to use.

Yes, you can put both types of transformers into a shared container. But you can only call BASIC subroutines from PX Basic transformers, so it doesn't affect the previous answer about using the server key management calls.

Nevertheless, PX has a surrogate key generator stage that you can use.

yksjosh, there is no difference between ASCII and EBCDIC; both represent one character in one byte. As mentioned before there is certainly a limitation on record length; but I've done over 1Mb/row so I wouldn't worry about it unless you have longer rows. I suspect that the limitation will be the use...

Ascential support has confirmed that there is no builtin ability to get this information. The alternatives that they have suggested are: 1. You can export the whole project to a *.dsx file and automate the scanning the file for the: Name "Job Name" JobVersion "50.0.0" 2. You can use the reporting to...

Please write your output to a sequential file to test this - if there are spaces in the text file then your problem lies in the Database portion. If your target database is Oracle and the datatype in the database is VarChar2 then Oracle will put in a null. There are also PX load options which might ...

DataStage sequential file rows can be quite large, I'm not sure what the limits are but I know I've used binary records that are in the Mb range. The processing speed it not really dependent upon row width but on the number of columns in a sequential file. Reading 100Kb of data that has one column p...

If you want to make optimal use of your system and will have that many runs of your DataStage job running, then a custom solution will be best. I've done some BASIC coding before in the past where I need to do something similar to what you intend; this program is set to ensure that <n> instances are...