GB2351167A

GB2351167A - Obtaining the difference between tree structure data

Info

Publication number: GB2351167A
Application number: GB0003250A
Authority: GB
Inventors: Keisuke Torigoe; Masaharu Yoshizawa
Original assignee: NEC Corp
Current assignee: NEC Corp
Priority date: 1999-02-12
Filing date: 2000-02-11
Publication date: 2000-12-20
Anticipated expiration: 2020-02-11
Also published as: CN1263313A; JP2000231506A; CN1126042C; GB0003250D0; GB2351167B; JP3390357B2

Abstract

A tree structure data editing apparatus includes an output unit, a data base (1, 2), a differential tree structure data producing section (3) and an output control section (5). The data base stores first and second tree structure data respectively having first and second tree structures in which tree nodes are hierarchically provided. The differential tree structure data producing section compares the first and second tree structure data for every tree node, and produces a differential tree structure data hierarchically indicative of a difference between the first and second tree structure data in structure. The output control section analyzes the differential tree structure data, and controls the output unit to output a differential output between the first and second tree structure data based on the analyzing result.

Description

2351167 METHOD AND APPARATUS FOR OUTPUTTING THE DIFFERENCE BETWEEN TREE

STRUCTURE DATA The present invention relates to a method and apparatus for outputting the difference between the data of tree structures.' A previously proposed tree structure data editing apparatus is known in which the data of a data structure which is stored in a memory is read out and displayed on a display unit. In such a previously proposed data editing apparatus, the tree structure data is dynamically built to have a plurality of unit data as nodes of a tree structure in a memory from the highest layer in response to a menu inquiry. In the unit data, a hierarchical link condition is defined. The tree structure data built in the memory is complicated. Generally, a function is provided to output and display the tree structure data such that a user can recognize the building state of the tree structure data.

However, no function is provided to output the difference between the data of the two tree structures such that the user can recognise it visibly. For this reason, the user is required to compare the data of the two tree structures by monitoring each of them and recognising any difference between the data of the two tree structures. In case of a large-scale and complicated data structure, it is a difficult and complex matter to detect the difference.

In conjunction with the above description, a difference display

2 apparatus is disclosed in Japanese Laid Open Patent application (JPAHeisei 9-128437). In this proposal, storage means stores graphic data and logic data. Read means reads out the graphic data and the logic data from the storage means. Data editing means edits the read graphic data and the read logic data. Data storage means reflects the edited graphic data and the edited logic data for the graphic data and the logic data stored in the storage means. Deference acquisition means acquires the differences between the graphic data and the logic data stored in the storage means and the edited graphic data and the edited logic data. Display means changes the display attribute of the difference to display the graphic data. Thus, graphic data indicative of a design diagram after and before a design change can be displayed. For example, in this previous proposal, a netlist 1 and a netlist 2 are compared first in units of parts and then in unit of pins so as to produce a difference data list.

Also, a book information display apparatus is disclosed in Japanese Laid Open Patent application (JP-A-Heisei 9-212513). In this previous proposal, data input from a data inputting section (14) by users and stored in a data storage section (12) are shared by the users. An access frequency counts section (16) counts the number of accesses to target data through a data selecting section (11) by the users, compares the count with a threshold value to extract representative data of the target data, and stores the representative data in a temporary storage sedion (17). A determining section (18) determines the structure of a data associated with the representative data. A book data synthesizing section (22) is started by a 3 timer (20) and synthesizes book frame data and the representative data structure to produce a book data. A book data display section 23 displays the book data.

Also, a data storage method having a hierarchy structure is disclosed in Japanese Laid Open Patent application (JP-A-Heisei 6-202948). In this disclosure, a data (object) hierarchically represents a structure (class) in an object oriented programming. An example produced in accordance with a hierarchically defined class has data for all classes higher than the class.

When in such an example, data stored in a main storage unit (1) is transferred into an external storage unit (4), an object dividing/synthesizing section (2) and a record managing section (3) only the difference between layers in the external storage unit 4 is stored, to prevent any influence of a class in a layer upon classes in lower layers. The object dividing/ synthesizing section (2) and the record managing section (3) stores an]D to identify an object and an ID to identify a class in the external storage unit 4 together with the data defined in the class to facilitate a change of the definition of the class.

Also, an information searching apparatus is disclosed in Japanese Laid Open Patent application (JP-A-Heisei 7-36924). In this disclosure, the classification of a search object is input from a classification menu selecting section (2) and a path is extracted by a path extracting section (413) based on the input classification. A key word is input from a search character string inputting section (3). Information is searched from a data base (5) based on the inputted key word and the extracted path. A calculating 4 section (4E) detects the number of data searched. A determining section (41D) determines a specific pattern having gradation corresponding to the detected number of data searched. A display section 6 displays the specific pattern in a region corresponding to classification as a search object in response to a display instruction from a tree structure management section 4A.

Features of arrangements to be described below, by way of example in illustration of the present invention are that the difference in structure is determined between two structure data and a tree structure data editing apparatus, that the difference can be output in a visibly recognizable form, and that there is a recording medium having a program for the method of determining the difference in structure between two structure data and a tree structure data editing apparatus, and/or the method in which the above difference is output in a visibly recognizable form.

In one particular arrangement illustrative of the present invention, a tree structure data editing apparatus includes an output unit, a data base, a differential tree structure data producing section and an output control section. The data base stores first and second tree structure data respectively having first and second tree structures in which tree nodes are hierarchically provided. The differential tree structure data producing section compares the first and second tree structure data for every tree node, and produces a differential tree structure data hierarchically indicative of a difference between the first and second tree structure data in structure. The output control section analyzes the differential tree structure data, and controls the output unit to output a differential output between the first and second tree structure data based on the analyzing result.

In this case, the differential tree structure data producing section may include a common tree node comparing section, a leaf type tree node comparing section, an alternate selection type tree node comparing section, a structural type tree node comparing section, a link type tree node comparing section and a control section. The common tree node comparing section makes a comparison in order to determine whether a first selected node of the first tree structure and a node of the second tree structure correspond to the first selected node as a second selected node having the same type. Also, the common tree node comparing section produces leaf type differential data to add to a differential tree structure data when the first selected node and the corresponding node have different types. The leaf type tree node comparing section compares the first selected node and the second selected node and produces leaf type differential data based on the first and second selected nodes to add to the differential tree structure data.

The alternate selection type tree node comparing section compares the first selected node and the second selected node and produces one of a leaf type differential data and an alternate selection type differential data based on the first and second selected nodes to add to the differential tree structure data. The structural type tree node comparing section compares the first selected node and the second selected node and produces one of a leaf type differential data and a structural type differential data based on the first and second selected nodes to add to the differential tree structure data.

6 The link type tree node comparing section compares the first selected node and the second selected node and produces one of a leaf type differential data and a link type differential data based on the first and second selected nodes to add to the differential tree structure data. The control section sequentially selects the tree nodes of the first tree structure one by one as the first selected tree node from the highest layer tree node in response to a comparison start instruction, and starts the common tree node comparing section for the first selected tree node. Also, the control section starts the leaf type tree node comparing section, the afternate selection type tree node comparing section, the structural type tree node comparing section, and the link type tree node comparing section based on the type of the first selected tree node, when it is determined by the common tree node comparing section that the first selected node and the second selected node have the same type.

Also, it is desirable that each of the common tree node comparing section, the leaf type tree node comparing section, the alternate selection type tree node comparing section, the structural type tree node comparing section, and the link type tree node comparing section return a correspondence ratio value to the control section when a process of the each comparing section is ended. At this time, the control section may stop the sequential selection of the tree nodes for a tree portion including the first selected tree node, when the returned correspondence ratio value is lower than a threshold value, and may start the sequential selection of the tree nodes for another tree portion.

7 In this case, the common tree node comparing section desirably returns a first value as the correspondence ratio value when the first and second selected tree nodes are different in type.

Also, the leaf type tree node comparing section desirably returns a first value as the correspondence ratio value when the first and second selected tree nodes are different from each other and a second value as the correspondence ratio value when the first and second selected tree nodes are the same.

Also, the alternate selection type tree node comparing section desirably returns a first value return as the correspondence ratio value when a lower layer tree portion of the first tree structure data than the first selected tree node is different from a lower layer tree portion of the second tree structure data than the second selected tree node, a second value as the correspondence ratio value when the lower layer tree portion of the first tree structure data than the first selected tree node is the same as the lower layer tree portion of the second tree structure data than the second selected tree node, and an average of the correspondence ratio values which are returned from members of the lower layer tree portion of the first tree structure data than the first selected tree node when the lower layer tree portion of the first tree structure data than the first selected tree node is partially the same as the lower layer tree portion of the second tree structure data than the second selected tree node.

Also, the structural type tree node comparing section desirably returns a first value as the correspondence ratio value when members of a lower 8 layer tree portion of the first tree structure data than the first selected tree node are different from those of a lower layer tree portion of the second tree structure data than the second selected tree node, a second value as the correspondence ratio value when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are the same as those of the lower layer tree portion of the second tree structure data then the second selected tree node, and an average of the correspondence ratio values which are returned from the members of the lower layer tree portion of the first tree structure data than the first selected tree node when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are partially the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node.

Also, the link type tree node comparing section desirably returns a first value as the correspondence ratio value when members of a lower layer tree portion of the first tree structure data than the first selected tree node are different from those of a lower layer tree portion of the second tree structure data than the second selected tree node, a second value as the correspondence ratio value when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node, and an average of the correspondence ratio values which are returned from the members of the lower layer tree portion of the first tree structure data than the first selected 9 tree node when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are partially the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node.

There will also be described below, by way of example in illustration of the present invention a method of forming a differential output which includes producing a differential tree structure data hierarchically indicative of a difference between first and second tree structure data in structure through the comparison of the first and second tree structure data for each of the tree nodes, the first and second tree structure data respectively having first and second tree structures in which the tree nodes are hierarchically provided, analyzing the differential tree structure data, and outputting a differential output between the first and second tree structure data based on the analyzed result.

In the above method, a first comparison is carried out to determine whether a first selected node of the first tree structure and a node of the second tree structure corresponding to the first selected node as a second selected node having a same type, to produce a leaf type differential data to add to the differential tree structure data when the first selected node and the corresponding node have different types. Also, a second comparison of the first selected node and the second selected node is carried out to produce a leaf type differential data based on the first and second selected nodes to add to the differential tree structure data. Also, a third comparison of the first selected node and the second selected node is carried out to produce one of a leaf type differential data and an alternate selection type differential data based on the first and second selected nodes to add to the differential tree structure data. Also, a fourth comparison of the first selected node and the second selected node is carried out to produce one of a leaf type differential data and a structural type differential data based on the first and second selected nodes to add to the differential tree structure data. Also, a fifth comparison of the first selected node and the second selected node is carried out to produce one of a leaf type differential data and a link type differential data based on the first and second selected nodes to add to the differential tree structure data. The tree nodes of the first tree structure are sequentially selected one by one as the first selected tree node from the highest layer tree node in response to a comparison start instruction to start the first comparison. One of the second to fifth comparisons is started based on the type of the first selected node when it is determined in the first comparison that the first selected node and the second selected node have the same type.

In this case, it is desirable that a correspondence ratio value is returned when each of the first comparison to the fifth comparison is ended.

In this case, the sequential selection of the tree nodes for a tree portion including the first selected tree node is stopped, when the returned correspondence ratio value is lower than a threshold value, and the sequential selection of the tree nodes for another tree portion is started.

Here, it is desirable in the first comparison to return a first value as the correspondence ratio value when the first and second selected tree nodes are different in the type.

Also, it is desirable in the second comparison to return a first value as the correspondence ratio value when the first and second selected tree nodes are different from each other, and to return a second value as the correspondence ratio value when the first and second selected tree nodes are the same.

Also, it is desirable in the third comparison to return a first value return as the correspondence ratio value when a lower layer tree portion of the first tree structure data than the first selected tree node is different from a lower layer tree portion of the second tree structure data than the second selected tree node, to return a second value as the correspondence ratio value when the lower layer tree portion of the first tree structure data than the first selected tree node is the same as the lower layer tree portion of the second tree structure data than the second selected tree node, and to return an average of the correspondence ratio values which are returned from members of the lower layer tree portion of the first tree structure data than the first selected tree node when the lower layer tree portion of the first tree structure data than the first selected tree node is partially the same as the lower layer tree portion of the second tree structure data than the second selected tree node.

Also, it is desirable in the fourth comparison to return a first value as the correspondence ratio value when members of a lower layer tree portion of the first tree structure data than the first selected tree node are different from those of a lower layer tree portion of the second tree structure data 12 than the second selected tree node, to return a second value as the correspondence ratio value when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node, and to return an average of the correspondence ratio values which are returned from the members of the lower layer tree portion of the first tree structure data than the first selected tree node when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are partially the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node.

Also, it is desirable in the fifth comparison to return a first value as the correspondence ratio value when members of a lower layer tree portion of the first tree structure data than the first selected tree node are different from those of a lower layer tree portion of the second tree structure data than the second selected tree node, to return a second value as the correspondence ratio value when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node, and to return an average of the correspondence ratio values which are returned from the members of the lower layer tree portion of the first tree structure data than the first selected tree node when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are partially the same as those of the lower layer 13 tree portion of the second tree structure data than the second selected tree node.

In another arrangement to be described, by way of example in illustration of the present invention, there is a recording medium in which a program is stored for carrying out a method of forming a differential output, which method includes producing a differential tree structure data hierarchically indicative of a difference between first and second tree structure data in structure through comparison of the first and second tree structure data for each of a plurality of tree nodes, the first and second tree structure data respectively having first and second tree structures in which the tree nodes are hierarchically provided, analyzing the differential tree structure data, and outputting a differential output between the first and second tree structure data based on the result of the analysis.

This method desirably includes carrying a first comparison to determine whether a first selected node of the first tree structure and a node of the second tree structure corresponding to the first selected node as a second selected node have the same type, in order to produce leaf type differential data to add to the differential tree structure data when the first selected node and the corresponding node have different types, carrying a second comparison of the first selected node and the second selected node to produce leaf type differential data based on the first and second selected nodes to add to the differential tree structure data, carrying a third comparison of the first selected node and the second selected node to produce one of leaf type differential data and an alternate selection type 14 differential data based on the first and second selected nodes to add to the differential tree structure data, carrying a fourth comparison of the first selected node and the second selected node to produce one of a leaf type differential data and a structural type differential data based on the first and second selected nodes to add to the differential tree structure data, carrying a fifth comparison of the first selected node and the second selected node to produce one of a leaf type differential data and a link type differential data based on the first and second selected nodes to add to the differential tree structure data, sequentially selecting the tree nodes of the first tree structure one by one and the first selected tree node from the highest layer tree node in response to a comparison start instruction to start the first comparison, and starting one of the second to fifth comparisons, based on the type of the first selected node when it is determined in the first comparison that the first selected node and the second selected node have the same type.

Also, each of the first comparison to the fifth comparison desirably includes returning a correspondence ratio value when each of the first comparison to the fifth comparison is ended. In this case, the sequential selection includes stopping the sequential selection of the tree nodes for a tree portion including the first selected tree node, when the returned correspondence ratio value is lower than a threshold value, and starting the sequential selection of the tree nodes for another tree portion.

The following description and drawings disclose, by means of examples, the invention which is defined in the appended claims, whose terms determine the extent of the protection conferred hereby.

In the drawings:

Fig. 1 is a block schematic diagram of a tree structure data editing apparatus, Fig. 2 is a diagram for use in describing the processing of a common tree node comparing section in the tree structure data editing apparatus of Fig. 1, Fig. 3 is a flow chart for use in describing the processing of a leaf type tree node comparing section, Fig. 4 is a flow chart for use in describing the processing of an alternate selection type tree node comparing section, Fig. 5 is a flow chart for use in describing the processing of a structural type tree node comparing section, Fig. 6 is a flow chart for use in describing the processing of a link type tree node comparing section, is Fig. 7 is a diagram showing a leaf type differential data structure, Fig. 8 is a diagram showing an alternate selection type differential data structure, Fig. 9 is a diagram showing a structural type differential data structure, Fig. 10 is a diagram showing a link type differential data structure, Fig. 11 is a schematic diagram showing an example of tree structure data 1, Fig. 12 is a schematic diagram showing an example of tree structure data 2, 16 Fig. 13 is a block schematic diagram showing a differential data structure between the tree structure data 1 and the tree structure data 2, Fig. 14 is a chart showing the output resuft of the tree structure data 1 ' Fig. 15 is a chart showing the output result of the tree structure data 2, and Fig. 16 is a chart for use in describing the differential output result between the tree structure data 1 and 2.

Referring to Fig. 1, there is shown a tree structure data editing apparatus which includes data bases 1 and 2, a differential tree structure data producing section 3, an output control section 5 and an output unit 6.

The data bases 1 and 2 store a tree structure data 1 and a tree structure data 2, respectively. The tree structure data 1 and the tree structure data 2 have nodes of the tree structure, and a node includes a unit data in which a hierarchical connection condition is defined. The tree structure data 1 and the tree structure data 2 can be dynamically built in the data bases 1 and 2. That is, each of the tree structure data 1 and tree structure data 2 is a storage unit as a file.

The data type in a node of the tree structure is classified into a leaf type, an alternate selection type, a structural type, and a link type. The leaf type tree node is a node having no lower layer tree portion. The alternate selection type tree node is a node in which only one is selected from among a plurality of selection branches or tree portions. The structural type tree node is a node having members in the lower layers. The link type tree node 17 is a node having members of an unspecified number in the lower layers.

The differential tree structure data producing section 3 compares the tree structure data 1 and the tree structure data 2 for every tree node and produces a hierarchical differential tree structure data 4. The differential tree structure data producing section 3 is composed of a common tree node comparing section 30, a leaf type tree node comparing section 40, an alternate selection type tree node comparing section 50, a structural type tree node comparing section 60, a link type tree node comparing section 70, and a control section (not shown).

The differential tree structure data producing section 3 carries out the forming of the hierarchical differential tree structure data, the calculation of a correspondence ratio value indicative of a ratio of correspondence between the tree nodes and the forming of a differential data. The correspondence ratio value takes a value from "0" to "100". "0" indicates a full non coincidence and "Il 00" indicates full coincidence. The tree node such as the leaf type tree node does not have any tree node in the lower layer, and returns "0" or "100" as the correspondence ratio value. In the case that there are a plurality of members in the lower layers as in the structural type tree node and the link type tree node, the tree node returns an average of correspondence ratio values returned from the members as the correspondence ratio value of the tree node.

The output control unit 5 analyzes the differential tree structure data 4, carries out the determination of no difference, deletion, addition, change and so on, and controls an output unit to visibly output a differential output 6.

18 Referring to Fig. 2, the control section supplies two tree nodes of the tree structure data 1 and the tree structure data 2 to the differentialtree structure data producing section 3 in response to a differential output producing instruction. At this time, the control section sequentially selects the tree nodes from each of the tree structure data 1 and the tree structure data 2 one by one. The common tree node comparing section 30 determines whether or not the supplied tree nodes are of the same type. When the types are different, the common tree node comparing section 30 forms a leaf type differential data and returns the correspondence ratio value of "0" to the control section. When the types of the supplied tree nodes are coincident with each other, the common tree node comparing section 30 transfers the control to the control section. The control section starts one of the leaf type tree node comparing section 40, the alternate selection type tree node comparing section 50, the structural type tree node comparing section 60, and the link type tree node comparing section 70 based on the type of the tree nodes.

Fig. 3 is a flow chart showing the processing of the leaf type tree node comparing section 40. The leaf type tree node comparing section 40 compares the two input leaf type tree nodes (Steps 41 and 42). When the tree nodes are the same, the correspondence ratio value of H100" is returned to the control section (Step 43). Also, when the tree nodes are different from each other, the leaf type tree node comparing section 40 forms a leaf type differential data as a basic type differential data and adds to the already produced differential tree structure data. Also, the leaf type tree node 19 comparing section 40 returns the correspondence ratio value of V' to the control section (Step 44).

Fig. 4 is a flow chart showing the processing of the alternate selection type tree node comparing section 50. Two alternate selection type tree nodes are input (Step 51), and it is determined whether the tree node portions as branches in the lower layer than the input tree nodes are the same (Step 52). When the tree node portions are different, the alternate selection type tree node comparing section 50 forms a leaf type differential data and adds it to the differential tree structure data. Also, the alternate selection type tree node comparing section 50 returns the correspondence ratio value of V' to the control section (Step 53). When the tree node portions are the same, members of the tree node portions are compared (Step 54). The comparison of the members is carded out by the common tree node comparing section 30 under the control of the control section.

When there is no difference between the members, the correspondence ratio value of M OW is returned to the control section (Step 56). When there is a difference between the members, the differential data which has been returned as the result of the comparison of the members is linked to the alternate selection type differential data in order to form the alternate selection type differential data. The alternate selection type tree node comparing section 32 returns a value returned from the members as the correspondence ratio value to the control section.

Fig. 5 is a flow chart showing the processing of a structural type tree node comparing section 60. First, the structural type tree node comparing section 60 inputs two structural type tree nodes (Step 61), and compares them for each of members (Step 62). The comparison of members is carded out by the common tree node comparing section 30 under the control of the control section. When all the members are coincident with each other (Step 63), the correspondence ratio values of '100" are returned from the respective members and then the correspondence ratio value of M00" is returned to the control section (Step 64). When all the members are different from each other (Step 65), correspondence ratio values of 'V are returned from the respective members, and then the correspondence ratio value of 'V is returned to the control section. Also, a leaf type differential data is formed and added to the already produced differential tree structure data (Step 66). Otherwise, because there is a difference between the members in part, the differential data which are returned from each of the members is linked in order to form a structural type differential data (Step 67). In this case, an average of the correspondence ratio values returned from the respective members is returned as the correspondence ratio value to the control section.

Fig. 6 is a flow chart showing the processing of a link type tree node comparing section 70. First, two link type tree nodes are input (Step 71).

Then, the correspondence ratio value of each of the members is calculated and correspondence tables are produced (Step 72). Thus, the pairs of the most corresponding tree nodes are produced. When there is no corresponding member (Step 73), a leaf type differential data is formed and added to the already produced differential tree structure data. Also, the 21 correspondence ratio value of V' is returned to the control section (Step 74). When there is at least a corresponding member, the corresponding tree portions are compared (Step 75). When all the lower layer members are coincident with each other (Step 76), the correspondence ratio values of M 00" are returned from the respective members, and the correspondence ratio value of '100" is returned to the control section. When a part of the members is different (Step 76), a link type differential data is formed and added to the already produced differential tree structure data. Also, an average of the correspondence ratio values returned from the respective members is returned as the correspondence ratio value to the control section.

Fig. 11 and Fig. 12 are diagrams showing examples of the tree structure data 1 and 2 which are dynamically built in the data bases 1 and 2 by the tree structure data editing apparatus. In Figs. 11 and 12, the nodes shown by the double line are of the link type. It is supposed that each of the tree nodes has a data for distinguishing a type of its own data structure, and a data indicative of a connection relation of its own node.

The control section reads out one tree node of each of the tree structure data 1 and 2 from the data base 1 or 2. The control section supplies the read out tree nodes to the differential tree structure data producing section 3. The differential tree structure data producing section 3 builds the differential data structure shown in Fig. 13 in the memory.

At this time, the common tree node comparison processing section 30 in the producing section 3 compares the tree nodes tl and sl. Since the 22 tree nodes tl and sl are of the link type, the link type tree node comparing section 70 is started by the control section. The comparing section 70 cardes out the process shown in Fig. 6 to produce corresponding tables d12-11; d3-11; and d4-1, and d2-2; d3-2; and d14-2. It is determined at the step 73 that there is no correspondence between the tree nodes t3 and s3. Also, it is determined at the step 76 that there are correspondences between t2 and s2 and between M and s4. Therefore, the link type differential data structure c12-11; c13-11; and d4-1, and d2-2; c13-2; and d14-2 are formed. In this case, NULLs are set for d13-1 and d3-2.

Next, the common tree node comparison processing section 30 compares the tree nodes s2 and t2. Since the tree nodes s2 and t2 are of the structural type, the structural type tree node comparing section 60 is started to carry out the process shown in Fig. 5. Thus, a structural type differential tree structure is formed. In this example, since the tree node t2 and the tree node s2 are the same in the tree nodes t5 and s5 and % and s6, NULLs are set for d15 and d16.

Next, the common tree node compadson processing section 30 compares the tree nodes s14 and t14, since the tree nodes s2 and t2 are different in the lower layers. Since the tree nodes s11 4 and tl 4 are of the link type, the link type tree node comparing section 70 is started to carry out the process shown in Fig. 6. Thus, a link type differential tree structure is formed. In this example, since there is a correspondence between the tree node tl 7 and the tree node sl 7, the tree node tl 7 and the tree node s11 7 are paired. However, there is no correspondence of the tree node s18, and 23 the NULL is set for dl 8-2.

Next, the common tree node comparison processing section 30 compares the tree nodes s4 and M. Since the tree nodes s4 and t4 are of the structural type, the structural type tree node comparing section 60 is started to carry out the process shown in Fig. 5. Thus, a structural type differential tree structure is formed. In this example, since the tree node tl 1 and the lower layer nodes and the tree node sl 1 and the, lower layer nodes are the same. In this case the NULL is set for dl 1. Also, since the tree node tl 3 and its lower layer nodes and the tree node sl 3 and its lower layer nodes are the same, the NULL is set for dl 3. Also, the tree node sl 2 corresponds to the tree node tl 2 but a leaf node of 'W and a leaf node of OY" are different. Therefore, a leaf type differential tree structure is added.

In this way, the differential tree structure data 4 is obtained. It should be noted that in the above comparing process, the comparison of the two tree nodes means the comparison between one of the tree nodes and its lower layer nodes and the other tree node and its lower layer nodes.

Next, the differential data structure will be described. 111 The leaf type differential data structure Fig. 7 shows the leaf type differential data structure. The differential class is the leaf type. The leaf type differential data structure is used, when there is a difference between the alternate selection type tree node portions 1 and 2, when the leaf type tree nodes 1 and 2 are not coincident with each other, when all the members are different between the structural type tree node portions 1 and 2, and when all the members are different between the 24 link type tree node portions 1 and 2. The leaf type differential data structure means that the tree structure in the lower layers than the highest layer node 1 in the tree node portion 1 is entirely changed into the tree structure in the lower layers than the highest layer node 2 in the tree node portion 2. 5 [21 The alternate selection type differential data structure.

Fig. 8 shows the alternate selection type differential data structure. The differential class is an alternate selection type. It is used when nodes respectively selected from the alternate selection type tree nodes 1 and 2 are coincident with each other and there is a difference in the lower layers than the selected nodes. The differential data is the difference between the altemate selection type tree nodes 1 and 2. [31 The structural type differential data structure.

Fig. 9 shows a structural type differential data structure. The differential class is a structural type. It is used when there is a difference partially between the structural type tree node portions 1 and 2 in a lower layer member. The highest layer nodes 1 and 2 of the structural type tree node portions 1 and 2 are nodes 1 and 2. NULL differential data means that the members are coincident with each other. If there is a difference between the structural type tree nodes 1 and 2 in the member, the differential data is linked. [4] The link type differential data structure.

Fig. 10 shows a link type differential data structure. The differential class is a link type. The link type differential data structure is used when there is a difference partially between the lower layer members of the link tree node portions 1 and 2. NULL differential data in the correspondence table of the node portion 1 means that the member is deleted. NULL differential data in the correspondence table of the node portion 2 means that the member is added. There is a case where the differential data indicates a correspondence relation between the correspondence tables of the node portions 1 and 2 and the differential data is not NULL. This means that there is a difference in the lower layers. When the differential data indicates a correspondence relation between the correspondence tables of the node portion 1 and 2. NULL differential data means that the node portions 1 and 2 are coincident with each other.

Next, the control operation of the output control unit 5 will be described in accordance with a specific example. It is supposed that the members of the structural type tree node are represented by use of the symbols of "[' and]" and that the members of the link type tree node are represented by use of the symbols of "{" and "}".

If the above-mentioned notions are used for the tree structure data 1 of Fig. 11, the structure output of Fig. 14 is obtained. Also, in case of the tree structure data 2 of Fig. 12, the structure output of Fig. 15 is obtained.

In order to obtain the differential output, the tree structure is traced from the differential node dl of Fig. 13 to the right hand side.

The link type differential elements d2-1 and d2-2 correspond to each other and have a structural type differential data in the lower layers. The structural type differential element d5 is NULL and the structural type differential element d6 is also NULL. That is, the tree structure in the lower 26 layers than the node t5 is equal to the tree structure in the lower layers than the node s5. Also, the tree structure in the lower layers than the node t6 is equal to the tree structure in the lower layers than the node s& The tree node d7 of Fig. 13 has a link type differential tree structure in the lower layer. The link type differential element dl 7-1 corresponds to the link type differential element d17-2 and there is no differential data in the lower layers. That is, the tree structure in the lower layer than the node tl 7 is equal to the tree structure in the lower layers than the node s17. Moreover. the link type differential element d18-2 is NULL. In other words, the tree structure in the lower layers than the node sl 8 is an addition.

Because the link type differential element d3A is NULL, the node t3 and its lower layer nodes are a deletion. Also, because the link type differential element W-2 is NULL, the node s3 and its lower layer nodes are an addition.

The link type differential element d4-1 corresponds to the link type differential element d4-2 and there is a structural type differential tree structure in the lower layers. The structural type differential element dl 1 is NULL. That is, the tree structure in the lower layers than the tree node tl 1 is equal to the tree structure in the lower layers than the tree node sl 1. The structural type differential element d12 means a leaf type differential data. in other words, the tree structure in the lower layer than the node t12 is quite different from the tree structure in the lower layer than the node s12. The structural type differential element d13 is NULL. The tree structure in the lower layers than the node t13 is equal to the tree structure in the lower than 27 the node s13.

The output control unit 5 outputs the differential output shown in Fig.

16 in consideration of the above matters.

In arrangement described by way of example in illustration of the present invention, the matching of the members is checked using the correspondence ratio values, in case of the comparison of the tree structures. However, when the predise matching is not necessary, the minimum of correspondence ratio value may be predetermined. In this case, if the correspondence ratio value is smaller than the minimum value, the check of the correspondence in the further lower layers may be not carded out. In this case, the deletion and the addition of the members are carried out.

Also, a program for the above method may be stored in a recording medium.

As described above, in illustration of the present invention, when the difference between two tree structure data is to be recognized, the differential tree structure and the differential tree structure list are automatically visibly outputted, also it is possible to specify a part of the tree structure data to be edited, and to apply an application to history management when an edition result is managed as a file.

It will be understood that, although particular arrangements have been described, by way of example in illustration of the invention, variations and modifications thereof, as well as other arrangements may be conceived within the scope of the protection sought by the appended claims.

Claims

28 CLAIMS

1 A tree structure data editing apparatus including an output unit, a data base storing first and second tree structure data respectively having first and second tree structures in which tree nodes are hierarchically provided, a differential tree structure data producing section comparing the first and second tree structure data for every tree node, and producing a differential tree structure data hierarchically indicative of a difference between the first and second tree structure data in structure, and an output control section analyzing the differential tree structure data, and controlling the output unit to output a differential output between the first and second tree structure data based on the analyzing result.

2. A tree structure data editing apparatus as claimed in claim 1, wherein the differential tree structure data producing section includes a common tree node comparing section comparing to determine whether a first selected node of the first tree structure and a node of the second tree structure corresponding to the first selected node as a second selected node have a same type, and producing a leaf type differential data to add to a differential tree structure data when the first selected node and the corresponding node have different types, a leaf type tree node comparing section comparing the first selected node and the second selected node and producing a leaf type differential data based on the first and second selected nodes to add to the differential tree structure data, an alternate selection 29 type tree node comparing section comparing the first selected node and the second selected node and producing one of a leaf type differential data and an alternate selection type differential data based on the first and second selected nodes to add to the differential tree structure data, a structural type tree node comparing section comparing the first selected node and the second selected node and producing one of a leaf type differential data and a structural type differential data based on the first and second selected nodes to add to the differential tree structure data, a link type tree node comparing section comparing the first selected node and the second selected node and producing one of a leaf type differential data and a link type differential data based on the first and second selected nodes to add to the differential tree structure data, and a control section sequentially selecting the tree nodes of the first tree structure one by one as the first selected tree node from the highest layer tree node in response to a comparison start instruction, starting the common tree node comparing section for the first selected tree node, and starting the leaf type tree node comparing section, the alternate selection type tree node comparing section, the structural type tree node comparing section, and the link type tree node comparing section based on the type of the first selected tree node, when it is determined by the common tree node comparing section that the first selected node and the second selected node have the same type.

3. A tree structure data editing apparatus as claimed in claim 2, wherein each of the common tree node comparing section, the leaf type tree node comparing section, the alternate selection type tree node comparing section, the structural type tree node comparing section, and the link type tree node comparing section returns a correspondence ratio value to the control section when a process of each comparing section is ended.

4. A tree structure data editing apparatus as claimed in claim 3, wherein the control section stops the sequential selection of the tree nodes for a tree portion including the first selected tree node, when the returned correspondence ratio value is lower than a threshold value, and starts the sequential selection of the tree nodes for another tree portion.

5. A tree structure data editing apparatus as claimed in claim 3, wherein the common tree node comparing section returns a first value as the correspondence ratio value when the first and second selected tree nodes are different in the type.

6. A tree structure data editing apparatus as claimed in claim 3, wherein the leaf type tree node comparing section returns a first value as the correspondence ratio value when the first and second selected tree nodes are different from each other and a second value as the correspondence ratio value when the first and second selected tree nodes are the same.

7. A tree structure data editing apparatus as claimed in claim 3, wherein the alternate selection type tree node comparing section returns a 31 first value returns as the correspondence ratio value when a lower layer tree portion of the first tree structure data than the first selected tree node is different from a lower layer tree portion of the second tree structure data than the second selected tree node, a second value as the.correspondence ratio value when the lower layer tree portion of the first tree structure data than the first selected tree node is the same as the lower layer tree portion of the second tree structure data than the second selected tree node, and an average of the correspondence ratio values which are returned from members of the lower layer tree portion of the first tree structure data than the first selected tree node when the lower layer tree portion of the first tree structure data than the first selected tree node is partially the same as the lower layer tree portion of the second tree structure data than the second selected tree node.

8. A tree structure data editing apparatus as claimed in claim 3, wherein the structural type tree node comparing section returns a first value as the correspondence ratio value when members of a lower layer tree portion of the first tree structure data than the first selected tree node are different from those of a lower layer tree portion of the second tree structure data than the second selected tree node, a second value as the correspondence ratio value when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node, and an average of the 32 correspondence ratio values which are returned from the members of the lower layer tree portion of the first tree structure data than the first selected tree node when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are partially the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node.

9. A tree structure data editing apparatus as claimed in claim 3, wherein the link type tree node comparing section returns a first value as the correspondence ratio value when members of a lower layer tree portion of the first tree structure data than the first selected tree node are different from those of a lower layer tree portion of the second tree structure data than the second selected tree node, a second value as the correspondence ratio value when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node, and an average of the correspondence ratio values which are returned from the members of the lower layer tree portion of the first tree structure data than the first selected tree node when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are partially the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node.

10. A method of forming a differential output, including producing a 33 differential tree structure data hierarchically indicative of a difference between first and second tree structure data in structure through comparison of the first and second tree structure data for each of tree nodes, the first and second tree structure data respectively having first and second tree structures in which the tree nodes are hierarchically provided, analyzing the differential tree structure data, and outputting a differential output between the first and second tree structure data based on the analyzing result.

11. A method as claimed in claim 10, wherein the producing includes carrying a first comparison to determine whether a first selected node of the first tree structure and a node of the second tree structure corresponding to the first selected node as a second selected node having a same type, to produce a leaf type differential data to add to the differential tree structure data when the first selected node and the corresponding node have different types, carrying a second comparison of the first selected node and the second selected node to produce a leaf type differential data based on the first and second selected nodes to add to the differential tree structure data, carrying a third comparison of the first selected node and the second selected node to produce one of a leaf type differential data and an alternate selection type differential data based on the first and second selected nodes to add to the differential tree structure data, carrying a fourth comparison of the first selected node and the second selected node to produce one of a leaf type differential data and a structural type differential data based on the first and second selected nodes to add to the differential 34 tree structure data, carrying a fifth comparison of the first selected node and the second selected node to produce one of a leaf type differential data and a link type differential data based on the first and second selected nodes to add to the differential tree structure data, sequentially selecting the tree nodes of the first tree structure one by one as the first selected tree node from the highest layer tree node in response to a comparison start instruction to start the first comparison, and starting one of the second to fifth comparisons, based on the type of the first selected node when it is determined in the first comparison that the first selected node and the second selected node have the same type.

12. A method as claimed in claim 11, wherein each of the first comparison to the fifth comparison includes returning a correspondence ratio value when each of the first comparison to the fifth comparison is ended.

13. A method as claimed in claim 12, wherein the sequentially selecting includes stopping the sequential selection of the tree nodes for a tree portion including the first selected tree node, when thereturned correspondence ratio value is lower than a threshold value, and starting the sequential selection of the tree nodes for another tree portion.

14. A method as claimed in claim 12, wherein the first comparison includes returning a first value as the correspondence ratio value when the first and second selected tree nodes are different in the type.

15. A method as claimed in claim 12, wherein the second comparison includes returning a first value as the correspondence ratio value when the first and second selected tree nodes are different from each other, and returning a second value as the correspondence ratio value when the first and second selected tree nodes are the same.

16. A method as claimed in claim 12, wherein the third comparison includes returning a first value returns as the correspondence ratio value when a lower layer tree portion of the first tree structure data than the first selected tree node is different from a lower layer tree portion of the second tree structure data than the second selected tree node, returning a second value as the correspondence ratio value when the lower layer tree portion of the first tree structure data than the first selected tree node is the same as the lower layer tree portion of the second tree structure data than the second selected tree node, and returning an average of the correspondence ratio values which are returned from members of the lower layer tree portion of the first tree structure data than the first selected tree node when the lower layer tree portion of the first tree structure data than the first selected tree node is partially the same as the lower layer tree portion of the second tree structure data than the second selected tree node.

17. A method as claimed in claim 12, wherein the fourth comparison includes returning a first value as the correspondence ratio value when members of a lower layer tree portion of the first tree structure 36 data than the first selected tree node are different from those of a lower layer tree portion of the second tree structure data than the second selected tree node, returning a second value as the correspondence ratio value when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node, and returning an average of the correspondence ratio values which are returned from the members of the lower layer tree portion of the first tree structure data than the first selected tree node when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are partially the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node.

18. A method as claimed in claim 12, wherein the fifth comparison includes returning a first value as the correspondence ratio value when members of a lower layer tree portion of the first tree structure data than the first selected tree node are different from those of a lower layer tree portion of the second tree structure data than the second selected tree node, returning a second value as the correspondence ratio value when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node, and returning an average of the correspondence ratio values which are returned from the members of the lower layer tree portion of the first tree 37 structure data than the first selected tree node when the members of the lower layer tree portion of the first tree structure data than the first selected tree node are partially the same as those of the lower layer tree portion of the second tree structure data than the second selected tree node. 5

19. A recording medium in which a program is stored for a method of forming a differential output, including producing a differential tree structure data hierarchically indicative of a difference between first and second tree structure data in structure through comparison of the first and second tree structure data for each of tree nodes, the first and second tree structure data respectively having first and second tree structures in which the tree nodes are hierarchically provided, analyzing the differential tree structure data, and outputting a differential output between the first and second tree structure data based on the analyzing result.

20. A recording medium as claimed in claim 19, wherein the producing includes carrying a first comparison to determine whether a first selected node of the first tree structure and a node of the second tree structure corresponding to the first selected node as a second selected node have a same type, to produce a leaf type differential data to add to the differential tree structure data when the first selected node and the corresponding node have different types, carrying a second comparison of the first selected node and the second selected node to produce a leaf type differential data based on the first and second selected nodes to add to the 38 differential tree structure data, carrying a third comparison of the first selected node and the second selected node to produce one of a leaf type differential data and an alternate selection type differential data based on the first and second selected nodes to add to"the differential tree structure data, carrying a fourth comparison of the first selected node and the second selected node to produce one of a leaf type differential data and a structural type differential data based on the first and second selected nodes to add to the differential tree structure data, carrying a fifth comparison the first selected node and the second selected node to produce one of a leaf type differential data and a link type differential data based on the first and second selected nodes to add to the differential tree structure data, sequentially selecting the tree nodes of the first tree structure one by one as the first selected tree node from the highest layer tree node in response to a comparison start instruction to start the first comparison, and starting one of the second to fifth comparison, based on the type of the first selected node when it is determined in the first comparison that the first selected node and the second selected node have the same type.

21. A recording medium as claimed in claim 20, wherein each of the first comparison to the fifth comparison includes returning a correspondence ratio value when each of the first comparison to the firth comparison is ended.

22. A recording medium as claimed in claim 21, wherein the 39 sequentially selecting includes stopping the sequential selection of the tree nodes for a tree portion including the first selected tree node, when the returned correspondence ratio value is lower than a threshold value, and starting the sequential selection of the tree nodes for another tree portion. 5

23. A tree structure data editing apparatus as claimed in claim 1 including an arrangement substantially as described herein with reference to any one of Figs. 1 to 16 of the accompanying drawings.

24. A method of forming a differential output as claimed in claim 10 substantially as described herein with reference to any one of Figs. 1 to 16 of the accompanying drawings.

25. A recording medium as claimed in claim 19 including an arrangement substantially as described herein with reference to any one of Fig. 1 to 16 of the accompanying drawings.