Hierarchical database conversion with conditional write

Abstract

A process for transitioning a hierarchical input database to create a hierarchical output database. The processing occurs generally in two stages. During the first stage, information contained in user-specified driver tables is utilized to extract only pertinent data from the input database and thereby produce intermediate data in a form accessible by the second stage. During the second stage, information from the driver tables is applied to the intermediate data to map this data to the required output form representative of the hierarchical output database. With this processing approach, the driver tables are derived and then maintained independently of underlying software that executes under control of the driver tables. A database conversion is efficiently effected by preparing the driver tables and then invoking execution of the common software embodying the extracting and mapping subprocesses.

Claims

What is claimed is:

1. In a computer system having a memory and storage device, an improved method for transitioning an input hierarchical database serving as a system input to obtain an output hierarchical database, the method including the steps of

generating and storing in the memory: (i) an input dictionary defining the contents of the input database; (ii) an output dictionary defining the contents of the output database, the contents including records composed of segments; and (iii) a map table having entries defining the correspondence between the input database contents and the memory,

identifying, with reference to the input dictionary and the map table, the contents of the input database selected for transitioning, extracting the selected contents from the input database, and storing the extracted contents in the device in hierarchical sequence as identifier-data pairs, and

sequentially processing the identifier-data pairs with reference to the input dictionary, the output dictionary and the map table, and storing data associated with each identifier as associated data in the memory,

wherein the improvement to the method comprises the steps of

before the step of processing, generating and storing derivation table entries in the memory, each of said entries specifying computer instructions to generate the final contents of the output database from the associated data, wherein one of said instructions: supplies comparison information expressed in terms of the associated data; and conditionally writes to the device a subset of the associated data needed to complete a corresponding subset of the output database, said conditional write executable whenever a comparison between said comparison information and the next incoming identifier in the sequence of identifier-data pairs is satisfied,

before the step of processing, augmenting predetermined map table entries with preselected ones of said derivation table entries callable during the step of processing, and

upon a call to said conditional write during the step of processing, performing said comparison and, when satisfied, executing said conditional write to generate said subset of the associated data and then storing said subset of the associated data in the device,

whereby the improvement effects the transitioning of a large input database by a computer system having insufficient memory to store data for all segments of an output database record until all transitioning operations are completed.

2. The improved method as recited in claim 1 wherein another of said instructions issues, whenever a key of a given output database segment is specified, a key ready command to the system upon preparation of a portion of the associated data corresponding to said key, said command arranged to issue before the execution of said conditional write.

3. In a computer system having a memory and storage device, an improved method for transitioning an input hierarchical database serving as a system input to obtain an output hierarchical database, the method including the steps of

generating and storing in the memory: (i) an input dictionary defining the contents of the input database; (ii) an output dictionary defining the contents of the output database, the contents including records composed of segments; and (iii) a map table having entries defining the correspondence between the input database contents and selected memory locations,

identifying, with reference to the input dictionary and the map table, the contents of the input database selected for transitioning, extracting the selected contents from the input database, and storing the extracted contents in the device in hierarchical sequence as identifier-data pairs, and

sequentially processing the identifier-data pairs with reference to the input dictionary, the output dictionary and the map table, and storing data associated with each identifier as associated data in the memory,

wherein the improvement to the method comprises the steps of

before the step of processing, generating and storing derivation table entries in the memory, each of said entries specifying computer instructions to generate the final contents of the output database from the associated data, wherein a first of said instructions unconditionally writes to the device a subgroup of the associated data needed to complete a corresponding subgroup of the output database, and wherein a second of said instructions: supplies comparison information expressed in terms of the associated data; and conditionally writes to the device a subset of the associated data needed to complete a corresponding subset of the output database, said conditional write executable whenever a comparison between said comparison information and an identifier corresponding to said subset is satisfied, and wherein a third of said instructions executes a data movement from target memory locations to destination memory locations defined by said third instruction, said destination locations storing a part of the output database,

before the step of processing, generating and storing in the memory a temporary storage dictionary defining the format of data stored in predetermined ones of the selected memory locations,

before the step of processing, augmenting predetermined map table entries with preselected ones of said derivation table entries callable during the step of processing,

upon a call to said unconditional write during the step of processing, executing said unconditional write to generate said subgroup of the associated data and then storing said subgroup of the associated data in the device,

upon a call to said conditional write during the step of processing, performing said comparison and, when satisfied, executing said conditional write to generate said subset of the associated data and then storing said subset of the associated data in the device, and

upon a call to said data movement during the step of processing, identifying said target memory locations with corresponding ones of said selected memory locations and moving data in said identified target memory locations to corresponding ones of said destination memory locations,

whereby the improvement effects the transitioning of a large input database by a computer system having insufficient memory to store data for all segments of an output database record until all transitioning operations are completed.

4. The improved method as recited in claim 3 wherein said conditional write is executable whenever said comparison between said comparison information and the next incoming identifier in the sequence of identifier-data pairs is satisfied.

5. The improved method as recited in claim 4 wherein another of said instructions issues, whenever a key of a given output database segment is specified, a key ready command to the system upon preparation of a portion of the associated data corresponding to said key, said command arranged to issue before the execution of said conditional write.

Description

TECHNICAL FIELD OF THE INVENTION

This invention relates generally to computerized databases and, more particularly, to a methodology for transitioning a hierarchical input database to hierarchical output database comprising information derived from the input database, thereby altering its original hierarchical structure and content.

BACKGROUND OF THE INVENTION

In a hierarchical model of a database, items of information or data are represented by a tree-and-branch structure. This model of a database emphasizes the superior-inferior relationships between information items and is very suitable for data wherein such relationships are inherent, e.g., organization charts.

More specifically, a hierarchical database is defined as an ordered set of data wherein elements of data in the set are composed of different occurrences of a single type of database format. An occurrence in turn comprises an ordered arrangement of segments of data and, finally, a segment is defined in terms of a set of associated fields.

Oftentimes to satisfy updated design specifications, particularly in the development of large software systems, it is necessary to transition an existing database to a new database, usually by rearranging, modifying such as by additions and deletions or restructuring the existing database. Broadly speaking, the transitioning process converts field occurrences in the existing or input database to different field or segment occurrences in the new or output database.

With conventional conversion approaches, whenever database transitions are required, new database-specific transition software has been developed and tested each time the existing database is converted. For large system developments, this is inefficient since a significant portion of the programming effort and budgetary expenditure is devoted to the development of each database-specific transition.

SUMMARY OF THE INVENTION

These shortcomings and other deficiencies and limitations are obviated, in accordance with the present invention, by an essentially generic transition process that converts data fields from input database segments into corresponding fields in different or restructured output database segments. Thus, for instance, two input fields from different segments can be combined into one output segment.

In accordance with an illustrative embodiment of the present invention, the generic transition process is effected by executing user-independent, common software under control of a set of driver tables prepared by the user. These tables are derived and then maintained independently of the underlying, common software. The tables contain all the information necessary to effect complex decisions and conversions in moving input fields to output segments. The processing occurs in generally two stages. During the first stage, a subset of the information contained in the driver tables is utilized to extract pertinent data from the input database and thereby produce intermediate data in a form accessible by the second stage. During the second stage, information from the driver tables is applied to the intermediate data to map these data items to the required output form representative of the hierarchical database.

The organization and operation of this invention will be better understood from a consideration of the detailed description of an illustrative embodiment thereof, which follows, when taken in conjunction with the accompanying drawing.

BRIEF DESCRIPTION OF THE DRAWING

FIG. 1 is a block diagram of the generic transition process in accordance with an illustrative embodiment of the present invention;

FIG. 2 is a depiction of a database occurrence, including segments, of an exemplary hierarchical input database;

FIG. 3 is a representation of the required transition process to convert from the input to output databases;

FIG. 4 is a depiction of a database occurrence, including segments, of the hierarchical output database transitioned in accordance with FIGS. 2 and 3;

FIG. 5 is a pictorial representation of the input database of FIG. 2 in unloaded or sequentially accessible format;

FIG. 6 is a more detailed representation of the data fields of FIG. 5 indicating that fields not required in transitioning (non-cross-hatched fields) may be bypassed during the extraction process;

FIG. 7 depicts the ordering of FID-data pairs as extracted from the input data segments of FIG. 6;

FIG. 8 is a pictorial representation of data content of the output database of FIG. 1 as transitioned according to FIG. 3;

FIG. 9 is a hierarchical representation of an input database for an illustrative example;

FIG. 10 is a hierarchical representation of an output database for the illustrative example;

FIG. 11 depicts the interaction between the various subcomponents of information source 100 of FIG. 1;

FIG. 12 is a detailed flow diagram of extractor process 300;

FIGS. 13 and 14 provide a detailed flow diagram for mapper process 500; and

FIG. 15 depicts the concatenated key structure for the output database.

DETAILED DESCRIPTION

1. Overview

With reference to FIG. 1, an embodiment of the generic transition process disclosed in overview fashion by block diagram 50 comprises extractor process 300 and mapper process 500, each executing in a general-purpose computer (not shown) under control of information provided by information source 100 stored in the computer. A representative computer is an IBM model 3081 having the OS/MVS type operating system with the IMS program product serving as the database management system.

Basically, extractor process 300 reads items of information or data contained in hierarchical input database 200 and, as directed by a portion of information source 100, namely, input source 110 comprising input dictionary 120 and map table 130, extracts relevant data from database 200 to produce the information stored in FID-Data (Field IDentifier-Data) storage area 400.

In addition, mapper process 500 reads from FID-Data 400 and, based on information provided by source 100, converts and then transfers the selected fields to hierarchical output database 600 in a format defined by the user via source 100. The total information content of source 100 is generally established by the user prior to the execution of the extractor and mapper processes, although it is possible to execute extraction process 300 with only input source 110 defined initially.

In elucidating the transition process represented in the overview of FIG. 1, it is supposed that input database 200 has the hierarchical form represented by FIG. 2, which depicts one database record occurrence 201 from the database. Record 201 is composed of first level, parent, or root segment 210, second level, child or sibling segments 220 through 222 and 240 and third level or grandchild segment 230 of sibling segment 220. The data in each segment is represented by the prefix "I" (Input Data) combined with an order sequence number, as is the convention in ordering hierarchical databases (i.e., top-down, front-to-back, left-to-right). The data in each segment may be further partitioned into subcomponents called fields (not shown in FIG. 2 but to be discussed below). The database layout of FIG. 2 represents the general structure of a record occurrence. Specific occurrences may have one or more segments missing. For example, the second record occurrence may not contain the I3 segment.

FIG. 3 depicts a required transition of input database 200, thereby creating output database 600 of FIG. 1. The transitioning process yields the hierarchical form represented by FIG. 4, which depicts the general record occurrence 601 from the database. The data is represented by the prefix "O" (Output Data) and a sequence number. In the conversion, subsets of I2 are to be distributed to both segments 620 through 622 and 630 through 632 (O2 and O3, respectively); similarly, I4 is to be restructured to produce segments 610 and 650 (O1 and O5, respectively).

Although input database 200 is shown in hierarchical form in FIG. 2, the unloaded or sequentially accessible version is the format actually operated on by extractor process 300. This unloaded format is shown in FIG. 5. The hierarchical database is unloaded in sequential format (i.e., top-down, etc.) and each segment is prefixed with a header (designated H in FIG. 5), which provides such information as the length of the actual data in each segment. Most main frame computer systems are configured with a database management system that will unload a hierarchical database to a sequential format by invoking a simple set of commands. Thus, the unloaded database is treated as the actual input into extractor 300; however, the unloading may also be considered a first processing step in extractor process 300 without loss of generality.

The data arrangement of FIG. 6 provides a more detailed view of the data contained in the "I" blocks of FIG. 5. For example, from line (i) of FIG. 6, I1 is composed of three fields, namely, fields A, B and C. Similarly, I2, I3 and I4 are composed of, respectively, three, three and two fields. Lines (i)-(vi) show the first record occurrence whereas lines (vii)-(xi) illustrate the second record occurrence. It is observed that there is no I3 entry in the second record occurrence. This is indicative of the fact that any record occurrence may be devoid of one or more segments.

Focusing again on line (i) of FIG. 6, field A actually comprises two sub-fields, field B also comprises two sub-fields and field C is made up of four sub-fields (sub-fields are delineated by vertical hash marks). The manner in which sub-fields are grouped to form the fields is controlled by the user in the definition of information source 100 of FIG. 1. In this instance, for example, it is presumed the user grouped the first two of the seven contiguous sub-fields, thereby defining field A, because these grouped sub-fields provided a data component required in an output data segment.

As is also depicted in FIG. 6, certain fields are shown as cross-hatched such as, for example, fields A and C on line (i). Cross-hatched fields mark those fields that are brought from input database 200 by extractor process 300. The data resulting from the extraction process, namely FID-data stored in area 400, is depicted generically in FIG. 7. The unloaded data stream is shown in sequentially accessible format as it might appear on a magnetic tape. This is merely illustrative since the representation also applies to any direct access storage device such as disk storage.

The field identifier names and the fields to be extracted are user generated and supplied to extractor 300 by input source 110. In producing the output database, the user did not require the information stored in certain fields. For example, the data in field B of I1 or field D of I2 is presumably superfluous, and this data is bypassed during the extraction process.

Once the input data is converted to the format depicted by FIG. 7, the second major processing stage--represented by mapper process 500 in FIG. 1--is initiated. Mapper process 500 operates under control of information source 100 as provided by the user. Map table 130 of source 100 comprises entries which basically instruct process 500 to move input data fields to selected output data segments, as defined by output dictionary 140, either unconditionally or conditionally. A conditional move may be based, for instance, on the contents of a previously moved field or a combination of moved fields. Instructions for a conditional move generally result from invoking entries in derivation table 150. Broadly, in considering the interplay between source 100 and process 500, iterative process 501, a sub-process of mapper 500, generally executes in response to map table 130 and stores data in locations provided by output dictionary 140, whereas derivation process 502, also a sub-process of mapper 500, operates under control of iterative process 501 and instruction lists in derivation table 150.

The data arrangement depicted in FIG. 8 results from applying a particular specification of source 100 to transition process 50 described with respect to FIGS. 2 through 7. From FIG. 3, both I1 and I4 are mapped to O1; in particular, FIG. 8 indicates that fields A and C from I1 and field K from I4 are mapped in the order A,C,K. Such information is derived from map table 130 and is supplied to iterative process 501 during execution. In order to also demonstrate the interaction of iterative process 501 with derivation process 502, it is assumed that field K is moved only if some condition relative to field A is satisfied. This condition is supplied to derivation process 502 by appropriate entries in derivation table 150. For the first record occurrence of output database 600, represented by lines (i)-(ix) of FIG. 8, the condition on field A is presumably satisfied since field K on line (i) is moved. However, for the second record occurrence of FIG. 8 (lines (x)-(xvii)), the condition on field A is presumably not satisfied because field K on line (x) is not present (it is shown only as a dashed rectangle).

FIG. 8 is merely illustrative since only a portion of the data comprising database 600 is shown. For instance, certain information needed to construct the output header (similar to the header H of FIG. 5) has not been depicted in this overview description. Details pertinent to the configuration of database 600 will be provided in the sequel.

2. Transitioning Example

This section presents a step-by-step example on the procedure for transitioning input database 200 to obtain restructured output database 600. FIG. 9 depicts the hierarchical structure of the hypothetical input database whereas FIG. 10 shows the structure of the output database. This so-called Employee Profile Data Base requires restructuring so that more specific personnel needs may be accommodated. Some of these needs include: space for an additional phone number, expanded academic and company course information, and added payroll benefits. In transitioning the database structure, there is a need to combine some segments into one; to expand some segments to include more information; to split one segment into two segments; to create twin segments from multiple occurrences of a data field in one segment; to change the data content of fields; to delete an entire segment; and to delete one field from an input segment.

In effecting a transitioning process, the user initially prepares a transition specification as an aid to defining information source 100. In the Employee Profile Data Base, there are up to six types of input segments (FIG. 9) and six types of output segments (FIG. 10) per occurrence. Some segments are of fixed length whereas others are of variable length, as presented in the specification below. The following restructuring is required:

1. Input segment IX01, depicted by block 801 in FIG. 9, is a fixed length segment containing the following fields: EMPLOYEE CODE, NAME, SOCIAL SECURITY NO., JOB FUNCTION and START DATE. Since a hierarchical database requires a "key" for reference purposes in the root segment, EMPLOYEE CODE is selected as the key for this example.

The corresponding output segment OX01 (block 901 in FIG. 10) is also of fixed length. It contains rearranged information from input segment IX01 as well as certain new information derived from input segments IX02 and IX05. Also, space for five more digits is to be added to the ZIP field and a blank area for a corresponding WORK PHONE is to be appended. The key for this output segment is SOCIAL SECURITY NO.

2. Input segment IX02 (block 802 in FIG. 9) is a fixed length segment containing the following fields: STREET, CITY, STATE, ZIP and HOME PHONE. The entire contents of this segment are to be merged into output segment OX01 so that all unique employee information is in the root segment.

3. Input segment IX03 (block 803 in FIG. 9) is a fixed length segment composed of these payroll fields: GROSS, FED, FICA, SUI and NET. This segment is to become new segment OX02 (block 902 in FIG. 10) in the output database. In addition, two new payroll fields, namely, BONDS and PHONE CONCESSION are to be added to this output segment. Default decimal values of 0.00 are to be assigned to these new fields. Output segment OX02 is also a fixed length segment without a key.

4. Input segment IX04 (block 804 in FIG. 9) is a controlled variable length segment (that is, varying areas of the segment are controlled by counters) having these fields: HIGHEST DEGREE, UNIVERSITY, GRAD. DATE, NO. CO. COURSES (number of company courses), COMPANY COURSES, NO. ACADEMIC COURSES, and ACADEMIC COURSES-JR (job related). With respect to the fields that are variable:

(a) NO. CO. COURSES contains a counter for the number of occurrences of COMPANY COURSES;

(b) COMPANY COURSES is a variably occurring field having NAME and DATE sub-fields;

(c) NO. ACADEMIC COURSES contains a counter for the number of occurrences of ACADEMIC COURSES-JR; and

(d) ACADEMIC COURSES-JR is a variably occurring field having sub-fields of NAME, GRADE and CREDITS.

There can be zero occurrences of COMPANY COURSES and ACADEMIC COURSES-JR.

This input segment is to be split into three output segments, namely, OX03, OX04 and OX05 (blocks 903, 906 and 904, respectively, of FIG. 10). Output segment OX03 is a fixed length segment that contains the following fields: DEGREE, DEGREE NAME, UNIVERSITY and GRAD. DATE. The DEGREE field is the key field for this segment.

Output segment OX04, a child of output segment OX03, is a fixed length segment with the potential for twin segments and has the following fields: NAME, GRADE, CREDITS, JOB RELATED (a one-character YES/NO flag) and NOTES. The first three fields are contiguous in both the input and output segments so they may be grouped for mapping. NAME is the key field.

Output segment OX05 is a variable controlled segment containing the following fields: NO. CO. COURSES (a counter for the number of company courses) and COMPANY COURSES, which is a variably occurring field including sub-fields NAME, CODE, DATE and HOURS. The NAME and DATE are contiguous sub-fields in the input segment, but they are split and moved to non-contiguous output fields. (This requires that certain data be moved to temporary work areas before being moved to the output segment).

5. Input segment IX05 (block 805 of FIG. 9) is a variable uncontrolled segment (that is, there is a variably occurring area in the the segment not controlled by a counter) that contains these fields: RECRUITER NAME, INTERVIEW DATE, INTERNAL TRANSFER and PREVIOUS EMPLOYERS. The last field is variably occurring. This segment is not necessarily present upon transition. If it is, then in the output segment OX06, (block 905 of FIG. 10) only the PREVIOUS EMPLOYER data is to be stored in a variable uncontrolled segment. The RECRUITER NAME and INTERNAL TRANSFER data is merged into output segment OX01. The INTERVIEW DATE is to be discarded.

6. Input segment IX06 (block 806 in FIG. 9) is a fixed length segment. It contains JOB TITLES for the last three job classifications. This segment will be discarded in its entirety.

With this transitioning specification, the user is now in a position to supply the various components of information required by information source 100 of FIG. 1. If transition process 50 is executed entirely in a batch mode, the information may be supplied as a set of data and control cards that serve as input to the common software. Another procedure is for the user to supply the information interactively utilizing a display device to build the driver information of source 100 and then store this information off-line for later access by the common software. For the present example, the interactive mode is presumed and typical terminal display screens are depicted for illustrative purposes.

Input dictionary 120 is composed of a listing, in hierarchical order, of the required field entries from all input segments that are to be transitioned to the output database. The data arrangement of Table I depicts information, derived from the transitioning specification for input segment IX01, that defines the entry in input dictionary 120 for the root segment IX01.

                  TABLE I
    ______________________________________
    (INPUT 1)
    HUMONIC  FID     LH     TYPE  LL   COMMENT
    ______________________________________
    EMPC     IX0110   3     N,R   1    Employee Code
    NM       IX0120  25     C,L   1    Name
    SS#      IX0130   9     N,R   1    Social Security No.
    JOBF     IX0140  15     C,L   1    Job Function
    START    IX0150   6     M,L   1    Start Date
    ______________________________________

                  TABLE II
    ______________________________________
    (INPUT 2)
    HUMONIC  FID      LH     TYPE   LL   COMMENT
    ______________________________________
    STR      IX0210   20     C,L    1    Street
    CTY      IX0220   10     A,R    1    City
    ST       IX0230    2     C,L    1    State
    ZIP      IX0240    5     N,R    1    Zip
    PH       IX0250   12     N,R    1    Home Phone
    ______________________________________


              TABLE III
    ______________________________________
    (INPUT 3)
    HUMONIC  FID     LH     TYPE  LL   COMMENT
    ______________________________________
    GR       IX0310  10     N,R   1    Gross Pay
    FED      IX0320   8     N,R   1    Federal Tax
    FICA     IX0330   8     N,R   1    Social Security Tax
    SUI      IX0340   6     N,R   1    State Insurance
    NET      IX0350  10     N,R   1    Net Pay
    ______________________________________


                                  TABLE IV
    __________________________________________________________________________
    (INPUT 4)
                FID;
    HUMONIC FID LH CT  TYPE
                           LL COMMENTS
    __________________________________________________________________________
            IX0400     V      Variable Segment
            IX0401
                60 50         Control for C Crs.
            IX0402
                80 70         Control for A Crs.
    SLF     IX0410
                 2     B,R 1  Segment Length
    DEGREE  IX0420
                 3     A,L 1  Degree
    UNIV    IX0430
                20     A,L 1  University
    DATE    IX0440
                 6     M,R 1  Grad. Date
    #CC     IX0450
                 2     N,R 1  No. Co. Courses
            IX0460
                90         1  Co. Courses
    COCC    IX0461
                18     C,L    Name, Date
    #AC     IX0470
                 2     N,R 1  No. Acad. Courses
            IX0480
                69         1  Acad. Courses
    AOCC-JR IX0481
                23     C,L    Name, Grade, Credits
    __________________________________________________________________________

                  TABLE V
    ______________________________________
    (INPUT 5)
                     FID;
    HUMONIC  FID     LH     TYPE  LL   COMMENT
    ______________________________________
             IX0500         V          Variable Segment
             IX0509  50                Uncontrolled
    SLF      IX0510   2     B,R   1    Segment Length
    RNM      IX0520  20     A,L   1    Recruiter Name
    IDATE    IX0530   6     M,L   1    Interview Date
    TRANS    IX0540   1     A,R   1    Internal Transfer
             IX0550  100          1    Previous Employers
    EMDL     IX0551  20     A,L        Individ. Employers
    ______________________________________

                                      TABLE VI
    __________________________________________________________________________
    (OUTPUT 1)
    HUMONIC FID  LH TYPE
                        LL DF   COMMENTS
    __________________________________________________________________________
    SS#     OX01010
                 10 N,R 1       Soc. Sec. No. (key)
    EMPC    OX01020
                  3 N,R 1       Employee Code
    NM      OX01030
                 30 C,L 1       Name
    STR     OX01040
                 20 C,R 1       Street
    CITY    OX01050
                 15 A,R 1       City
    ST      OX01060
                  2 C,L 1       State
    ZIP     OX01070
                 10 N,R 1       Zip
    HPH     OX01080
                 12 N,R 1       Home Phone
    JOBF    OX01090
                 15 C,L 1       Job Function
    START   OX01100
                  6 M,L 1       Start Date
    RNM     OX01110
                 20 A,L 1       Recruiter Name
    TRANS   OX01120
                  1 A,R 1       Internal Transfer
    WPH     OX01130
                 12 N,R 1  (Blank)
                                Work Phone
    __________________________________________________________________________

                                      TABLE VII
    __________________________________________________________________________
    (OUTPUT 2)
    HUMONIC FID  LH  TYPE
                         LL DF  COMMENTS
    __________________________________________________________________________
    GR      OX0210
                 10  N,R 1      Gross Pay
    FED     OX0220
                 8   N,R 1      Federal Tax
    FICA    OX0230
                 8   N,R 1      Social Security Tax
    SUI     OX0240
                 8   N,R 1      State Insurance
    BONDS   OX0250
                 8   D,R 1  0.00
                                Bonds
    CONC    OX0260
                 8   D,R 1  0.00
                                Concession
    NET     OX0270
                 10  N,R 1      Net Pay
    __________________________________________________________________________


                                  TABLE VIII
    __________________________________________________________________________
    (OUTPUT 3)
    HUMONIC FID  LH  TYPE
                         LL  DF  COMMENTS
    __________________________________________________________________________
    DEGREE  OX0310
                  3  A,L 1       Degree (key)
    DEGREEN OX0320
                 25  A,L 1       Degree Name
    UNIV    OX0330
                 20  A,L 1       University
    DATE    OX0340
                  6  M,R 1       Grad. Date
    __________________________________________________________________________


                                  TABLE IX
    __________________________________________________________________________
    (OUTPUT 4)
    HUMONIC
           FID  LH TYPE
                       LL DF COMMENTS
    __________________________________________________________________________
    AOCC-JR
           OX0410
                23 C,L 1     Name (key), Grade, Credits
    JR     OX0420
                 1 A,L 1  Y  Job Related
    NOTES  OX0430
                40 C,L 1     Notes
    __________________________________________________________________________


                                  TABLE X
    __________________________________________________________________________
    (OUTPUT 5)
                FID;
    HUMONIC
           FID  LH CT TYPE
                          LL DF COMMENTS
    __________________________________________________________________________
           OX0500     V         Variable Segment
           OX0501
                30 20           Controlles
    SLF    OX0510
                 2    B,R 1     Segment Length
    #CC    OX0520
                 2    N,R 1     No. Co. Courses
           OX0530
                580       1     Co. Courses
    COCC   OX0531
                29    C,L       Name, Code, Date, Hr.
    __________________________________________________________________________


                                  TABLE XI
    __________________________________________________________________________
    (OUTPUT 6)
                 FID;
    HUMONIC FID  LH TYPE
                        LL DF COMMENTS
    __________________________________________________________________________
            OX0600  V         Variable Segment
            OX0609
                 20           Uncontrolled
    SLF     OX0610
                  2 B,R 1     Segment Length
            OX0620
                 180    1     Previous Employers
    EMPLI   OX0621
                 60 A,L       Individual Employers
    __________________________________________________________________________

                  TABLE XII
    ______________________________________
    (MAP 1)
    FROM (SEQ)   TO (SEQ)    OPTION   INFO
    ______________________________________
    EMPC         EMPC
    NM           NM
    SS#          SS#         D        EXD1
    JOBF         JOBF
    START        START
    ______________________________________

                  TABLE XIII
    ______________________________________
    (MAP 2)
    FROM (SEQ)    TO (SEQ)    OPTION   INFO
    ______________________________________
    STR           STR
    CTY           CTY
    ST            ST
    ZIP           ZIP
    PH            HPH
    ______________________________________


              TABLE XIV
    ______________________________________
    (MAP 3)
    FROM (SEQ)    TO (SEQ)    OPTION   INFO
    ______________________________________
    GR            GR
    FED           FED
    FICA          FICA
    SUI           SUI
    NET           NET
    ______________________________________


              TABLE XV
    ______________________________________
    (MAP 4)
    FROM (SEQ)   TO (SEQ)    OPTION   INFO
    ______________________________________
    DEGREE       DEGREE
    UNIV         UNIV
    DATE         DATE
    #CC          #CC         D        EXD2
    COCC (1)     INCC        D        EXD3
    COCC (2)     INCC        D        EXD3
    COCC (3)     INCC        D        EXD3
    COCC (4)     INCC        D        EXD3
    COCC (5)     INCC        D        EXD3
    AOCC-JR (1)  AOCC-JR     D        EXD4
    AOCC-JR (2)  AOCC-JR     D        EXD4
    AOCC-JR (3)  AOCC-JR     D        EXD4
    ______________________________________

                  TABLE XVI
    ______________________________________
    (TEMP)
                                              COM-
    HUMONIC  FID     LH      TYPE  LL   DF    MENTS
    ______________________________________
    INNM     EXT10   12      C,L   1          Name
    INDT     EXT20    6      M,L   1          Date
    INCC     EXT30   18      C,L   2
    ONM      EXT40   15      C,L   1          Name
    OCD      EXT50    5      C,L   1    XXX   Code
    ODT      EXT60    6      M,L   1          Date
    OHRS     EXT70    3      C,L   1    3     Hours
    OTCC     EXT80   29      C,L   2
    ______________________________________

                  TABLE XVII
    ______________________________________
    (MAP 5)
    FROM (SEQ)   TO (SEQ)    OPTION   INFO
    ______________________________________
    RNM          RNM
    TRANS        TRANS       D        EXD5
    EMPL (1)     EMPL (1)    D        EXD6
    EMPL (2)     EMPL (2)    D        EXD6
    EMPL (3)     EMPL (3)    D        EXD6
    EMPL (4)     EMPL (4)    D        EXD6
    EMPL (5)     EMPL (5)    D        EXD6
    ______________________________________

                  TABLE XVIII
    ______________________________________
    (DERIVATION 1-EXD1)
    TARGET          OPER    OPTION
    ______________________________________
    OX01                    KR
    ______________________________________

                  TABLE XIX
    ______________________________________
    (DERIVATION 2-EXD2)
    TARGET         OPER        OPTION
    ______________________________________
    OX03                       KR
    OX03, OX02                 UN
    OX05           AOCC-JR, IX05
                               US
    OX05, OX01     IX01        US
    OX06, OX05, OX01           *
    ______________________________________

                  TABLE XX
    ______________________________________
    (DERIVATION 3-EXD3)
    TARGET         OPER        OPTION
    ______________________________________
    ONM            INNM        I
    ODT            INDT        I
    COCC (x)       OTCC        I
    OX05           AOCC-JR, IX05
                               US
    OX05, OX01     IX01        US
    OX06, OX05, OX01           *
    ______________________________________

                  TABLE XXI
    ______________________________________
    (DERIVATION 4-EXD4)
    TARGET           OPER    OPTION
    ______________________________________
    OX04                     KR
    OX04                     UN
    OX01             IX01    US
    OX06, OX05, OX01         *
    ______________________________________


              TABLE XXII
    ______________________________________
    (DERIVATION 5-EXD5)
    TARGET          OPER    OPTION
    ______________________________________
    OX01                UN
    ______________________________________


              TABLE XXIII
    ______________________________________
    DERIVATION 6-EXD6)
    TARGET            OPER    OPTION
    ______________________________________
    OX06              IX01    US
    OX06, OX05, OX01          *
    ______________________________________

• Inventors
  Alexander, Jr., Everett L.; Carlin, Allan R.; Fiore, Alice L.; Mackiewicz, Walter A.;
• Assignee
  Bell Communications Research, Inc. (Livingston, NJ)
• Published
  Mar-13-1990
• Current US Classes:
  707/101
• Application #
  147319
• International Classes
  G06F 015/40
• Field of Search
  364/200
• Examiner
  Anderson; Lawrence E.
• Agent
  Falk; James W., Peoples; John T.