JPH1031679A - Database management device and network-tree structure conversion method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To easily recognize the data and their connection weight by producing a network structure model based on the information showing the network relation and the information obtained by giving the weighting to the line to which the identification information on those data are connected as nodes. SOLUTION: The information on the manuals of systems related with each other like a network is stored in a database storage part 1 and also the weight information on the stored information is inputted to the part 1 by an operator. When the data identification information are connected to each other in a line with these identification information defined as nodes, the weighting is also given to the line based on a prescribed rule. Then the weighted line is stored in a network structure/weight information storage means 2 as an information table. A network structure model production means 3 connects the nodes together in a line and also produces the display information on a structure model diagram including the weight display based on the information stored in the means 2. Based on this display information, an output control means 4 outputs the network structure model diagram via an output means 5.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a base management apparatus for converting a database having a network structure into tree structure data and a method for converting a network structure / tree structure.

[0002]

2. Description of the Related Art Conventionally, as a database, a database in which a plurality of pieces of information are associated in a mesh pattern as shown in FIG. 15 is known. Each piece of information shown in FIG. 15 is related as shown by an arrow. Database of this network structure (for example, a manual for a certain system)
Is converted into a tree-structured database as shown in FIG. 16 for printing, for example.

As a technique for performing such a network structure / tree structure conversion, Japanese Patent Application Laid-Open Nos.
Japanese Patent Application Laid-Open Nos. 35657, 2-282829 and 4-130566 are known.

[0004]

However, in the above-mentioned conventional example, all data in the database is targeted, and all data other than the data desired by the user is also converted into a tree structure. Therefore, it is conceivable that the operator specifies and inputs necessary data. However, in such a case, for example, as shown in FIG. 17A, there are a very large number of nodes (data) indicated by circles. In the case of, there is a problem that the operation of designating a desired node is extremely troublesome as indicated by a black dot in FIG. Also, when a desired node is specified as shown in FIG. 18A, for example, the unspecified node (“B” in FIG. 18A) and its related line are appropriately deleted, and the connection relationship is deleted. Which can be automatically reconstructed and automatically converted into a tree structure as shown in FIG.

SUMMARY OF THE INVENTION The present invention has been made to solve the problems of the apparatus for performing the network structure / tree structure conversion in the database according to the conventional example described above, and its object is to determine the weight of data and the weight of connection between data. An object of the present invention is to provide a database management device that can be easily known. Another object of the present invention is to provide a database management apparatus and a network structure / tree structure conversion method for performing network structure / tree structure conversion for necessary nodes. In addition, when the main line is determined and data is output in the tree structure model, output is performed in such a manner that a "section" is under "group", a "department" is under that, and a "chapter" is under it. It is an object of the present invention to provide a database management device and a network structure / tree structure conversion method which can be performed.

[0006]

According to a first aspect of the present invention, there is provided a database management apparatus for managing a database in which a plurality of data are associated in a net-like manner. A network structure / weight information storage means storing weight information of each node and line when the identification information of each data is a node and the connection between the identification information of each data is a line; A network structure model creating unit that connects each node with a line based on the information of the weight information storage unit and creates display information of a network structure model diagram including a display related to the weight, and an output unit for outputting information, An output system for causing the output means to output a network structure model diagram including a display related to weights based on the display information created by the network structure model creation means. Characterized by comprising a means. As a result, the network structure model including the display of the weights is output, and it is possible to appropriately know the degree of importance and the degree of connection from the weight of each node and each line in the network structure.

A database management device according to a second aspect of the present invention is a database management device for managing a database in which a plurality of data are linked in a net-like manner. When the identification information is a node and the connection between the identification information of each data is a line, a network structure / weight information storage means in which weight information of each node and line is stored, an instruction means for giving various instructions, When a threshold value of a node to be converted into a tree structure is given from the instruction means, the nodes are rearranged with respect to the information stored in the network structure / weight information storage means based on the threshold value, and the link between the nodes is re-established. A network structure / tree structure conversion means for constructing and creating information indicating a relationship between the tree structures, and linking each node based on the information generated by the network structure / tree structure conversion means. Network structure model creating means for creating display information of a tree structure model diagram including a display relating to weights, an output means for outputting information, and display information created by the tree structure model creating means. The output means includes an output control means for outputting a tree structure model diagram including a display relating to weights. Thereby, the nodes are arranged based on the given thresholds, and information indicating the relationship of the tree structure is created by reconstructing the links between the nodes. Each node is connected by a line based on the created information, and the tree structure model is created. An output including an indication regarding the weight is made in the figure.

According to a third aspect of the present invention, there is provided a database management apparatus for displaying the weight of a note and a line by using a numerical value of a weight, a line width of a node frame and a line, or a color thereof. It is characterized by. This allows
The degree of importance and the degree of connection of each node and each line can be known at a glance from the numerical value of the weight, the thickness of the line of the node frame and the line, or the color thereof.

In the database management apparatus according to a fourth aspect of the present invention, the network structure / tree structure conversion means adds the weight information on the arranged lines and sets the added information as the line weight information on the new link. It is characterized by the following. Thus, the weights related to the arranged links are reflected in the new links, and the new weights can appropriately represent the degree of connection between the nodes.

[0010] In a database management apparatus according to a fifth aspect of the present invention, the network structure / tree structure conversion means deletes a loop-like connection of nodes based on weight information when converting to a tree structure. I do. As a result, loops are deleted from a portion having a low degree of importance, and an appropriate tree structure model can be obtained.

According to a sixth aspect of the present invention, in the database management apparatus, the tree structure model creating means arranges based on the weight information when there are a plurality of sibling nodes having the same depth from the root node. I do. by this,
Even when there are a plurality of sibling nodes having the same depth from the root node, their importance is represented by the arrangement in the tree structure model diagram.

In the database management apparatus according to the present invention, when the tree structure model creating means converts the tree structure model into a plurality of sibling nodes having the same depth from the root node, the weight information The main line is determined on the basis of the above and the nodes are arranged. The main line is determined based on the weights, and a tree structure model can be obtained as if branching from the main line.

In the database management apparatus according to the present invention, when the output control means outputs the data of the database to the output means, there are a plurality of sibling nodes having the same depth from the root node with respect to the tree structure model. In this case, control is performed such that the data of the node with the larger weight in the sibling node is output, and further, the data of the node with the larger weight in the sibling node is output for the lower node, and the data of the sibling node is output from the lower side. It is characterized in that reading is performed sequentially, and output is performed in such a manner that a "group" is provided below the "group", a "section" is provided below the "group", and a "chapter" is provided below the "section". This allows
In the case of outputting a document, it is possible to obtain an output along the table of contents of a book in which a hierarchy is divided and the next hierarchy and the next hierarchy are arranged below the hierarchy.

According to a ninth aspect of the present invention, there is provided a network structure / tree structure conversion method for converting a relation of a database in which a plurality of data are related in a net form into a relation represented by a tree structure. A method comprising: providing weight information of each node and line when the identification information of each data in the mesh is a node and connecting the identification information of each data as a line; and a threshold value of the node to be converted into a tree structure. With respect to the information indicating the net-like relationship based on the weight information based on the threshold value, the nodes are arranged, and the links between the nodes are reconstructed to create information indicating the tree-structure relationship. I do. Thereby, with respect to the information indicating the net-like relationship based on the given threshold value and the weight information, the nodes are arranged, the link between the nodes is reconstructed, and the information indicating the tree-structure relationship is created. Conversion to a tree structure is performed.

According to a tenth aspect of the present invention, in the network structure / tree structure conversion method, when a plurality of sibling nodes having the same depth from the root node exist at the time of conversion into a tree structure model, the main structure is determined based on the weight information. It is characterized in that a tree structure is arranged by determining a line. As a result, the main line is determined based on the weight, and a tree structure model can be obtained as if branching from the main line.

[0016]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A database management apparatus and a network structure / tree structure conversion method according to an embodiment of the present invention will be described below with reference to the accompanying drawings. In the respective drawings, the same components are denoted by the same reference numerals, and redundant description will be omitted. FIG. 1 shows a configuration diagram of a database management device according to an embodiment of the present invention. In this device, the database storage unit 1 stores, for example, information related to a manual of a certain system which is related to each other in a net shape as shown in FIG. When or after this information is input, the operator inputs weight information of the information. When the identification information of each data is a node and the connection between the identification information of each data is a line, the weight information of the line may be input by an operator, for example. ,
Since it is not easy for the operator to search, the search is performed by software for association, and weighting is performed based on a predetermined rule. For example, the same word, or
Information (sentences) in which words with synonyms or subject predicates exist are connected by lines, and the same word or
If there is a synonym or a word having a relationship of subject predicate, respective weights are determined, and the weight information of the line is automatically set by the software from the sum of the weights. When the information indicating the net-like relationship of the data created in this way and the identification information of each data is a node and the connection between the identification information of each data is a line,
The weight information of each node and line is, for example, as shown in FIG.
It seems as shown. That is, the identification information (ID) of the node
Weight information is set for each line, and the weight information corresponding to the identification information of the line node, and the starting and ending nodes thereof are set as the information of the line node.
This information table is shown as network structure / weight information storage means 2 in FIG. The database of the database storage unit 1 and the information table of the network structure / weight information storage unit 2 need not always be stored in the terminal, and may be fetched from the server via a network when necessary, for example. good.

In the data management device, based on the information in the network structure / weight information storage means 2, each node is connected by a line, and display information of a network structure model diagram including display relating to weights is generated. Means 3, an output means 5 for outputting information, and a network structure model diagram including a display relating to weights is output in the output means 5 based on the display information created by the network structure model creating means 3. Output control means 4 is provided. Here, the output unit 5 includes a display device 16 such as a CRT and a printer device 20, and the output control unit 4 includes a display control unit 15 for controlling the display device 16 and a printer device 20. Printer control unit 19 for controlling
Are provided.

Further, the database management device is provided with an instruction means 6 for giving various instructions, and when a threshold value of a node to be converted into a tree structure is given from the instruction means 6, a network structure / weight information storage is performed based on the threshold value. A network structure / tree structure conversion means 7 for organizing nodes with respect to the information stored in the means 2 and reconstructing links between the nodes to create information indicating a tree structure relationship; Tree structure conversion means 7
The tree structure model creating means 8 connects each node with a line based on the information created by the above and creates display information of the tree structure model diagram including the display related to the weight, and the tree structure model creating means 8 creates the display information. The output unit 5 includes an output control unit 4 for outputting a tree structure model diagram including a display related to weights based on the display information.

The above-mentioned database management apparatus is actually realized by a personal computer, a work station, or the like, and the configuration is, for example, as shown in FIG. That is, the CPU 1 that controls each unit
0 and data used by the CPU 10 are stored,
The main storage device 11 used as a work area is mainly configured. Bus 1 from CPU 10
The bus 12 includes a keyboard control unit 13 for controlling a keyboard input device 14 used for inputting information, and a display device 1 such as a CRT for displaying information.
6, a mouse control unit 17 that receives data of a mouse 18 as a pointing device and sends the data to the CPU 10, a printer control unit 19 that controls a printer device 20 that performs printing, and stores information. A magnetic disk control unit 21 for controlling the magnetic disk device 22, a communication processing unit 24 for transmitting / receiving data to / from a line or a network, and a communication interface 23 for performing a connection between the CPU 10 and the Have been.

The display information created by the network structure model creation means 3 based on the information stored in the network structure / weight information storage means 2 is shown, for example, as shown in FIG. That is, the identification information (A to D) of each data is shown as a node in a circle, the connection between the identification information of each data is displayed as a line, and the weight information of the node and the line is displayed by a numeral. In another configuration example, the weight is displayed by a line thickness or a color instead of the number. In FIG. 2, the database storage unit 1 and the network structure / weight information storage unit 2 correspond to, for example, the magnetic disk device 22 or the main storage device 11, from which the CPU 10 reads information. Based on the above, display information for performing the display as shown in FIG. 7A is created. This display information is sent to the display control unit 15 and the above-mentioned display is performed.

Next, a network structure / tree structure conversion process performed by the database management apparatus will be described. This process is executed according to the procedure shown in FIG. That is, a threshold value of a node to be converted into a tree structure is designated and input from, for example, the keyboard input device 14 (S1). Next, preprocessing is performed (S2). More specifically, the input node below the threshold value is deleted. Further, the main line for determining the main line of the tree structure model is performed (S
3) Subsequently, a loop check process for deleting a line between nodes forming a loop is executed (S4), and finally, a conversion from the network structure model to a tree structure model is performed (S5). Hereinafter, each process will be described in detail.

FIG. 4 shows a detailed flowchart of the preprocessing. A group of databases to be processed is specified and extracted from the network structure / weight information storage means 2 in advance. Next, a line check is performed to detect whether each node is connected by a line, in other words, whether all nodes are connected by a line, and whether there is an isolated node (S11). If the node is divided into two or more connection groups, or if there is an isolated node, the operator can use the keyboard input device 14 or the mouse 18 to instruct the addition of the line and the starting point of the line to be added. , The end point, and additional lines, and weight information. Thus, when the state in which the node is divided into two or more connection groups or an isolated node does not exist, the process proceeds to the next process. here,
Assuming that the network structure model is as shown in FIG. 5A, the weight of the node is as shown in FIG. 5B, and the input threshold (threshold) is “5”, the processing operation is performed. explain. The information of the network structure / weight information storage means 2 corresponding to this network structure model is as shown in FIG.

First, a processing pointer is set as node ID = 1, and processing is started from node ID = 1 in FIG. 6A (S12). Next, it is detected whether or not the processing has been completed for all nodes (S13). Here, since all the checks have not been performed yet, it is detected whether or not the node with the processing pointer has a weight equal to or larger than the threshold (S14). The detection proceeds by incrementing the node IDs of nodes A, B,... (S15). The weight of each node is as shown in FIG. 5C, and the node E is detected as a node having a weight less than the threshold value “5”. When the node E to be deleted is detected, a process of adding a new link is performed (S16). Specifically, as shown in FIG. 6B, links are added between nodes A and D and between nodes B and D. Next, the weight of the new link is updated (S17). That is, the weight of the line AD between the nodes A and D is set to “1” by adding “9” of the line AE and “5” of the line ED.
4 ”, and the weight of the line BD between the nodes B and D is set to“ 6 ”by adding“ 1 ”of the line BE and“ 5 ”of the line ED. Also, between nodes A and B,
From the beginning, the weight “9” of the line AE and the weight “1” of the line EB are added to the weight “2” to obtain “12”. Then, the node E is deleted, and the lines AE, ED, and EB that need to be deleted along with the deletion of the node E are deleted (S18). As a result, the network structure / weight information storage means 2
6 (a), FIG. 6 (b), FIG. 6 (c),
Transition is made to FIG. The result shown in FIG. 6D is the information of the intermediate result converted by the network structure / tree structure conversion means 7.

The information at the intermediate stage is, for example, a network structure /
The weight information is stored in the weight information storage means 2, and can be output from the output means 5 in accordance with an instruction from the instruction means 6 to the output control means 4. That is, the keyboard input device 14
, The CPU 10 receives the instruction, creates the display information of the network structure model diagram based on the information of the intermediate result in the main storage device 11, and provides the display information to the display control unit 15.
As a result, a network structure model diagram corresponding to the information of the intermediate result is displayed as shown in FIG. In another configuration example, the weight is displayed by a line thickness or a color instead of the number. Then, in this display state, the main line can be designated. Hereinafter, the same display is performed in any of the main line processing (S3), the loop check processing (S4), and the network structure / tree structure conversion processing (S5).

The main line can be designated by a method of directly designating a line and a node serving as a main line, or a method of designating a line having a certain weight or more and adding or canceling designation as necessary. In the technique of directly instructing the line and the node serving as the main line, the instruction of the technique is performed by selecting the corresponding icon using the mouse 18 or using the keyboard input device 14, and moving the mark to the line and the node serving as the main line using the mouse 18. Click to enter the main line. In the method of specifying a line having a certain weight or more and specifying the line by adding or canceling the specification as necessary, the instruction of the method is performed by selecting the corresponding icon by using the mouse 18 or by using the keyboard input device 14 and performing keyboard input. The user inputs a weight equal to or greater than a predetermined weight from the device 14, moves the mark to a line and a node with the mouse 18 as needed, clicks the mark, and instructs addition or cancellation of designation. FIG. 7B shows that the weight of the line is “1”.
An example in which a line of "1" or more is designated as a main line is shown. CPU1 which is the net structure / tree structure changing means 7
A network structure in which 0 selects nodes A, lines AD, and AB constituting the main line based on an input instruction to set a line of “11” or more as a main line, and forms a frame of these nodes and a line of the line as a bold line Create display information for the model diagram,
This is given to the display control unit 15. As a result, a network structure model diagram corresponding to the information of the intermediate result indicating the main line is displayed as shown in FIG. 7B.

Next, the loop check processing will be described. The loop check process is performed as shown in the flowchart shown in FIG. If a loop occurs between nodes, conversion to a tree structure model is impossible. Therefore, a loop check is performed. First, the CPU 10 selects a starting node (S21). Any node is selected as a node to be selected by the selection of the originating node. Next, a passage flag is set for the originating node (S22). Next, it is detected whether or not an unanalyzed line pointer is set for the line extending from the origin node (S23). Since the unanalyzed line pointer is not set at the beginning, step S25
To detect whether there are a plurality of lines (S2).
5). If there are a plurality of lines, an unanalyzed line pointer is set for each line and saved (S26). If there are not a plurality of lines in step S25, or if step 26 is completed, the analysis node is shifted to a predetermined line destination node (S25).
27) It is detected whether or not the passage flag is set for the node (S28). If the passage flag has not been set, the passage flag of the node is set (S29), and the process returns to step S23 to continue the operation. If the unanalyzed line pointer has already been set for the line (S23), the unanalyzed line pointer is incremented by one and the other lines are analyzed. In the above processing, for example, in the network structure model shown in FIG. 8A (different from the example of FIG. 7), the analysis destination shifts to the nodes C, D,. Show that you go.

In the example of FIG. 8A, since the circuit goes around the node A and returns to the node A, in step S28, Y
It will branch to ES. Then, here, a loop is extracted (S30), and a line is deleted (S31).
Here, the line is deleted from the lightest one based on the weight of the line. Therefore, in the example of FIG.
Line AB with the lightest weight in the line (weight "5")
Is deleted, and the nodes are connected as shown in FIG. If there are a plurality of lightest lines, for example, the one with the smaller sum of the weights of the nodes at both ends is deleted. This is because, in FIG. 9A showing a network configuration model different from the network configuration model of FIG. 8A, the lightest lines are the lines CD and AB, and the weight of each node is as shown in FIG. The sum of the weights of the both end nodes is “18” for the line CD, and “2” for the line AB.
3 ”, the line CD is deleted, and FIG.
The nodes are connected as shown in FIG. Even when the line to be deleted is not determined, the operator intervenes to select the line to be deleted by the mouse 1.
Deletion is performed by specifying using 8, for example. When the line is deleted in such a loop, the unprocessed line pointer is initialized (S32), the analysis node is returned to the origin node (S33), and the processing from step S23 is continued. As a result, even when a plurality of lines extend from the origin node, the analysis is performed on those lines and the loop is deleted. It is assumed that the main line is not to be deleted.

Next, the network structure / tree structure conversion processing will be described. In the processing up to the loop check processing, the connection relation of the database of a certain network structure model is shown in FIG.
If it has been changed as shown in (1), the root node is set (S41). The setting of the root node is
In the case where the display as shown in FIG. 13A is performed, a desired position of the root node (root) shown in FIG. Upon receiving this, the CPU 10 extracts a node on the main line and makes a connection with the root node (root) (S4).
2). If the depth is the same from the root node, that is, if the number of stages of connection is the same, such as nodes A, B, and D, the node with the larger weight of the node is arranged as a sibling node, and a sibling relationship is determined. (S43). In the example of FIG. 13, the weights of the nodes A, B, and D are “15”, “24”, and “21”, respectively, as shown in FIG. They are arranged in order from the left. Then, the data of this arrangement is stored in the area of the information of the tree structure model in the main storage device 11 (44), and the processed pointer is stored corresponding to each of the processed nodes B, D, and A (S45). .

Next, it is detected whether or not an unanalyzed node pointer remains, that is, whether or not there is a node whose sibling relationship or the like has not been checked (S46). (S4)
7) If there are a plurality of nodes having the same depth, the node having the larger node weight is arranged as a brother node, and a brother relationship is determined (S48). As a result, there are three nodes G, E, and C below the node B, and these are also arranged based on the weights as described above. The data of this arrangement is stored in the area of the tree structure type data in the main storage device 11 (S49), and a processed pointer is stored corresponding to each processed node (S50), and step S4 is performed.
Returning to step 6, the process is performed.

Thus, the tree structure model diagram shown in FIG. 13B is completed from the intermediate result shown in FIG. 13A. Then, a table (data similar to FIG. 6D) capable of generating the tree-structure model diagram is completed and stored in the main storage device 11 or the magnetic disk device 22. In the example of FIG. 13B, the weight of the node and the weight of the line are not displayed. However, as described with reference to FIG. Or they are displayed by color coding.

When the tree structure model (the same applies to the network structure model) is used for displaying the contents of the node information, the display instruction of the information contents is issued from the keyboard input device 14 or This can be performed by clicking the icon with the mouse 18 and clicking by designating a desired node. CPU 10 receiving this
The corresponding data from the main storage device 11 or the database storage unit 1 of the magnetic disk device 22 (for example, FIG.
5 is extracted, converted into display information, and output to the display control unit 16. Upon receiving this, the display control unit 16 displays the content of the data on the display device 17.

Further, after the information is converted into the tree structure model shown in FIG. 13A and batch printing of information in this tree structure is instructed from the keyboard input device 14 or by clicking an icon with the mouse 18, the CPU 10 executes the above operation. Based on the information in the table of the tree structure model, information is read from the database in the same manner as described above, converted into print information in a predetermined format, and transmitted to the printer control unit 19. Here, if there are a plurality of sibling nodes having the same depth from the root in the tree structure model, the data of the node with the larger weight among the sibling nodes is output. The data of the sibling nodes are read out sequentially from the lower side, and the "edit" under the "group", the "department" under it, and the "chapter" under it, Perform output.

That is, in the tree structure model shown in FIG. 14A (equivalent to FIG. 13B), the weights of nodes B, D, and A at the first depth from the root node are A large Node B is selected and the corresponding actual data is read from the database and printed. Further, control is performed such that the actual data of the node G having the larger weight among the sibling nodes is output for the lower nodes G, E, and C, and further, the weight having the larger weight among the sibling nodes is smaller for the lower nodes J and K. Control is performed to output the actual data of the node J. Then, the actual data of the node K is output from the lower side, and when there are no more nodes at this depth, the data is returned to the nodes E and C at the higher depth, and these are output. . As a result, as shown in the chapter title in FIG. 14B, the actual data categorizes the nodes B, D, and A into the largest classification (for example, group).
Below each, data of the classification (for example, edition) of the nodes G, E, C, I, and F follows, and for the nodes G and C, the nodes J and J of the lower classification (for example, section)
K and I are printed successively. Therefore, in the case of outputting a document, it is possible to obtain an output based on the table of contents of a book in which a layer is divided into layers and the next layer and the next layer are arranged below the layer. Is extremely convenient.

[0034]

As described above, according to the database management apparatus of the first aspect, a network structure model diagram including a display related to weights is output, and the weights of each node and each line in the network structure are used to calculate those weights. It is possible to appropriately know the degree of importance and the degree of connection, and this can be useful when searching for actual data.

As described above, according to the database management apparatus of the second aspect, information indicating a tree structure relationship is created by organizing nodes and reconstructing links between nodes based on a given threshold value. Based on the created information, each node is connected by a line, and the output including the display on the weight is output to the tree structure model diagram including the display on the weight, so the database is narrowed down to the tree structure. Conversion can be performed, and it becomes possible to know the relationship of a tree structure composed of only necessary data.

As described above, according to the database management apparatus of the third aspect, the degree of importance and the degree of connection of each node and each line are determined by the numerical value of the weight related to display,
Depending on the thickness of the line of the node frame and line, or its color,
It is easy to understand at a glance and convenient.

As described above, according to the database management device of the fourth aspect, the weight information of the arranged lines is added and set as the weight information of the line relating to the new link. The weight relating to the link is reflected on the new link, and there is an effect that the degree of new connection between nodes can be appropriately expressed by the weight.

As described above, according to the database management apparatus of the fifth aspect, in the case of conversion from a network structure to a tree structure, loop lines are deleted from a portion having a low degree of importance, and an appropriate tree structure is deleted. There is an effect that the model can be obtained.

As described above, according to the database management apparatus of the sixth aspect, even when there are a plurality of sibling nodes having the same depth from the root, the degree of their importance is represented by the arrangement. You can know the degree of importance from.

As described above, according to the database management apparatus of the present invention, the main line is determined based on the weight, and a tree structure model as if branching from the main line can be obtained.

As described above, according to the database management apparatus of the eighth aspect, in the case of outputting a document, the table of contents of a book in which the next level is further arranged below the level is divided. This is convenient because it is possible to obtain an output based on

As described above, according to the network structure / tree structure conversion method according to the ninth aspect, the nodes are arranged with respect to the information indicating the network relationship based on the given threshold value and the weight information. The link between the nodes is reconstructed, information indicating the relationship of the tree structure is created, the conversion to the tree structure is performed, and the node having the desired weight can be converted to the tree structure, which is convenient.

As described above, according to the network structure / tree structure conversion method of the tenth aspect, the main line is determined based on the weight, and a tree structure model can be obtained as if it branches off from the main line. .

[Brief description of the drawings]

FIG. 1 is a diagram showing a configuration of a database management device according to an embodiment of the present invention.

FIG. 2 is an exemplary block diagram showing a configuration example of a computer for realizing the database management device according to the embodiment of the present invention.

FIG. 3 is a flowchart for explaining a network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention;

FIG. 4 is a flowchart for explaining preprocessing in a network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention;

FIG. 5 is a diagram for explaining pre-processing in a network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention.

FIG. 6 is a diagram showing table contents to be changed in preprocessing in the network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention.

FIG. 7 is an exemplary view for explaining a main line process in a network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention;

FIG. 8 is a diagram illustrating a loop check process in a network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention.

FIG. 9 is a diagram for explaining a loop check process in a network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention;

FIG. 10 is a diagram showing weights of nodes in FIGS. 8 and 9;

FIG. 11 is a flowchart for explaining a loop check process in the network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention.

FIG. 12 is a flowchart illustrating a network structure / tree structure process in a network structure / tree structure conversion process performed by the database management device according to the embodiment of the present invention;

FIG. 13 is a view for explaining network structure / tree structure processing in network structure / tree structure conversion processing performed by the database management device according to the embodiment of the present invention;

FIG. 14 is a view for explaining print processing based on the result of the network structure / tree structure conversion performed by the database management device according to the embodiment of the present invention;

FIG. 15 is a diagram showing an example of a database having a network structure.

FIG. 16 is a diagram showing a case where the database having the network structure shown in FIG. 15 is converted into a tree structure;

FIG. 17 is a diagram for explaining an operation of designating a required node in the network structure model diagram.

FIG. 18 is a diagram for explaining a node deleting operation in the network structure model diagram.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 Database storage part 2 Network structure 3 Network structure model creation means 4 Output control means 5 Output means 6 Instruction means 7 Network structure / tree structure conversion means 8 Tree structure model creation means 10 CPU 11 Main storage device 12 Bus 13 Keyboard control unit 14 Keyboard input device 15 Display control unit 16 Display device 17 Mouse control unit 18 Mouse 19 Printer control unit 20 Printer 21 Magnetic disk control unit 22 Magnetic disk device 23 Communication interface 24 Communication processing unit

Claims (10)

[Claims] 1. A database management apparatus for managing a database in which a plurality of data are linked in a net-like manner. A network structure / weight information storage unit in which weight information of each node and line is stored as a line; and, based on the information of the network structure / weight information storage unit, each node is connected by a line and a display related to the weight is displayed. A network structure model creating means for creating display information of a network structure model diagram including: an output means for outputting information; and a weighting means in the output means based on the display information created by the network structure model creating means. Output control means for outputting a network structure model diagram including a display related to the database management device. 2. A database management apparatus for managing a database in which a plurality of data are linked in a net-like manner, wherein the information indicating the net-like relationship is used as a node for each piece of data's identification information as a node. A network structure / weight information storage unit in which weight information of each node and line is stored as a line; an instruction unit for giving various instructions; and a threshold value of a node to be converted into a tree structure from the instruction unit is given. Then, based on the threshold value, the network stored in the network structure / weight information storage means organizes nodes and reconstructs links between nodes to create information indicating a tree structure relationship. A structure / tree structure conversion unit, and a tree structure including lines for connecting each node based on the information created by the network structure / tree structure conversion unit, and including a display related to weights. A network structure model creating means for creating display information of the model diagram; an output means for outputting information; and a display relating to weights included in the output means based on the display information created by the tree structure model creating means. Output control means for outputting a tree structure model diagram; and a database management device comprising: 3. The display according to claim 1 or 2, wherein the display relating to the weight of the note and the line is performed by any of the numerical value of the weight, the thickness of the node frame and the line of the line, or the color thereof. Database management device. 4. The database management according to claim 2, wherein the network structure / tree structure conversion means adds weight information on the arranged lines and sets the weight information as a line weight on a new link. apparatus. 5. The database management apparatus according to claim 2, wherein the network structure / tree structure conversion means deletes a loop-like connection of the nodes based on the weight information when converting to a tree structure. 6. The database management apparatus according to claim 2, wherein the tree structure model creating means performs arrangement based on the weight information when there are a plurality of sibling nodes having the same depth from the root node. 7. The tree structure model creating means determines a main line based on weight information and arranges the nodes when there are a plurality of sibling nodes having the same depth from the root node when converting the tree structure model. 3. The database management device according to claim 2, wherein the management is performed. 8. The output control means, when outputting data of the database to the output means, includes a plurality of sibling nodes having the same depth from the root node in the tree structure model.
Output the data of the node with the larger weight among the sibling nodes,
Further, for the lower node, control is performed to output the data of the node with the larger weight among the sibling nodes, the data of the sibling nodes is sequentially read from the lower side, and the “edit” is displayed under the “group”, and the “edit” is displayed below the “group”. 3. The database management apparatus according to claim 2, wherein output is performed as if a "section" followed by a "chapter". 9. A network structure / tree structure conversion method for converting a relationship of a database in which a plurality of data are related in a mesh to a relationship represented by a tree structure, wherein identification information of each of the mesh data is set as a node, Weight information of each node and line when the connection between the pieces of identification information is a line, a threshold value of a node to be converted into a tree structure, and information indicating a net-like relationship based on the weight information based on the threshold value A network structure / tree structure conversion method, which comprises organizing nodes and reconstructing links between nodes to create information indicating a tree structure relationship. 10. When converting into a tree structure model, if there are a plurality of sibling nodes having the same depth from the root node,
10. The network structure / tree structure conversion method according to claim 9, wherein a tree structure is arranged by determining a main line based on the weight information.