Abstract: The object of the present invention is to analyze association relationships between data items and processes being used in an existing system. By analyzing a program or the like, the type and numbers of access instructions to data items in each step of the program is examined (step 13). Then, data item association degree is calculated from the type of access instruction etc., and the values of the association degree are corrected using system requirements etc (step 15 and step 17). Processes having high association degrees are collected together by referencing the corrected valves of the association degree (step 21). Based on the groups of collected processes, process division and data item partitioning is performed (step 23). Interfaces between processes are then displayed based on divided processes and partitioned data items (step 25).

Abstract: A data migration system that enables a database system to migrate from a network data model to a relational data model in a short development time, without degradation in data integrity. A record migration unit creates target records for the relational data model. The records are arranged in the same way as they originally were in the network data model before data migration has been made. A primary key addition unit then adds a primary key to each of the target records so that they can be uniquely identified. To preserve the original parent-child relationships between records, a relation key addition unit selects each child record from among the target records, identifies the parent of the child record by referring to the pointers added to corresponding source records, and gives a value of the primary key of the parent record to the child record as a relation key thereof.