JP3192898B2 - Database device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to utilization of a database. In particular, the present invention relates to a database device that logically separates a data structure and data in a relational database (RDB) or the like and displays the data as an easy-to-use database unique to a user using a tree, thereby improving operability.

[0002]

2. Description of the Related Art Conventionally, if a relational database is designed to meet the needs of many users, RDB
However, there is a disadvantage in that the structure becomes complicated, and in some cases, the database becomes difficult for the user to use.

[0003] When a search is performed on an RDB, a tree is formed and the formed tree is displayed on a screen.
There is a "method of optimizing an inquiry to a related database management system and a method of analyzing a syntax of a result" disclosed in JP-A-6-208491. The purpose of this conventional example is to make it easy for a user to make an inquiry to an RDB, and to display a complicated inquiry to the RDB in a tree view so as to be easily understood. That is, the displayed tree is a tree representing the execution plan of the query, not a tree representing the tables in the database.

[0004] Further, an "information retrieval method and apparatus" disclosed in Japanese Patent Application Laid-Open No. 14967/1991 expands a branch stepwise based on the purpose and judgment conditions of a user performing a search and forms a tree-based search. This is a technology that supports a user's decision-making by expressing it as a condition and further arranging and outputting information searched at a branch point of the tree for each purpose of judgment. As in the above-described conventional example, the inquiry to the RDB is displayed in a tree format in an easy-to-understand manner, and is not a tree for displaying the table itself in the database.

[0005] In addition, there has conventionally been a hierarchical display of a data structure and a relation (relation) of a database faithfully to a physical structure. However, a database table is hierarchically displayed so as to express a user's subjective intention. There was nothing to display. Therefore, a database device that allows a user to freely collect his / her necessary data and create categories without affecting the physical structure of the database has been realized.

[0006]

SUMMARY OF THE INVENTION The present invention has been made to solve the above problems, and has the following objects. (1) The user selects an arbitrary table in consideration of necessary data, and obtains a database device that can create a new category by himself. (2) Also, a database device that can easily reconstruct a category by copying or moving the created category is obtained. (3) Further, a database device capable of searching for a table included in the category is obtained.

[0007]

A database device according to the present invention has the following elements. (A) a database for storing data; (b) a tree creation unit for arbitrarily selecting data from the database and displaying the selected data in a tree format; and (c) a tree format created by the tree creation unit. Tree storage unit to store.

[0008] The tree creating section is characterized in that it has a tree copying section for copying a part or all of a tree already created by the tree creating section to another tree.

[0009] The tree creating section may further include a tree editing section for editing the tree already created by the tree creating section.

[0010] The database apparatus may further include a tree data processing unit for performing data processing on a part or all of the data of the tree created by the tree creating unit.

[0011] The tree data processing section includes a search section for searching for data.

The database device further includes an access right storage unit for storing an access right to data, and the tree creation unit refers to the access right stored in the access right storage unit, and accesses the accessible data. Is arbitrarily selected.

The database defines a data structure of the data, and the tree creating unit creates a tree independently of the data structure.

[0014]

In the database apparatus according to the present invention, the tree creating section displays data arbitrarily selected from the data stored in the database in a tree format. The tree storage unit stores the tree format created by the tree creation unit. For this reason, it can be displayed visually easily.

Further, the tree creating section of the present invention includes a tree copying section, and the tree copying section copies a part or all of the tree already created by the tree creating section to another tree. Thus, a new tree can be created using the already created tree.

Further, the tree creating unit further includes a tree editing unit, and the tree editing unit edits the tree already created by the tree creating unit. Therefore, the tree created once can be maintained so as to meet the user's request.

Further, in the above database device,
A tree data processing unit performs data processing on part or all of the data of the tree created by the tree data creation unit. For this reason, data processing can be instructed using the visually displayed tree.

Since the tree data processing section has a search section for searching data, the tree data processing section can specify data to be searched using the tree created by the tree creation section and perform a search.

Further, the database device includes an access right storage unit for storing an access right to data, and the tree creating unit refers to the access right stored in the access right storage unit, and stores accessible data. Select arbitrarily. As described above, by selecting data using the access right, information can be protected according to the rank of the user.

Furthermore, since the tree creating section of the present invention creates a tree independently of the data structure of the database, the user can set an arbitrary category and display using a tree customized for himself. Become.

[0021]

【Example】

Embodiment 1 FIG. FIG. 1 is a functional configuration diagram of the database device of the present invention. In the figure, 1 is a computer main body, 2 is a CRT for displaying messages to be input to the main body and messages and data to be output, and 3 is a database for storing data in a disk device or the like. Also,
Reference numeral 4 denotes a mouse used for inputting and operating data, and reference numeral 5 denotes a keyboard. Reference numeral 10 denotes a tree creating unit that creates a tree, 11 denotes a tree copying unit that copies the created tree,
Reference numeral 12 denotes a tree editing unit for editing the created tree. A tree storage unit 20 stores the tree created by the tree creation unit 10, a tree data processing unit 30 that performs data processing using the created tree, and a search unit 31. Reference numeral 21 denotes a tree created by the tree creating unit and displayed on the CRT 2. An access right storage unit 40 stores an access right to data.

FIG. 2 is a diagram for explaining the structure of a tree created by the tree creating unit 10. In the figure, 22a is called a top node, 22b is an intermediate node, and 22c is called a terminal node. The node refers to each element of the tree. FIG. 3 is a diagram showing the relationship between the terminal node and the table. In the figure, 22c is a terminal node,
23 is a table. As shown in FIG.
The terminal node “M” is associated with table A, and the terminal node “VRAM” is associated with table B.

Next, an operation for creating a tree will be described with reference to FIGS. Here, the shared tree 21a created in advance by the system administrator
The case where the user tree 21b is created by using the following will be described. As shown in FIG. 4, it is assumed that there is a shared tree 21a called “semiconductor” and a shared tree 21a called “quality information”. When a user newly creates a user tree 21b named USER1, the portion indicated by 24 of the shared tree "semiconductor" is changed to his own user tree "semiconductor".
Can be copied directly under the intermediate node 22b. Similarly, a portion indicated by 25 from the shared tree "quality information" can be copied under the intermediate node 22b "quality information" of the user tree created by the user. USE newly created by this operation
R1 is shown in FIG. Semiconductor, memory, SRA shown in FIG.
M, VRAM, and DRAM are all nodes. The highest node is called a top node. A node having no other nodes below itself is called a terminal node. Nodes other than the top node and the terminal node are called intermediate nodes.

In this embodiment, access rights are set in order to prevent data from being illegally referred to or updated. FIG. 6 is a diagram showing a table for setting an access right for each user. In the figure, 50 is a user name, 51 is a password, 52 is a reference right to refer to data, and 53 is an update right to update data. In this embodiment, access rights such as reference right and update right include A,
It is assumed that five ranks B, C, D, and E are set. For example, the user X has the reference right 52 of “A” and the update right 53 of “A”. The user Y has the reference right 52 of “E” and the update right 53 of “E”.

FIG. 7 is a diagram showing a table for setting an access right for each tree. In the figure, 54 is a tree name,
55 is a tree type. Reference numeral 50 denotes a user name as in FIG. 6, and reference numeral 52 denotes a reference right. The tree type 55 includes a shared tree and a user tree. The shared tree is represented by “C”, and the user tree is represented by “U”. For example, the tree of semiconductor is a shared tree because the tree type 55 is “C”, and the reference right is “A, C”. Further, since the tree of the quality information has the tree type 55 of “C”, it is known that the tree is a shared tree, and the reference right 52
Is "A, E". The shared tree is not owned by a specific user.
It is STEM. Also, since the user name 50 of the tree USER1 is “X”, it can be seen that the tree is owned by the user “X”. The tree type 55 indicates a user tree. The reference right 52 is “A,
B, C, D, and E ".
Next, when looking at the tree USER2, the user name 50 is “Y”, which is a user tree owned by the user “Y”, and the reference right 52 indicates all ranks. Here, the fact that all the reference rights are set in the user tree indicates that the user can refer to all the trees owned by the user. It also indicates that trees owned by other users cannot be browsed.

A tree that can be referred to by the user X will be described with reference to FIGS. 6 and 7. Since the reference right 52 is “A”, the user X can see from the reference right 52 shown in FIG. 7 that the user X can refer to the semiconductor which is the shared tree having the reference right and the quality information. In addition, USE, a tree owned by me
See also R1. Further, since the user Y has the reference right 52 of “E”, the user Y obtains the quality information of the shared tree and the USER2 of the tree owned by the user from the reference right 52 of FIG.
Can be referred to.

Here, of the access rights, only the reference right has been described. However, if the update right is defined for each tree in the access right setting table shown in FIG. 7, the update right can be similarly managed.

As described above, by setting the access right, the system administrator can provide information according to the rank of the user, and can set the confidential level of the information. Also, a large amount of data in a database can be divided using the concept of a tree. As a result, users do not see information on the database that they do not need,
This has the effect of making it easy to find the information that you need.

Next, the management of nodes will be described. FIG.
FIG. 3 is a diagram showing a table for defining nodes. In the figure, 54 is the tree name, 50 is the user name, 56 is the node I
D and 57 are node levels, 58 is a node name, 59 is an upper node ID, 60 is a type, 61 is a DB name, and 62 is a table name. The node ID 56 is an identifier for identifying a node. The node level 57 is a value indicating a node hierarchy. The node name 58 is a node name, and the upper node ID 59 is a node ID of an upper node that is higher than the node described in the node name 58. Type 60 indicates the type of node, “T” is a top node, “M” is an intermediate node, and “E” is a terminal node. As described above, since the terminal node is associated with the table, the DB name 61 and the table name 62 are defined in the row of the node whose type 60 is “E”. For example, the terminal node of SRAM is "DB1"
"Table A" of the database is defined. Similarly, a terminal node called VRAM has "DB1"
"Table B" of the database is defined. What is set in the terminal node is not limited to the table. A view that does not physically exist may be used. A view, unlike a physical table, is a set of only records that meet the conditions from one table.
A view in which a plurality of tables are combined to look like a single table is also called a view. That is, it is not stored and stored on a disk like a table constituting a database.

The node definition shown in FIG. 8 relates to the user tree "USER1" shown in FIG. The “parts information” is at the node level 1 and the upper node is “US”
1 ", the node" semiconductor "has a node level of 2, and the upper node is" BUH ". The “memory” has a node level of 3, and the upper node is “HA”.
"SRAM" is a terminal node having a node level of 4, and the upper node ID is "MEM". The node level 57 indicates the depth of the hierarchy from the top node, and which node level becomes the terminal node depends on the setting of the tree. For example, a node "SRAM" is set as a terminal node at node level 4, while a node "product 1" is set as node level 2
Is a terminal node having "HIN" as an upper node. The user tree “USER1” defines a table across two databases “DB1” and “DB2”.

As described above, it is possible to set tables and views over a plurality of databases in one tree. That is, the user can create a tree as he or she wants to use, without being conscious of the physical structure and location of the original database at all. Also, one table can be set for a plurality of trees. Furthermore, the names of nodes can be changed for the same table depending on the tree. Thereby, an easy-to-understand display according to the level of the user can be performed. For example, in a certain tree, the node name of the table S can be set as "MAXY series", and in another tree, the node name of the table S can be set as "Mitsubishi computer". Further, the intermediate nodes are not represented by reflecting the data structure in the database, but serve as a guide for the user to search for the terminal node. That is, the user can create a tree by arbitrarily setting a category required by the user.

As described above, the case where a tree is created for a database managed by one computer has been described as an embodiment of the present invention. However, the present invention may be applied to a system connected by a network. FIG. 9 is a configuration diagram of a network to which the present invention is applied.
In the figure, a center server 70 connects an engineering workstation (EWS) client 71 and a personal computer (PC) client 72 to form a local area network (LAN). The local server 73 connects a PC client 74 and a PC client 75 to form one local area network. Further, the local server 76, together with the PC client 77 and the PC client 78, forms another local area network. These local area networks are connected to a center server 7 by a wide area network (WAN) 79.
Connected to 0. In such a network configuration, the present invention can be applied, and each user can create his / her own tree using a database managed by all connectable servers.

Next, a specific method of using the system will be described with reference to a screen displayed on a CRT. FIG. 10 shows that after the user starts the database device of this embodiment, C
It is a figure showing the user login screen displayed on RT.
In the figure, reference numeral 80 denotes an area for inputting a user name. Reference numeral 81 denotes an area for inputting a password. Also, 8
Reference numeral 8 denotes an execution button. When the user inputs the user name and the corresponding password and then clicks Execute 88 with the mouse, a tree box shown in FIG. 11 is displayed. FIG.
In addition to the execution 88, buttons for operations such as clear, change password, and end are prepared in the user login screen shown in FIG.

Next, the tree box shown in FIG. 11 will be described. The tree box displays a list of trees that can be used by the logged-in user with icons as shown in the figure. For example, master management, parts information, personal tree, I
The tree dedicated to C, material information, and the like are trees. Reference numeral 82 denotes display, and reference numeral 83 denotes editing, which indicate functions that can be selected by the user in this tree box. Reference numeral 84 denotes a selection tree name, which indicates that a tree called component information is selected from the displayed icons. Also,
The selected component information 85 is underlined, and it can be recognized that the selected component information 85 is selected only by looking at the icon display in the tree box. When the display 82 is selected in the tree box shown in FIG. 11, an open 86 and an end 87 are displayed below the display menu as shown in FIG. When the user selects Open 86 here, FIG.
A tree of component information, which is a tree selected in the tree box shown in FIG. FIG. 13 shows a tree display screen. Below the title of the displayed screen is a menu of functions that can be selected from that screen. In this screen, a tree 90, a node 91, a screen 92, and a search 93 are prepared as a menu. Reference numeral 94 denotes a selected node name, which displays the name of a node selected from the nodes of the tree visually displayed on the tree display screen. Here, IC95 is selected. An arrow 96 on the right side of the IC 95 indicates a display state of a lower node. An operation for displaying a node will be described with reference to FIGS. FIG. 14 is a diagram showing an operation for displaying a lower node. Arrow 96 to the right of the node
Is a right-pointing arrow. When this arrow 96 is clicked on with a mouse, the lower nodes of the memory, “SRAM” and “DR”
AM and VRAM are displayed, and the arrow 96 changes to a left-pointing arrow. The lower nodes displayed by this operation are for one layer. If it is desired to display a layer below that, the user may click on the arrow corresponding to the selected node. FIG. 15 is a diagram illustrating an operation for deleting the displayed lower node. When the arrow on the left side of the node to be deleted, that is, the arrow 96 on the right side of the upper node of the node to be deleted is clicked, the display of the lower node is deleted, and the arrow 96 returns from the left arrow to the right arrow.

Next, a description will be given of data processing performed on a part or all of the data of the tree using the displayed tree. When a search 93 is designated from the menu on the tree display screen shown in FIG. 13, a search execution 100 and a node search 101 are displayed as shown in FIG. The node search is a search for the node name itself by specifying a condition for specifying the node name for the tree when it is not known which node of the tree corresponds to the target data. When the node search 101 is selected from the menu display shown in FIG. 16, a node name search window shown in FIG. 17 is displayed. In the figure, reference numeral 103 denotes an area for inputting a node name search condition. Reference numeral 104 denotes a search execution button. When the user inputs a search condition specified in the node name search condition 103 and clicks the search execution 104 with a mouse, a search is made for a node name that matches the specified condition in the tree. As a method of specifying a search condition, in addition to a character string match, a search for specifying a plurality of character strings to search for an exact match, a wildcard specification is possible. The wild card includes "*" that arbitrarily matches a plurality of characters and "?" Mark that matches any one character. By combining this wildcard with a character string that the user wants to specify, a forward match fuzzy search, a backward match fuzzy search, an intermediate match fuzzy search, and the like can be performed. In the example shown in FIG. 17, since the condition “* IC *” is specified, the search is made to search for a node including the character “IC” in the node name regardless of the character string before and after.

FIG. 18 shows a display screen of the node name search result. In the window of the node name search result window, a node name, an upper node name, a hierarchy level, and a node type (type) are displayed. As described above, since the terminal node corresponds to the table, if the user specifies the terminal node, the user can perform a parameter search for the table set in the terminal node. Performing a search on all attributes of the search target table is called a parameter search. For example, parameter attributes defined for each class of electronic components (if the class is a memory,
This is a case where (capacity, number of words, power consumption, etc.) is specified as a search condition. When the table to be searched is not known, an intermediate node can be designated, and a search can be performed on a plurality of terminal nodes below the intermediate node, that is, on a plurality of tables. This is called a common item search. In the case of a common item search, a search is performed by setting conditions for fields commonly owned by a plurality of tables to be searched.

Next, an operation example of the parameter search will be described with reference to the drawings. FIG. 19 is a diagram showing a display screen for inputting search conditions. When performing a parameter search, the user selects a terminal node in which a table to be searched is set from the tree display screen shown in FIG. Here, it is assumed that a MOS digital IC (C-MOS logic) is selected as a terminal node. FIG. 1 displayed when search 93 is selected
When a search execution 100 is designated from Step 6, a search condition input window shown in FIG. 19 is displayed. Since the table to be searched is already specified by the terminal node name, a field name for setting a search condition and an area for inputting the search condition are automatically prepared and displayed. When the user clicks a search condition area corresponding to a field for which a condition is desired to be set, the condition can be input. Here, the data including 74HC as the manufacturer model name and the DB registration date is 1
The condition is set to search for records that are on or after January 1, 900. When the search 106 is selected after inputting the conditions, a search result display window shown in FIG. 20 is displayed.

Next, the common item search will be described with reference to the drawings. When an intermediate node is selected from the tree display screen shown in FIG. 13 and a search 93 is selected, a search menu shown in FIG. 16 is displayed. When search execution 100 is specified from the search menu, a search is performed for common items in the table below the selected intermediate node. If there are a plurality of databases to be searched below the selected intermediate node, a database selection window is displayed. FIG. 21 is a view showing a database selection window displayed when there are a plurality of databases when performing a common item search. Here, for example, SHIZAI110, PNDB1
11, HINSHISU 112 are displayed, prompting the user to select. The user selects a database name to be searched, and clicks a search execution 113. Then, a search condition input window is displayed. The search condition input window is the same as in FIG. 19 shown in the parameter search described above. Further, the subsequent operations are the same as those in the case of the parameter search, and the description is omitted.

The parameter search and the common item search are performed as described above. The search result can be output to, for example, a file and used. FIG. 22 is a diagram showing a display example of a window for specifying output of a search result to a file. In the figure, reference numeral 115 denotes an area for inputting an output file name. The user can specify an arbitrary file name in the output file name input area 115. The output format 116 specifies the format of data when writing to a file. Here, a format that the system can support, such as a text format or a spreadsheet format, is displayed, and the user selects one of them. The output field designation 117 is for the user to designate which field of the database table to output. For example, the system prepares a specification such as all fields or only displayed fields. Output record specification 118
Is used to specify which of the records in the database table to output. Options are available to output all records in the table or only the records selected by the user.
A black square display 120 indicates that the user has selected the item from the prepared options. After all the designations have been made, when the execution 119 is clicked, a file is output according to the designated contents.

Next, a method of editing a tree will be described.
First, creation of a tree for newly generating a user tree will be described. When the edit 83 is selected while the tree box shown in FIG. 11 is displayed, an edit menu shown in FIG. 23 is displayed. Create New 13 in Edit Menu
1, copy 132, name change 133, and deletion 134.
The new creation 131 is selected from this edit menu. Then a tree name input window is displayed. FIG. 24 is a diagram of a tree name input window displayed when a new tree is created. In the figure, reference numeral 136 denotes a newly created tree name input area for inputting a name of a tree to be created. Reference numeral 137 denotes an execution button. The user inputs a tree name that he / she wants to create in the newly created tree name input area 136, and clicks the execution 137. FIG. 24 shows a case where a memory-only tree is input. When the execution 137 is clicked, a new user tree is created with the input name, and the newly created user tree is displayed as an icon in a tree box as shown in FIG. The owner of the newly created tree is the user who created the tree. Note that the tree name may be any name that does not duplicate the name of another tree, and is composed of any combination of kanji, kana, alphanumeric characters, and the like.

Next, a method of adding an intermediate node will be described. To add a branch to a newly created tree, an operation of adding an intermediate node is performed. Double-clicking the icon of the tree to which a node is to be added on the screen displaying the tree box as shown in FIG. 11, a tree display window as shown in FIG. 13 is displayed. If it is a newly created tree, select the top node. If the tree already has some nodes, select the upper intermediate node to which you want to add a node. The selection operation is performed by clicking the displayed node. Subsequently, the node 91 is selected to display a node menu. FIG. 25 shows a node menu. Create new 140, copy 1 in node menu
41, move 142, name change 143, and delete 144. When a new creation 140 is selected from among them, an intermediate node creation 145 and a terminal node creation 146 are displayed, and the intermediate node creation 145 is selected. Then, an intermediate node creation window is displayed. FIG. 26 shows an intermediate node creation window. In FIG. 26, 150
Is an input area for inputting a newly created node name. Reference numeral 151 denotes an execution button. While confirming that the name of the node selected by the user is displayed, the user inputs the name of the node to be created in the newly created node name input area 150 and selects Execute 151. Then, an intermediate node is added according to the specified content. The node name need only be the same as another node name of the same parent node, and is determined by any combination of kanji, kana, and alphanumeric characters.

Next, the copying of a node will be described. Copying a node is a task of copying a part of a tree that has already been created and saved to a tree that is currently being created.
There are two actual copying operation methods. One is an operation by a mouse, and the other is an operation by a node name designation.

First, the operation with the mouse will be described.
The node is copied while the tree is displayed in the tree display window shown in FIG. FIG. 27 is a diagram illustrating an operation of copying a node with a mouse. A case will be described in which a node "other company" is selected from the tree "quality information" shown in FIG. 27 and is copied below the node "personal" being created. The actual operation is to move the mouse pointer over the node of "other company", click the node of "other company" while holding down the control key on the keyboard, and do not release the clicked finger, the node of "personal" as it is Drag to. Drag is one of the mouse operation methods. Unlike a click of pressing and releasing a mouse button, this is an operation in which a target selected by pressing a mouse button at a certain position is moved to another position and a finger is released at a specified position after the movement. As a result of this operation, the node of "other company" is copied under the node of "personal" currently being created, and the node of "product A" that originally existed under the node of "other company" is also copied. Is done. In FIG. 27, the arrow indicating the dragging position is indicated by 155.

Next, an operation method by specifying a node name will be described. When the node name is specified, the operation is started from the tree display window shown in FIG. An intermediate node to be copied is selected from the nodes displayed in the tree display window, and then a node 91 is selected to display a node menu shown in FIG. When copy 141 is selected from the node menu, a node name copy window shown in FIG. 28 is displayed. In the figure, reference numeral 157 denotes an area for inputting a copy destination node name, and 158 denotes an execution button. In a copy destination intermediate node path name input area 157, a copy destination node name is input by a full path from the top node. And
Then, click Execute 158. Then, the selected intermediate node is copied immediately below the specified node. Here, the execution example of dragging while pressing the control key at the time of operation with the mouse has been described. However, other special keys may be used instead of the control key.

Next, the movement of a node will be described. As for the movement of the node, the operation by the mouse and the operation by designating the node name are possible in the same manner as the copying of the node described above. First, the operation using the mouse will be described with reference to FIG. 29. With the mouse, drag the node “other company” under the node “quality information” shown in FIG. 29 to the node “personal” as shown by an arrow 160 and release the button. The intermediate node “other company” is moved under the node “”, and the node “product A” below it is also moved. After the transfer is completed, the node "other company" and the node "product A" exist only under the node "personal" and no longer exist under the node "quality information".

Next, a method of moving a node by an operation by designating a node name will be described. This operation is performed by selecting a node on the tree display screen shown in FIG. After selecting a node to be moved, a node 91 shown in FIG.
Is displayed, and the move 142 is selected. Then, the node move window is displayed in the same format as the node copy window shown in FIG. 28, so while confirming the selected node name, input the destination intermediate node path name in the input area and press the execute button. Then, the node is moved in the same manner as the mouse operation. If a node having the same name as the movement source already exists at the specified movement destination, an error is displayed and the movement is not executed.

Next, the change of the node name will be described. When changing the name of the node, the node 91 is selected from the tree display screen shown in FIG. 13 and the node menu shown in FIG. 25 is displayed. When the name change 143 is selected from the node menu, a node name change window shown in FIG. 30 is displayed. In the figure, 165 is an area for inputting a node name to be changed, and 166 is an execution button. As a node whose name is to be changed prior to menu selection, the user inputs his / her name to be changed in the changed node name input area 165 while confirming that the selected node name is displayed in the selected node name, and executes 1
Click 66. Then, the node name changes to the specified name. Since a duplicate name can be specified for another node, if a duplicate occurs, an error is displayed and the change is not executed.

Next, the deletion of a node will be described. Deletion of a node is also performed by selecting a node to be deleted on the tree display screen shown in FIG. 13, selecting a node 91 and displaying a node menu. When deletion 144 is selected from the node menu shown in FIG. 25, a deletion confirmation window shown in FIG. 31 is displayed. As shown in FIG. 31, a message is displayed to confirm whether to delete the node name selected on the tree display screen. Run here 1
Clicking on 70 deletes the specified node and also deletes it from the tree display window.

Next, storage of a tree will be described. Saving a tree is an operation of storing a tree created and edited in accordance with the procedure described above in a tree storage unit. The tree is saved by selecting the tree 90 on the tree display screen shown in FIG. 13 and displaying the tree menu shown in FIG. In FIG. 32,
175 is save and 176 is end. Here, when the save 175 is selected, a tree save window is displayed. FIG. 33 is a diagram showing a tree saving window. In the figure, reference numeral 180 denotes a storage tree name area for displaying a name of a tree to be stored. Reference numeral 181 denotes an execution button. In the save tree name area 180, the name of the tree specified at the time of selecting save is already displayed. If the user wants to change the tree name and save the data, an operation of rewriting the tree name by overwriting the area 180 may be performed. When the execution 181 is clicked, the tree is saved with the name displayed in the save tree name area 180. Whenever any change is made to the tree, that is, when a node is added, deleted, or renamed, the tree must be saved.

Next, tree copying will be described. The tree copying operation is started by selecting a tree to be copied from the tree box shown in FIG. After selecting the tree, the edit 83 is selected to display the edit menu shown in FIG. The edit menu contains a new 210,
Functions such as copy 211, name change 212, and deletion 213 are provided. Here, by selecting the copy 211, a tree copy window is displayed. FIG. 35 shows a tree copy window. In the figure, reference numeral 220 denotes an area for inputting a copy tree name, and 221 denotes an execution button. When a tree name is input to the copy tree name 220 and the execution 221 is clicked, the selected tree is copied with a designated new name, and an icon is displayed in the tree box. At this time, the owner of the copied tree is the user who executed the copy.

Next, the change of the tree name will be described. The operation method of changing the name of the tree is almost the same as the operation method of copying the tree. The difference is that the name change 212 is selected from the edit menu shown in FIG. When the name change 212 is selected, a window having an area for inputting a name to be changed for the selected tree is displayed in a manner similar to the tree copy window shown in FIG. The user can change the name of the tree by inputting the name to be changed in the area and pressing the execution button. Only the user who is the owner of the tree can change the name. If another user mistakenly selects the tree to be changed, an error is displayed and the name is not changed.

Next, the deletion of a tree will be described. First, a tree to be deleted is selected from the tree box shown in FIG. 11, an edit 83 is selected from the edit menu, and an edit menu shown in FIG. 34 is displayed. When delete 213 is selected from the edit menu, a tree deletion confirmation window shown in FIG. 36 is displayed. In the tree deletion confirmation window, the name of the tree specified in the tree box is displayed, and a message for confirming whether to delete the tree is displayed. When the user clicks on Execute 223, the specified tree is deleted. As for the deletion, similarly to the name change, only the user who is the owner of the tree can delete the tree. Further, the user can delete only the user tree, and cannot delete the shared tree. FIG. 37 shows an example of an end confirmation screen for ending the system of the database device. The end confirmation screen is displayed by selecting the display 82 from the display menu of the tree box in FIG. 11, displaying the display menu shown in FIG. 12, and selecting the end 87. Clicking Execute 224 here terminates the system.

As described above, in this embodiment, a tree creation unit for selecting and creating a tree by selecting arbitrary data independently of the physical structure of the database and a tree creation unit The database device including the tree storage unit that stores the tree format has been described. Also,
The database device provided with the tree copying unit for copying a part or all of the tree already created by the tree creating unit to another tree has been described. In addition, the tree editing unit that performs editing other than copying on the tree created by the tree creating unit has been described. In addition, a database device that searches for data on a part or all of the created tree has been described.

Embodiment 2 FIG. In this embodiment, management of a shared tree will be described. The shared tree is newly created or modified by the system administrator. General users can refer to the shared tree and use it as their own user tree, but are not allowed to make changes to the shared tree. New generation and modification of the shared tree are performed by displaying the shared tree management window.
FIG. 38 is a diagram showing a tool box displayed only for the system administrator. By selecting the shared tree management 300 from this management toolbox and clicking on the execution 301, a shared tree management window shown in FIG. 39 is displayed. In the figure, 310 is a file, 320 is an edit, and a submenu is displayed by selecting each. In the window below, a list of shared tree names and reference rights A, B, C, D, and E is displayed.
Here, when the administrator selects the edit 320, an edit menu shown in FIG. 40 is displayed. The edit menu includes new creation 321, change privilege 322, edit 323, and change name 32.
4. There is provided a function of deleting 325. When a new creation 321 is selected here, a new tree creation window is displayed. FIG. 41 is a diagram showing a new tree creation window. In the figure, reference numeral 330 denotes a newly created tree name input area for inputting a name of a newly created tree, and reference numerals 331 to 335 denote columns for setting a reference right among access rights. Reference right A331, reference right B332,
The reference right C333 is displayed in black, indicating that the reference rights A, B, and C have been set in this tree. Further, the reference right D334 and the reference right E335 are displayed in white, which indicates that the reference right D and the reference right E are not set in the newly created tree. When the user clicks on Execute 340, a tree “electronic component catalog information” newly generated is displayed in the tree display window. Since it is a newly created tree, only the top node is displayed at first. Subsequently, intermediate nodes are added. FIG. 42 is a diagram showing a display screen when an intermediate node is newly created. In the figure, reference numeral 350 denotes an area for inputting the name of a newly created node.
1 is an execution button. The detailed operation method is the same as that of the tree editing described in the first embodiment, and thus the description is omitted. While confirming that the newly created tree name, that is, the top node name is displayed as the selected node name in the new intermediate node creation window shown in FIG. 42, enter the node name in the newly created node name input area 350. Clicking on Execute 351 creates a new node with the specified name. Similarly, when adding a terminal node, an intermediate node to which a terminal node is to be added is selected from the tree display window. Then, FIG.
, A new generation 140 and then a terminal node creation 146 are selected to display a terminal node creation window. FIG. 43 shows a diagram of a new terminal node creation window. In the figure, reference numeral 360 denotes an area for inputting the name of a newly created end node, and 362 denotes a database name list for designating a table associated with the end node. From the database list 362, for example, "P
When "NDB" is selected, the names of the tables in the selected database are displayed. 364 is a table name list. Database name list 362, table name list 364
If both cannot be displayed, the contents can be switched by scrolling, and a table desired to correspond to the corresponding terminal node can be selected from an arbitrary database. The system administrator inputs the name of the terminal node into the input area 360, specifies the database and the table name, and then clicks Execute 366 to create a new terminal node. As a result, the created terminal node is added to the tree. Note that the screen 92 and the search 93 cannot be selected in the tree display window shown in FIG. 13 displayed during this operation.
As described above, since the end node is directly associated with the table, it can be created only in the shared tree, and cannot be created in the user tree management.

Next, the operation of changing the privilege of the shared tree will be described. The operation of changing the privilege of the shared tree is started by selecting a tree from the shared tree management window shown in FIG. The administrator selects the tree whose privilege is to be changed, and selects the edit menu. Then, the edit menu shown in FIG. 40 is displayed, and when the user selects the privilege change 322, the privilege change window shown in FIG. 44 is displayed. In FIG. 44, reference numerals 371 to 375 denote column displays indicating the setting of the reference right among the access rights.
71, the reference right B372, and the reference right C373 are currently set. The display of the reference right D374 and the reference right E375 is white, indicating that the display is not currently set. By clicking an arbitrary column with a mouse, the state of “set / not set” can be switched. Then, the display on the screen is also switched from white to black according to the instruction. The administrator sets the access right by switching the display of the contents of the privilege that he / she wants to change, and clicks the execution 377. Then
The access right to the specified shared tree “electronic component catalog information” is changed.

In addition, editing and updating, including movement and copying, of the shared tree can be performed similarly to the user tree. The actual operation method is the same as the user tree editing described in the first embodiment, and a description thereof will be omitted.

Next, the change of the name of the shared tree will be described. When the administrator wants to change the name, he or she selects a tree whose name is to be changed from the shared tree management window shown in FIG. 39, and clicks edit 320 to display an edit menu shown in FIG. When a name change 324 is selected from the edit menu, a name change window shown in FIG. 45 is displayed. In the figure, reference numeral 380 denotes an area for inputting the changed tree name, and 381 denotes an execution button.
The administrator inputs the name of the tree to be changed in the change tree name input area 380 and clicks Execute 381 to execute the change of the name of the selected tree.

The same operation as the above-described name change is performed for deleting the shared tree. That is, when a tree to be deleted is selected in the shared tree management window and a delete 325 is selected from the edit menu, a delete confirmation window shown in FIG. 46 is displayed. As shown in FIG. 46, a message prompting confirmation of whether or not to delete the shared tree is displayed together with the name of the tree selected as a deletion target. Done.

As described above, in this embodiment, the editing of the shared tree executed by the system administrator has been described.

Embodiment 3 FIG. In the above-described embodiment, the user tree is configured to be accessed by a user having ownership. The user tree is the same as the shared tree.
If the access rights (reference right, update right) match, access may be made possible.

Embodiment 4 FIG. In the above-described embodiment, only one access right is specified for each user, but a plurality of access rights may be specified. FIG. 47 is a diagram illustrating a setting example of a user access right. In the figure, "1" indicates that the access right is set. User X has reference rights A, B, E and update rights A, B.
Further, the user Y has reference rights B and E and update right E. As described above, data and trees may be managed by using a plurality of access rights specified for each user.

Embodiment 5 FIG. Access rights may be set for each database, table, or field.

Embodiment 6 FIG. In the tree box, the user tree and the common tree may be displayed separately. Also,
All trees may be displayed in the tree box, and trees without access rights may be displayed in a neutral color to distinguish them from trees with access rights.

Embodiment 7 FIG. When performing a common item search, instead of selecting only one from a plurality of databases, a plurality of databases may be selectable. In that case, the search is performed in the order of selection, and after the search of one database is completed, the search of the next selected database is performed. Alternatively, a method may be used in which windows are opened by the number of selected databases and the user performs an operation of switching windows to specify which database is to be searched.

[0065]

According to the database apparatus of the present invention, since the tree creating section arbitrarily selects data stored in the database and displays the data in a tree format, the user can easily display only necessary data. Further, since the tree format is stored in the tree storage unit, the created tree can be used at any time.

Further, since the tree creating section of the present invention includes the tree copying section, another tree can be created by using a part or all of the already created tree. Thus, it is not necessary to newly create the entire tree, and the tree can be efficiently created.

Further, since the tree creating section of the present invention includes the tree editing section, the tree editing section can arbitrarily edit the tree according to the user's request, and can obtain a tree which is more user-friendly.

Further, since the database device of the present invention includes the tree data processing unit, data processing can be performed on a part or all of the data of the tree created by the tree creating unit. As a result, data processing can be performed using a tree that is easy for the user to use without directly being aware of the database.

Further, by providing the search unit, the search of the database can be performed intuitively using the tree.

Further, by providing the access right storage unit, it is possible to arbitrarily select accessible data. Therefore, the data used by the user can be restricted,
Data can be protected.

In the database device of the present invention, a tree is created independently of the data structure.
A user-friendly data structure can be created in a tree without affecting the structure of the database.

[Brief description of the drawings]

FIG. 1 is a functional configuration diagram of a database device of the present invention.

FIG. 2 is a configuration diagram of a tree according to the present invention.

FIG. 3 is a diagram showing a relationship between a terminal node and a table according to the present invention.

FIG. 4 is a diagram illustrating the creation of a user tree according to the present invention.

FIG. 5 is a diagram illustrating creation of a user tree according to the present invention.

FIG. 6 is a diagram showing a table for setting an access right according to the present invention.

FIG. 7 is a diagram showing a table for setting an access right according to the present invention.

FIG. 8 is a diagram showing a table defining a node according to the present invention.

FIG. 9 is a network configuration diagram according to the present invention.

FIG. 10 is a diagram showing a display screen when the system according to the present invention is started.

FIG. 11 is a diagram showing a display screen when the system according to the present invention is started.

FIG. 12 is a diagram showing a part of a display screen according to the embodiment of the present invention.

FIG. 13 is a diagram of a tree display screen according to the embodiment of the present invention.

FIG. 14 is a diagram showing a display operation of a lower node according to the present invention.

FIG. 15 is a diagram showing a display operation of a lower node according to the present invention.

FIG. 16 is a diagram showing a part of a display screen according to the embodiment of the present invention.

FIG. 17 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 18 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 19 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 20 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 21 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 22 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 23 is a diagram showing a part of a display screen according to the embodiment of the present invention.

FIG. 24 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 25 is a diagram showing a part of a display screen according to the embodiment of the present invention.

FIG. 26 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 27 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 28 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 29 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 30 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 31 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 32 is a diagram showing a part of a display screen according to the embodiment of the present invention.

FIG. 33 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 34 is a diagram showing a part of a display screen according to the embodiment of the present invention.

FIG. 35 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 36 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 37 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 38 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 39 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 40 is a diagram showing a part of a display screen according to the embodiment of the present invention.

FIG. 41 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 42 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 43 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 44 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 45 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 46 is a diagram of a display screen according to the embodiment of the present invention.

FIG. 47 is a diagram showing a table for setting an access right for each user name according to the present invention.

[Explanation of symbols]

1 body, 2 CRTs, 3 databases, 4 mice, 5 keyboards, 10 tree creating section, 11 tree copying section, 12 tree editing section, 20 tree storage section,
21 tree, 21a shared tree, 21b user tree, 22 nodes, 22a top node, 22b
Intermediate node, 22c Terminal node, 23 tables, 30
Tree data processing unit, 31 search unit, 40 access right storage unit, 50 user name, 51 password, 52
Reference right, 53 Update right, 54 Tree name, 55 Tree type, 56 Node ID, 57 Node level, 58
Node name, 59 upper node ID, 60 type, 6
1 DB name, 62 table name.

──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Shigemi Hashimoto 325 Kamimachiya, Kamakura City Mitsubishi Electric Corporation Information System Works (72) Inventor Ryoji Igushi 325 Kamimachiya Kamakura City Information System Works Mitsubishi Electric Corporation (72) Inventor Shunsuke Mimura 325 Kamimachiya, Kamakura City Mitsubishi Electric Corporation Information Systems Works (72) Inventor Seiichi Amada 325 Kamimachiya Kamakura City Information Systems Works Mitsubishi Electric Corporation (56) References JP-A-5-73383 (JP, A) JP-A-63-100562 (JP, A) JP-A-4-191941 (JP, A) JP-A-2-122348 (JP, A) JP-A-5-89178 (JP, A) JP-A-1-282634 (JP, A) JP-A-5-342075 (JP, A) JP-A-5-61920 (JP, A) JP-A-63-288344 (JP A) JP-A-5-128157 (JP, A) JP-A-6-251064 (JP, A) JP-A-6-208401 (JP, A) JP-A-7-160553 (JP, A) JP-A-7 -84858 (JP, A) (58) Fields investigated (Int. Cl. ⁷ , DB name) G06F 17/30 G06F 12/00 JICST file (JOIS)

Claims (6)

(57) [Claims] 1. A table with one or more fields.
The database to be stored and the nodes are defined as nodes of the hierarchical tree.
Tree that stores the node definition table for registering the tree
And憶部, constant in the node definition table stored in the tree storage unit
Defined nodes and tables stored in the above database
Arbitrarily select at least one of
Tree creation part that creates a key and registers it in the node definition table
A database apparatus having the door, is the node definition table node hierarchy intermediate, end
A node tie indicating which of the ends the node is located at
And the database device also stores the node definition table.
A tree is displayed at the same time as the
When searching the remembered table, the displayed tree is displayed.
User to select a node on the
Node type is a node located in the middle of the hierarchical structure
If it indicates, refer to the node definition table
Multiple tables under the selected node are common
To set search conditions for fields
Characterized by having a search unit for searching for files
Base device. 2. The database apparatus according to claim 1, wherein the tree creating unit includes a tree copying unit that copies a part or all of the tree already created by the tree creating unit to another tree. . 3. The database device according to claim 1, wherein the tree creating unit further includes a tree editing unit that edits a tree already created by the tree creating unit. 4. The database device according to claim 1, further comprising a tree data processing unit for performing data processing on part or all of the data of the tree created by the tree creating unit. Database device as described. 5. The database device according to claim 1 , further comprising:
An access right storage unit for storing an access right to the
The tree creation unit was memorize the access right storage section A
Access rights and select any accessible data
The method according to any one of claims 1 to 4, wherein
Database device. 6. The database according to claim 1, wherein the database is a database of the data.
Data structure, and the tree creation unit defines the data structure
Creating a tree independent of
2. The database device according to 1.