InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Referential Integrity Check Modue for Sam Files

IP.com Disclosure Number: IPCOM000030872D
Original Publication Date: 2004-Aug-31
Included in the Prior Art Database: 2004-Aug-31
Document File: 4 page(s) / 261K

Publishing Venue



A program is disclosed that performs the key comparison against two SAM (Sequential Access Method) Files (or Flat Files) of which file record length and key field positions are different from each other even if the key relation is One to One, or One to Many, or Many to One, or Many to Many, without coding any program, and shows the results by generating 4 Files and 1 control report.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 50% of the total text.

Page 1 of 4

Referential Integrity Check Modue for Sam Files

1. Current Application Developer's practice of performing Key-existence Check against SAM Files: Program Coding is required!

It is a usual practice for application developers to code the individual key-match program in order to do the check of key record existence between two SAM files, whenever the analysis of Source Data is required or when the verification is to be done against the data migration results which should be performed based on the ERD (Entity Relationship Diagram) of New Object Database.

2. What if a Common Utility Program could enable the key-existence check between the SAM Files without coding the program?

No development workload is required, but only the execution is requested The leadtime of data analysis or results verification could be significantly decreased, which would imply the cost reduction.

3. Characteristics of the Invention

generated only through PL/I program coding, which can declare and allocate the input parameters dynamically, while other user program, eg. COBOL, can not do the dynamic allocation executed in IBM OS/390 Mainframe only

Application developers have only to know 5 kinds of information before doing the key-comparison - the record length of Two Input Files, whatever the length is same or not, but less than and equal to 4096 byte (2) - the starting Position of each File's Key Field (2)

- the length of key field (1) can be executed whatever the key relation is One to One, or One to Many, or Many to One, or Many to Many due to imbedding the structured and sophiscated key-match internal logic Remarks/Comment can be described at Description parameter with 50 byte length at maximum, for the reporting could be applied to the data replication, eg, from Production to Test database, keeping the referential integrity by the manipulating the value at Indicator of Writing Matched Record File to 'Y', also without coding the user program works great at Referential Integrity (RI) Check against the Big SAM files which are to be loaded into DB2 Tables, as one of Data Migration Verification, instead of the execution of SQL Full Outer Join (or Left Outer Join) that requires lots of CPU cost and DB2 Work DB and thus can not frequently result in success, against enormous and many Object databases normally place the SORT step as predecessor to ensure the exact Key Comparison can also handle SAM Files with multiple key fields after allowing the SORT process reformatt the key fields as contiguous

4. Flowchart of Invention's process


Page 2 of 4

Sample End User Guide:


[This page contains 1 picture or other non-text object]

Page 3 of 4


//$RICHK2 JOB 'MULTI KEY COMPARE',CLASS=A,MSGCLASS=X,NOTIFY=&SYSUID //******************************************************************** //* S A M P L E J C L F O R K E Y C O M P A R I S O N ****** //******************************************************************** //* FUNCTION : PERFORM THE K...