JPH1131147A - Data management system with tree structure - Google Patents

Abstract

(57) [Summary] [PROBLEMS] To insert a new node into an already configured tree structure or to delete an unnecessary node from the already configured tree structure, a node related to each node is deleted. The tree structure can be changed simply by changing the numbers. SOLUTION: For each node 2 constituting a tree structure 5,
Node numbers are added so that all numbers are unique, and the relationship between the node numbers is grouped for each node 2, a relation descriptor 4 is created, and these relation descriptors 4 are grouped, A relation description table 10 is created, and each node 2
When adding or deleting a connection, the contents of the relation description table 10 are changed to change the connection relation between the nodes 2.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] 1. Field of the Invention [0002] The present invention relates to a data management system having a tree structure in which data elements such as management components are owned in a tree structure.

[0002]

2. Description of the Related Art In a data management system having a tree structure in which data elements such as management components are owned in a tree structure, conventionally, as shown in FIG. As shown in FIG. 16, numbers are sequentially assigned from the top node 101,
By giving a hierarchical relationship (parent-child relationship) to each node 101 and allocating each data element to each node 101 according to the hierarchical relationship of each data element, when one data element is given, this data element The parent data element and the child data element can be sequentially found.

[0003]

However, in the data management system having the conventional tree structure described above, when a new data element is inserted into the already configured tree structure 102 or when the already configured tree structure 102 is inserted. When unnecessary data elements are deleted from the node 102, the numbers given to all the nodes 101 must be renumbered sequentially from the top node 101, so that the tree structure 102 However, there was a problem that reconstruction was difficult.

[0004] In view of the above circumstances, the present invention provides a method for inserting a new node into an already configured tree structure or deleting an unnecessary node from the already configured tree structure. By simply renumbering the nodes related to each node, the tree structure can be changed, which simplifies the tree structure reconstruction work and reduces the operation time of the operator and the processing time of the computer device. It is an object of the present invention to provide a data management system having a tree structure capable of dramatically shortening the time.

According to a second aspect of the present invention, when a new node is inserted into an already configured tree structure, the tree structure is changed only by changing the numbers of the new node and the nodes related to this node. To provide a data management system having a tree structure that can simplify the tree structure reconstructing work and dramatically reduce the operation time of the operator and the processing time on the computer device side. It is intended to be.

According to a third aspect of the present invention, when each node below one node is deleted from the already configured tree structure, the number of the deleted node itself and the number of the node related to each node are simply changed. Thus, the tree structure can be completely changed, thereby simplifying the tree structure reconstructing operation, and significantly reducing the operation time of the operator and the processing time of the computer device side. The purpose of the present invention is to provide a data management system.

[0007]

According to a first aspect of the present invention, there is provided a data management system having a tree structure in which a plurality of nodes are connected and used in a tree structure form. It has a relationship description table that holds the node numbers of its own parent, its own first child, and each node that is a member having the same parent as itself in a tree structure in which nodes are connected hierarchically. When performing, the number of the node related to the node to be added or deleted from the contents of the relation description table is changed.

According to a second aspect of the present invention, in a data management system having a tree structure in which a plurality of nodes are connected and used in a tree structure format, a first tree structure in which a plurality of nodes are hierarchically connected to each other is provided. , A relation description table holding the node numbers of the nodes that are members of the first child of the own and the same parent as the own, and a plurality of nodes are hierarchically arranged in one of the nodes in the first tree structure. When adding the second tree structure that has been converted and connected, the entire node number of the second tree structure is changed, and based on the node itself to be added and the related nodes, the first tree structure The contents of the corresponding relation description table and the contents of the relation description table corresponding to the second tree structure are changed.

Further, in the data management system having a tree structure according to the second aspect, in the data management system,
When deleting each node below one of the nodes in the tree structure, among the relation descriptors on the relation description table of the first tree structure, replace each relation descriptor corresponding to each deleted node with each other. In addition to the deletion, the contents of the relation descriptor having the node number of each deleted node are changed.

In the above configuration, according to the first aspect, a tree structure in which a plurality of nodes are hierarchized and connected, and a node number of each node which is a member having its own parent, its first child, and the same parent as its own And a relationship description table that holds
When adding or deleting each node, a new number is added to the already configured tree structure by changing the number of the node related to the node to be added or deleted in the contents of the relation description table. When inserting nodes or deleting unnecessary nodes from the already configured tree structure,
Just change the number of the node related to each node,
The modification of the tree structure is completed, thereby simplifying the reconstruction operation of the tree structure, and the operation time of the operator and the processing time on the computer device side are drastically shortened.

In addition, when adding the second tree structure to one of the nodes in the first tree structure, the entire node number of the second tree structure is changed and then added. By changing the contents of the relation description table corresponding to the first tree structure and the contents of the relation description table corresponding to the second tree structure based on the node itself and the related nodes, , When inserting a new node, simply changing the number of the new node and the node related to this node completes the change of the tree structure,
As a result, the tree structure reconstructing operation is simplified, and the operation time of the operator and the processing time of the computer device are greatly reduced.

Furthermore, in the third aspect, when each node below one of the nodes in the first tree structure is deleted, among the relation descriptors on the relation description table of the first tree structure, By deleting each relational descriptor corresponding to each deleted node and changing the contents of the relational descriptor having the node number of each deleted node, the tree structure that has already been configured can be deleted under one node. When deleting each node, simply change the number of the deleted node and the node related to each node, and complete the change of the tree structure, thereby simplifying the tree structure reconstruction work,
Dramatically reduce the operation time of the operator and the processing time of the computer device.

[0013]

BEST MODE FOR CARRYING OUT THE INVENTION

<< Configuration of Embodiment >> FIG. 1 is a configuration diagram showing an embodiment of a data management system having a tree structure according to the present invention.

A data management system 1 having a tree structure shown in FIG. 1 includes a plurality of nodes 2 arranged at positions corresponding to a parent-child relationship, a sibling relationship, and a plurality of connection lines 3 connecting the nodes 2. 2, a plurality of relational descriptors 4 created for each node 2 are provided, and a node number is added to each node 2 so that all numbers are unique. At the same time, the relationship between the node numbers is grouped for each node 2 to create a relationship descriptor 4, and these relationship descriptors 4 are grouped into a relationship description table 1
0 (see FIG. 3) is created. And new node 2
When adding a node or deleting an unnecessary node 2,
The change of the tree structure 5 is completed only by changing the node numbers corresponding to the added node 2 and the deleted node 2 among the node numbers in the relation description table 10.

In this case, one tree structure 5 is constituted by a plurality of nodes 2 and a plurality of connecting lines 3 connecting them, and each data element is allocated to each node 2.

Further, as shown in FIG. 2, the relation descriptor 4 includes a self entry column 6 in which the own node number is written,
A parent entry field 7 in which the node number of the node 2 to be the parent is written; a first child entry field 8 in which the node number of the node 2 to be the first child is written; Among them, there is provided a member entry column 9 in which the node number of the node 2 having the closest relationship is written. In addition, as shown in FIG. 3, the relation descriptor 4 for each node 2 is collected and one relation description table 10 is created.

<< Operation of the Embodiment >> Next, FIGS.
With reference to the schematic diagram shown in FIG. 1, the tree structure 5, the operation of creating the relation description table 10, the operation of inserting a new node 2, and the operation of deleting unnecessary nodes 2 constituting the data management system 1 will be described in detail.

<Operation for Creating Tree Structure and Relationship Description Table>
First, when assigning a node number to each node 2, FIG.
As shown in (1), a node number is assigned to each node 2 constituting the first tree structure 5a so that the node number is unique. At this time, each node number does not necessarily have to be in order from the top parent.

Thereafter, as shown in FIG. 5, from among the relational descriptors 4 in the first relational description table 10a, the relational descriptor 4 in which the own code number is written in the own code entry column 6 is entered. Node 2 to be selected and to be its own parent
And writes this in the parent entry field 7 in the relational descriptor 4 of the user. However, for the top node 2, for example, the node number "5", "0" is written as the node number of its own parent.

Next, for each node 2, the node number of the node 2 serving as its first child is obtained, and this is written in the first child entry field 8 in its own relational descriptor 4. However, the lowest node 2 that does not have its first child, for example, node numbers “8”, “3”, “9”, “12”, “10”, “1”
1 ”is the node number of the first child
Write “0”.

Thereafter, for each node 2, a node 2 having the same parent as itself, that is, a node 2 which is a member is obtained, and the node number of this node 2 is assigned to its own relation descriptor 4.
Fill in the member entry field 9 inside. However, if there are multiple members with the same parent as yourself, and you are at the bottom of the hierarchy in each member,
Write the node number of the top member as the node number of the member having the same parent as yourself. Also, for nodes that have no other members having the same parent as themselves, for example, node numbers “5”, “7”, and “11”, “0” is written as their own members.

<Inserting Operation of New Node> Next, a first tree structure 5a is created by a plurality of nodes 2 and a plurality of connection lines 3 according to such a procedure, and then the first tree structure 5a is created.
For example, a tree having a new tree structure, for example, a plurality of nodes 2 and a plurality of connection lines 3 as shown in FIG. When inserting the structure (the second tree structure 5b), the procedure for creating the first tree structure 5a and the procedure for creating the first relationship description table 10a are the same as shown in FIG.
A node number is given to each node 2 constituting the second tree structure 5b, and based on the relationship between the nodes 2,
The second relation description table 10b shown in FIG. 8 is created.

Thereafter, as shown in FIG. 9, the first tree structure 5
As a child of node 2 of node number “6” constituting a
After the node 2 at the top of the second tree structure 5b is connected to create a third tree structure 5c, a part of the second tree structure 5b constituting the third tree structure 5c is referred to as "second tree structure". Structure 5b
To calculate the second tree structure 5b by performing the operation indicated by "the new node number of each node 2 constituting" = the original node number of the second tree structure 5b + the total number of nodes of the first tree structure 5a ". Then, a new node number of each node 2 is obtained, and as shown in FIG. 10, a new node number is given to each node 2 constituting the second tree structure 5b.

Next, as shown in FIG. 11, the original node number in the original second relationship description table 10b corresponding to the second tree structure 5b is rewritten with a new node number. However, the node number of the parent node 2 and the first
When the node number of the child node 2 and the node number of each member having the same parent as its own are “0”, this is kept as “0”. Thereafter, as shown in FIG. 12, the rewritten second relation description table 10b is stored in the first relation description table 10b.
A third relation description table 10c is created in addition to the first relation description table 10a corresponding to the tree structure 5a.

The node 2 to which the second tree structure 5b is added, that is, the node 2 itself having the node number "6" and the node number "11" related to the node number "6",
For each node 2 having "13", the contents of the third relation description table 10c are changed as described below.

First, the node number "11" entered in the first child entry column 8 in the relation descriptor 4 of the node number "6"
Is changed to the node number “13”, and “0” written in the member entry column 9 in the relation descriptor 4 of the node number “11” is changed to the node number “13”. Further, the parent entry column 7 in the relation descriptor 4 of the node number “13”
Is changed to the node number "6", and "0" written in the member description column 9 in the relation descriptor 4 is changed to the node number "11".

Thus, even if the second tree structure 5b is added to one node 2 constituting the first tree structure 5a,
Among the node numbers of the nodes 2 constituting the first tree structure 5a, the node 2 to which the second tree structure 5b has been added, that is, the node 2 itself having the node number "6" and the node related to the node number "6" For each of the nodes 2 having the numbers “11” and “13”, the process of changing the node number accompanying the insertion of the new node 2 can be performed simply by changing the contents of the first and second relation description tables 10 a and 10 b. Can be completed.

<Operation of Deleting Unwanted Node 2> After the first tree structure 5a is created by the plurality of nodes 2 and the plurality of connection lines 3 according to the above-described procedure, the first tree structure 5a
, For example, a node number “4”
When deleting each node 2 below the node 2 of the first tree structure, as shown in FIG. 13, among the nodes 2 constituting the first tree structure 5a, the node 2 below the node number "4" is deleted. All are deleted to create the fourth tree structure 5d.

Thereafter, among the relation descriptors 4 in the first relation description table 10a corresponding to the first tree structure 5a,
The node numbers of the deleted nodes 2, that is, all the relational descriptors 4 corresponding to the node numbers “4”, “7”, “9”, “10”, and “12” are deleted, and as shown in FIG. A fourth relation description table 10d is created, and among the node numbers in the fourth relation description table 10d, the relation descriptor 4 having the node number of the deleted node 2, for example, the node having the node number "2" The node number “4” entered in the member entry column 9 constituting the relational descriptor 4 of No. 2 is changed to “0”.

As a result, even if each lower node 2 is deleted from one node 2 constituting the first tree structure 5a,
Of the node numbers of each node 2 constituting the tree structure 5a,
Each deleted node 2, that is, node number “4”,
Each node 2 having “7”, “9”, “10”, and “12”
With regard to the above, only by changing the contents of the first relational description table 10a, it is possible to complete the node number changing process accompanying the deletion of the unnecessary node 2.

<< Effects of Embodiment >> As described above, in this embodiment, a node number is added to each node 2 so that all numbers are unique, and the relationship between each node number is changed by each node. Since the related descriptors 4 are collectively created for each of the two, and the related descriptors 4 are collectively created to create the related description table 10, when the new node 2 is added or the unnecessary node 2 is At the time of deletion, the change of the tree structure 5 can be completed only by changing the node numbers corresponding to the added node 2 and the deleted node 2 among the node numbers in the relation description table 10. Thereby, the reconfiguration operation of the tree structure 5 can be simplified, the labor of the operator can be remarkably reduced, and the processing time on the computer device side can be significantly reduced. Kill.

In this embodiment, when a new node 2 is inserted into the already configured tree structure 5, the node numbers of the new node 2 and the node 2 related to this node 2 are changed. Thus, the modification of the tree structure 5 can be completed, thereby simplifying the reconfiguration operation of the tree structure 5, greatly reducing the labor of the operator, and reducing the processing time on the computer device side. It can be dramatically shortened.

Similarly, when deleting each node 2 under one node 2 from the already configured tree structure 5,
The change of the tree structure 5 can be completed only by changing the node number of the deleted node 2 and the node 2 related to each node 2, thereby simplifying the reconstructing work of the tree structure 5, The labor of the operator can be remarkably reduced, and the processing time on the computer device side can be significantly reduced.

[0034]

As described above, according to the present invention, according to the first aspect, a new node is inserted into an already configured tree structure, or an unnecessary node is added to the already configured tree structure. When deleting a tree, it is possible to complete the change of the tree structure only by renumbering the nodes related to each node, thereby simplifying the reconstruction of the tree structure, reducing the operation time of the operator and the computer device side. Can be dramatically reduced.

According to a second aspect of the present invention, when a new node is inserted into an already configured tree structure, the tree structure can be changed only by changing the numbers of the new node and the node related to this node. Can be completed, thereby simplifying the reconstructing operation of the tree structure, and drastically reducing the operation time of the operator and the processing time on the computer device side.

According to the third aspect, when each node below one node is deleted from the already configured tree structure, the number of the deleted node itself and the number of the node related to each node are simply changed. Thus, the modification of the tree structure can be completed, thereby simplifying the reconstruction operation of the tree structure, and the operation time of the operator and the processing time on the computer device side can be significantly reduced.

[Brief description of the drawings]

FIG. 1 is a configuration diagram showing an embodiment of a data management system having a tree structure according to the present invention.

FIG. 2 is a schematic diagram showing an example of a relational descriptor constituting the data management system having the tree structure shown in FIG.

FIG. 3 is a schematic diagram showing an example of a relation description table in which relation descriptors shown in FIG. 2 are put together.

FIG. 4 is a schematic diagram for explaining a tree structure creation operation of the data management system having the tree structure shown in FIG. 1;

FIG. 5 is a schematic diagram for explaining a relation description table creating operation of the data management system having the tree structure shown in FIG. 1;

FIG. 6 is a schematic diagram for explaining a node insertion operation of the data management system having the tree structure shown in FIG. 1;

FIG. 7 is a schematic diagram for explaining a node insertion operation of the data management system having the tree structure shown in FIG. 1;

8 is a schematic diagram for explaining a node insertion operation of the data management system having the tree structure shown in FIG.

FIG. 9 is a schematic diagram for explaining a node insertion operation of the data management system having the tree structure shown in FIG. 1;

FIG. 10 is a schematic diagram for explaining a node insertion operation of the data management system having the tree structure shown in FIG. 1;

FIG. 11 is a schematic diagram for explaining a node insertion operation of the data management system having the tree structure shown in FIG. 1;

FIG. 12 is a schematic diagram for explaining a node insertion operation of the data management system having the tree structure shown in FIG. 1;

FIG. 13 is a schematic diagram for explaining a node deletion operation of the data management system having the tree structure shown in FIG. 1;

FIG. 14 is a schematic diagram for explaining a node deleting operation of the data management system having the tree structure shown in FIG. 1;

FIG. 15 is a configuration diagram illustrating an example of a conventionally known data management system having a general tree structure.

FIG. 16 is a schematic diagram showing an example when a node number is added to each node shown in FIG. 1;

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Data management system 2 Node 3 Connecting line 4 Relational descriptor 5 Tree structure 5a First tree structure 5b Second tree structure 5c Third tree structure 5d Fourth tree structure 6 Self entry field 7 Parent entry field 8 First child entry field 9 Member entry column 10 Relationship description table 10a First relationship description table 10b Second relationship description table 10c Third relationship description table 10d Fourth relationship description table

Claims (3)

[Claims] 1. A data management system having a tree structure in which a plurality of nodes are connected and used in a tree structure, wherein a parent, a first child, and a self of a tree structure in which a plurality of nodes are hierarchically connected. A relationship description table that holds the node numbers of each node that is a member having the same parent as the node. When adding or deleting each node, the content of the relationship description table is related to the node to be added or deleted. A data management system having a tree structure, wherein the number of a node to be changed is changed. 2. A data management system having a tree structure in which a plurality of nodes are connected and used in a tree structure form, wherein a first tree structure in which a plurality of nodes are hierarchically connected is provided, and a parent of the first tree structure and a first of the own tree. A relation description table that holds a node number of each node that is a member having the same parent as the child, and a plurality of nodes that are hierarchically connected to one of the nodes in the first tree structure. When adding a two-tree structure, the entire node number of the second tree structure is changed, and a relation description table corresponding to the first tree structure is created based on the node itself to be added and related nodes. And a data management system having a tree structure, wherein contents of a relation description table corresponding to the second tree structure are changed. 3. The data management system having a tree structure according to claim 2, wherein, when deleting each node below one of the nodes in the first tree structure, a relation description of the first tree structure. A tree characterized by deleting each relational descriptor corresponding to each deleted node among the relational descriptors on the table and changing the content of the relational descriptor having the node number of each deleted node. A data management system having a structure.