JPH08171571A - Data base device - Google Patents

Abstract

PURPOSE: To enable a user to select an arbitrary table in consideration of necessary data and generate a new category by himself or herself by arbitrarily selecting data out of a data base, displaying the selected data in a tree form, and storing the generated tree form. CONSTITUTION: This data base device is equipped with the data base 3 which stores data, a tree generation part 10 which optionally selects data in the data base 3 and displays the selected data in the tree form, and a tree storage part 20 which stores the tree form generated by the tree generation part 10. This tree generation part 10 is equipped with a tree editing part 12 which edits the tree 21 generated by the tree generation part 10. Consequently, the tree generation part 10 generates the tree 21 independently of the data structure of the data base 3, so the user sets an arbitrary category and can display data by using the tree 21 customized for the user himself or herself.

Description

Detailed Description of the Invention

[0001]

FIELD OF THE INVENTION This invention relates to the use of databases. In particular, the present invention relates to a database device which enhances operability by logically separating a data structure and data in a relational database (RDB) or the like and displaying them as a user-specific database using a tree.

[0002]

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

In addition, when searching the RDB, a tree is formed and the formed tree is displayed on the screen.
There is "a method of optimizing an inquiry to a related database management system and a method of parsing a result" disclosed in Japanese Patent Laid-Open No. 6-208491. This conventional example aims at allowing the user to easily make an inquiry to the RDB, and makes the complicated inquiry to the RDB easy to understand by displaying it in a tree. That is, the displayed tree is a tree showing the execution plan of the query, not a tree showing the tables in the database.

Further, the "information retrieval method and its apparatus" disclosed in Japanese Patent Laid-Open No. 4-149674 discloses a tree formation by gradually expanding branches based on the purpose and the judgment condition of the user who conducts the retrieval. It is a technology that supports the user's decision making by expressing it as a condition and further organizing and outputting the information retrieved at the branch point of the tree according to the purpose of the decision. Similar to the above-mentioned conventional example, an inquiry to the RDB is displayed in a tree form in an easy-to-understand manner, not a tree displaying the table itself in the database.

[0006] Further, although there has been a conventional one that hierarchically displays the data structure and the relation (relation) of the database in a faithful manner to the physical structure, the database table is hierarchically displayed so as to represent the subjective intention of the user. There was nothing to display. Therefore, there has not been realized a database device in which a user can freely collect his / her necessary data and create categories without affecting the physical structure of the database.

[0006]

The present invention has been made to solve the above problems, and has the following objects. (1) A user selects an arbitrary table in consideration of necessary data and obtains a database device capable of creating a new category by himself / herself. (2) Further, by obtaining or copying a created category, a database device can be reconstructed easily. (3) Further, a database device capable of searching the tables included in the category is obtained.

[0007]

The database device of the present invention is characterized by having the following elements. (A) a database that stores data, (b) a tree creation unit that arbitrarily selects the data in the database and displays the selected data in a tree format, and (c) a tree format created by the tree creation unit. Tree storage unit to store.

The tree creating unit is characterized by including a tree copying unit for copying a part or all of the tree already created by the tree creating unit to another tree.

The tree creating section is characterized by further including a tree editing section for editing the tree already created by the tree creating section.

The database device is further characterized by further comprising a tree data processing unit for processing data of part or all of the tree created by the tree creating unit.

The tree data processing section is characterized by comprising a search section for searching data.

The database device further includes an access right storage unit for storing access right to data, and the tree creating unit refers to the access right stored in the access right storage unit to access 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 device of the present invention, the tree creating section displays the data arbitrarily selected from the data stored in the database in the tree format. In addition, the tree storage unit stores the tree format created by the tree creation unit. For this reason, it can be displayed visually easily.

The tree creating unit of the present invention includes a tree copying unit, and the tree copying unit copies a part or all of the tree already created by the tree creating unit to another tree. As a result, a new tree can be created by using the already created tree.

The tree creating section further includes a tree editing section, and the tree editing section edits the tree already created by the tree creating section. Therefore, the created tree can be maintained to meet the user's request.

In the above database device,
The tree data processing unit performs data processing on part or all of the data of the tree created by the tree data creation unit. Therefore, data processing can be instructed using the visually displayed tree.

Further, since the tree data processing section is provided with the search section for searching the data, it is possible to specify the search target data and perform the search using the tree created by the tree creating section.

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

Further, since the tree creating unit 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 / herself. Become.

[0021]

【Example】

Example 1. FIG. 1 is a functional block diagram of the database device of the present invention. In the figure, 1 is a main body of a computer, 2 is a CRT which displays messages and data output to the main body, and 3 is a database which stores data in a disk device or the like. Also,
Reference numeral 4 is a mouse used for data input and operation, and 5 is a keyboard. Reference numeral 10 is a tree creating unit for creating a tree, 11 is a tree copying unit for copying the created tree,
Reference numeral 12 is a tree editing unit for editing the created tree. Reference numeral 20 is a tree storage unit that stores the tree created by the tree creation unit 10, 30 is a tree data processing unit that performs data processing using the created tree, and 31 is a search unit. Reference numeral 21 is a tree created by the tree creation unit and displayed on the CRT 2. An access right storage unit 40 stores the access right to the data.

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

Next, the operation of creating a tree will be described with reference to FIGS. 4 and 5. Here, the shared tree 21a created in advance by the system administrator.
A case where the user tree 21b is created by using 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 in the shared tree “semiconductor” is his own user tree “semiconductor”.
Copying can be performed as it is under the intermediate node 22b. Similarly, the portion indicated by 25 can be copied from the shared tree of "quality information" under the intermediate node 22b of "quality information" of the user tree created by himself. 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 the top node. A node that has no other nodes below itself is called a terminal node. Nodes other than the top node and the end nodes are called intermediate nodes.

In this embodiment, the access right is set in order to prevent the data from being illegally referenced 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 reference data, and 53 is an update right to update data. In this embodiment, access right such as reference right or update right is 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”. Further, 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. Further, 50 is a user name as in FIG. 6, and 52 is 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 semiconductors is a shared tree because the tree type 55 is “C”, and the reference right is “A, C”. In addition, since the tree type 55 of the quality information tree is “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, so the user name 50 is SY.
It is STEM. Further, 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, E ”and all five ranks are shown.
Next, looking at the tree USER2, it can be seen that the user name 50 is “Y”, the user tree is owned by the user “Y”, and the reference right 52 indicates all ranks. Here, all the reference rights are set in the user tree, which means that the user can refer to all the trees owned by the user. It also indicates that the tree owned by another user cannot be referenced.

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

Of the access rights, only the reference right has been described here. 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 managed in the same manner.

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 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 in the database that they do not need,
The effect is that you can easily find the information you need.

Next, node management will be described. FIG.
FIG. 6 is a diagram showing a table defining a node. In the figure, 54 is a tree name, 50 is a user name, and 56 is a 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 that identifies a node. The node level 57 is a value indicating the hierarchy of nodes. The node name 58 is a node name, and the upper node ID 59 is a node ID of an upper node that is a higher level of the node described in the node name 58. The type 60 indicates the type of node, “T” indicates the top node, “M” indicates the intermediate node, and “E” indicates the end node. As described above, since the table is associated with the end node, the DB name 61 and the table name 62 are defined in the row of the node whose type 60 is “E”. For example, "DB1" is assigned to the terminal node called SRAM.
“Table A” of the database is defined. Similarly, for the end node called VRAM, "DB1"
"Table B" of the database is defined. Further, the table is not necessarily set in the end node. A view that does not physically exist can be used. Unlike a physical table, a view is a set in which only records that meet the conditions are selected from one table.
Also, a view in which a plurality of tables are combined to look like one table is called a view. In other words, it is not stored and stored on the disk like the table forming the database.

The node definition shown in FIG. 8 relates to the user tree "USER1" shown in FIG. "Parts information" has a node level of 1, and the upper node is "US
1 ”, the node“ semiconductor ”has a node level of 2, and the upper node is“ BUH ”. The node level of "memory" is 3, and the upper node is "HA".
In addition, “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 is the terminal node depends on the tree setting. For example, the node "SRAM" is set as the terminal node at the node level 4, but the node "Product 1" is set at the 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 that span a plurality of databases in one tree. That is, the user can create a tree as he or she wants to use it, without being aware of the physical structure of the original database or the place where the original database exists. Also, one table can be set to multiple trees. Further, the name of the node can be changed depending on the tree for the same table. Thereby, an easy-to-understand display according to the user's level becomes possible. For example, the node name of the table S can be set to "MAXY series" in one tree, and the node name of the table S can be set to "Mitsubishi's personal computer" in another tree. Further, the intermediate node does not reflect the data structure in the database, but serves as a guide for the user to search for the end node. In other words, the user can create a tree by arbitrarily setting the category that he or she needs.

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

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

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 C-only tree and the material information are the trees. Reference numeral 82 is a display, and 83 is an edit, which shows the functions that the user can select in this tree box. Reference numeral 84 denotes a selection tree name, which indicates that a tree called parts information is selected from the displayed icons. Also,
The selected component information 85 is underlined, and it can be identified that the component information 85 is selected simply by looking at the icon display in the tree box. When the display 82 is selected in the tree box shown in FIG. 11, the open 86 and the end 87 are displayed under the display menu as shown in FIG. When the user selects the open 86 here, FIG.
A tree of component information, which is the tree selected in the tree box shown in, is displayed. 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. On 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 node name selected from the nodes of the tree visually displayed on the tree display screen. Here, IC95 is selected. The arrow 96 on the right side of the IC 95 indicates the display state of the lower node. An operation of displaying a node will be described with reference to FIGS. 14 and 15. 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, it is a lower node of the memory "SRAM""DR
“AM” and “VRAM” are displayed, and the arrow 96 changes to a leftward arrow. The lower node displayed by this operation is for one layer. To display the hierarchy below it, click the arrow corresponding to the selected node. FIG. 15 is a diagram for explaining an operation for deleting the displayed lower node display. 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 leftward arrow to the rightward arrow.

Next, a description will be given of the data processing performed on the data of a part or all of the tree using the displayed tree. When the search 93 is specified from the menu of 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 in the tree when it is not known which node in the tree the target data corresponds to. When the node search 101 is selected from the menu display shown in FIG. 16, the node name search window shown in FIG. 17 is displayed. In the figure, 103 is an area for inputting node name search conditions. Further, 104 is a button for executing a search. When the user inputs a search condition to be specified in the node name search condition 103 and clicks the search execution 104 with a mouse, a node name matching the specified condition in the tree is searched. As a method for specifying the search condition, in addition to a match of character strings, a search for specifying a perfect match by specifying a plurality of character strings, a wild card can be specified. A wild card has a “*” mark that matches a plurality of characters and a “?” Mark that matches a single character. By combining this wildcard with a character string you want to specify, you can perform fuzzy search with prefix match, fuzzy search with suffix match, and fuzzy search with intermediate match. In the example shown in FIG. 17, since the condition "* IC *" is specified, it is specified to search for a node including the character "IC" in the node name regardless of the preceding and following character strings.

FIG. 18 shows a display screen of the node name search result. A node name, a higher node name, a hierarchy level, and a node type are displayed in the window of the node name search result window. As described above, since the end node corresponds to the table, the user can specify the end node and perform the parameter search for the table set in the end node. Performing a search for all attributes of the search target table is called a parameter search. For example, parameter attributes defined for each category of electronic parts (if the category is memory,
This is the case when specifying search conditions such as capacity, number of words, and power consumption. Further, when the table to be searched is not known, an intermediate node can be designated, and a search can be performed targeting a plurality of terminal nodes below the intermediate node, that is, 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 the fields that a plurality of search target tables have in common.

Next, an example of a parameter search operation will be described with reference to the drawings. FIG. 19 is a diagram showing a display screen for inputting search conditions. The parameter search is performed by selecting the end node in which the table desired to be searched by the user is set from the tree display screen shown in FIG. 13 and selecting the search 93. Here, it is assumed that a MOS digital IC (C-MOS logic) is selected as the terminal node. Figure 1 displayed when Search 93 is selected
When the search execution 100 is designated from 6, the search condition input window shown in FIG. 19 is displayed. Since the table to be searched is already specified by the end node name, the field name in which the search condition can be set and the area for inputting the search condition are automatically prepared and displayed. When the user clicks the search condition area corresponding to the field in which the condition is desired to be set, the condition can be input. Here, the data including 74HC as the maker model name has a DB registration date of 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, the 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 search 93 is selected, a search menu shown in FIG. 16 is displayed. When the search execution 100 is specified from the search menu, the common items in the table below the selected intermediate node are searched. If there are multiple databases to be searched below the selected intermediate node, the database selection window is displayed. FIG. 21 is a diagram showing a database selection window displayed when there are a plurality of databases when performing a common item search. Here, for example, SHIZAI110, PNDB1
Three databases, 11, HINSHITSU112, are displayed to prompt the user to select. The user selects a database name to search and clicks search execution 113. Then, the search condition input window is displayed. The search condition input window is the same as that shown 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, so the description thereof will be omitted.

As described above, the parameter search and the common item search are performed. The result of the search can be output to a file or the like for use. FIG. 22 is a diagram showing a display example of a window for designating the output of the search result to a file. In the figure, 115 is an area for inputting an output file name. The user can specify an arbitrary file name in this output file name input area 115. The output format 116 is for designating 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 from the formats. The output field designation 117 is for the user to designate which field of the database table is to be output. For example, the system provides a designation such as all fields or only displayed fields. Output record specification 118
Is for specifying which record is output from the records in the database table. Options are available such as outputting all records in the table or only the records selected by the user.
The black square display 120 indicates that the user has selected the item from the prepared options. After all the designations have been made, clicking execute 119 causes the file to be output according to the designated contents.

Next, the tree editing method will be described.
First, the creation of a tree for newly creating a user tree will be described. When the edit 83 is selected when the tree box shown in FIG. 11 is displayed, the edit menu shown in FIG. 23 is displayed. New in the edit menu 13
1, copy 132, name change 133, and delete 134.
The new creation 131 is selected from this edit menu. Then the tree name input window is displayed. FIG. 24 is a diagram of a tree name input window displayed when creating a new tree. In the figure, 136 is a newly created tree name input area for inputting the name of a tree to be created. 137 is an execute button. The user inputs the tree name that he or she wants to create in the newly created tree name input area 136, and clicks execute 137. FIG. 24 shows the case where the memory-only tree is input. When 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 the tree box as shown in FIG. 11. The owner of the newly created tree is the user who created the tree. The tree name may be any name that does not overlap with the names of other trees, 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 branches and leaves to the newly created tree, add an intermediate node. When the tree box as shown in FIG. 11 is displayed on the screen and the icon of the tree to which the node is to be added is double-clicked, the 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 nodes. The selection operation is performed by clicking the displayed node. Then, the node 91 is selected and the node menu is displayed. FIG. 25 is a diagram showing a node menu. New 140 in node menu, copy 1
41, move 142, name change 143, and delete 144. When the new creation 140 is selected from these, the intermediate node creation 145 and the end node creation 146 are displayed, and the intermediate node creation 145 is selected. Then, the intermediate node creation window is displayed. FIG. 26 is a diagram showing an intermediate node creation window. In FIG. 26, 150
Is an input area for inputting a newly created node name. Further, 151 is an execute 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 execution 151. Then, the intermediate node is added according to the specified content. The node name may be any node name that does not overlap with other node names of the same parent node, and is determined by an arbitrary combination of kanji, kana, and alphanumeric characters.

Next, 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 the tree that is currently being created.
There are two methods for actual copying operation. One is a mouse operation and the other is a node name operation.

First, the operation with the mouse will be described.
A node is copied by displaying the tree 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 called "other company" is selected from the tree called "quality information" shown in FIG. 27 and copied under the "personal" node currently being created. The actual operation is to move the mouse pointer to the "other company" node, click the "other company" node while holding down the control key on the keyboard, and without releasing the clicked finger, the "personal" node Drag to. Dragging is one of the mouse operating methods. Unlike click, which pushes and releases the mouse button, it is an operation of pushing the mouse button at a certain position to move the selected object to another position and releasing the finger at the designated position after the movement. As a result of this operation, the node "other company" is copied under the node "personal" that is currently being created, and the node "product A" originally existing under the node "other company" is also copied. To be done. In FIG. 27, an arrow 155 indicating the drag position is shown.

Next, the operation method by specifying the node name will be described. Also in the case of specifying the node name, the operation is started from the tree display window shown in FIG. 13 similarly to the operation with the mouse described above. The intermediate node to be copied is selected from the nodes displayed in the tree display window, and then the node 91 is selected to display the node menu shown in FIG. When the copy 141 is selected from the node menu, the node name copy window shown in FIG. 28 is displayed. In the figure, 157 is an area for inputting the node name of the copy destination, and 158 is an execute button. In the area 157 for inputting the copy destination intermediate node path name, the copy destination node name is input with the full path from the top node. And
Then click Execute 158. Then, the selected intermediate node is copied right below the designated node. Here, an example of execution is shown in which the control key is dragged while the mouse is operated, but other special keys may be used instead of the control key.

Next, the movement of nodes will be described. As for the node movement, the mouse operation and the node name designation operation can be performed in the same manner as the node copying described above. First, the operation with the mouse will be described with reference to FIG. When the node "other company" under the node "quality information" shown in FIG. 29 is dragged with the mouse and dragged to the node "personal" as indicated by an arrow 160 and the button is released, "personal" The intermediate node "other company" is moved under the node "", and the node "Product A" under it is also moved at the same time. After the movement is completed, the node "other company" and the node "product A" exist only under the node "personal" and not under the node "quality information".

Next, a method for moving a node by an operation by designating a node name will be described. This operation is also performed by selecting a node on the tree display screen shown in FIG. 13, similarly to the operation with the mouse. After selecting the node to be moved, select the node 91 shown in FIG.
The node menu shown in 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, and while confirming the selected node name, enter the move destination intermediate node path name in the input area and press the execute button. Then, the node is moved similarly to the operation with the mouse. If the specified destination already has a node with the same name as the source, an error is displayed and the migration is not executed.

Next, the node name change will be described. When changing the node name, the node 91 is selected from the tree display screen shown in FIG. 13 to display the node menu shown in FIG. When the name change 143 is selected from the node menu, the 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 execute button. As the node whose name is to be changed prior to the menu selection, the user inputs the 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 name that overlaps with other nodes can be specified, if a duplicate occurs, an error will be displayed and the change will not be executed.

Next, the node deletion will be described. A node is also deleted by selecting the node to be deleted on the tree display screen shown in FIG. 13 and selecting the node 91 to display the node menu. When Delete 144 is selected from the node menu shown in FIG. 25, the deletion confirmation window shown in FIG. 31 is displayed. As shown in FIG. 31, a message confirming whether the node name selected on the tree display screen can be deleted is displayed. Run here 1
When 70 is clicked, the specified node is deleted and also deleted from the tree display window.

Next, the storage of the tree will be described. The saving of the tree is an operation of storing the tree created and edited according to the procedure described so far in the 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 a save and 176 is an end. If Save 175 is selected here, a tree save window is displayed. FIG. 33 is a diagram showing a tree saving window. In the figure, reference numeral 180 denotes a saved tree name area for displaying the name of the tree to be saved. 181 is an execute button. In the save tree name area 180, the name of the tree specified at the time of selecting save is already displayed. If it is desired to change the tree name and save it, the operation of overwriting the area 180 and rewriting the tree name may be performed. When the execution 181 is clicked, the tree is saved with the name displayed in the saved tree name area 180. When any change is made to the tree, that is, when a node is added, deleted, or renamed, the tree must be saved.

Next, the copying of the tree will be described. The tree copy operation starts by selecting the 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. In the edit menu, create new 210,
Functions such as copy 211, name change 212, and delete 213 are prepared. By selecting the copy 211 here, a tree copy window is displayed. FIG. 35 is a diagram showing a tree copy window. In the figure, 220 is an area for inputting a copy tree name, and 221 is an execute button. When the tree name is input to the copy tree name 220 and the execution 221 is clicked, the selected tree is copied with the new specified name, and the 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 tree name change will be described. The operation method for renaming a tree is almost the same as the operation method for copying a 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 pressing the execute button after entering the name to be changed in that area. Note that only the user who owns the tree can change the name. Even if another user mistakenly selects the tree to be changed, an error is displayed and the name is not changed.

Next, the deletion of the tree will be described. First, the tree to be deleted is selected from the tree box shown in FIG. 11, and the edit 83 is selected from the edit menu to display the edit menu shown in FIG. 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 confirming whether or not to delete the tree is displayed. Clicking Execute 223 here deletes the specified tree. As for the deletion, only the user who owns the tree can delete the tree, as in the case of the name change. Also, the user can only delete the user tree, not the shared tree. FIG. 37 is an example of an end confirmation screen for ending the system of this database device. This end confirmation screen is performed 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 on Run 224 here terminates the system.

As described above, in this embodiment, the tree creating section for creating and displaying the tree by selecting arbitrary data independently of the physical structure of the database and the tree creating section are created. 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. Also, the tree editing unit that performs editing other than copying on the tree created by the tree creating unit has been described. Also, a database device for searching data of a part or all of the created tree has been described.

Example 2. 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 they are not allowed to make changes to the shared tree. A new shared tree is created and modified by displaying the shared tree management window.
FIG. 38 is a diagram showing a tool box displayed only to the system administrator. By selecting the shared tree management 300 from this management tool box and clicking the execution 301, the shared tree management window shown in FIG. 39 is displayed. In the figure, 310 is a file and 320 is an edit, and a submenu is displayed by selecting each. The shared tree name and the reference rights A, B, C, D, and E are displayed in a list in the window below it.
Here, when the administrator selects the edit 320, the edit menu shown in FIG. 40 is displayed. In the edit menu, new creation 321, privilege change 322, edit 323, name change 32
4, a function called delete 325 is prepared. When the 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, 330 is a newly created tree name input area for inputting the name of a newly created tree, and 331 to 335 are columns for setting reference right among access rights. Reference right A331, reference right B332,
The reference right C333 is displayed in black, which means that the reference rights A, B, and C are set in this tree. The reference right D334 and the reference right E335 are displayed in white, which means 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 newly created tree of "electronic component catalog information" is displayed in the tree display window. Initially, only the top node is displayed because it is a newly created tree. Then add intermediate nodes. FIG. 42 is a diagram showing a display screen when a new intermediate node is created. In the figure, 350 is an area for inputting the name of a newly created node.
Reference numeral 1 is an execute button. The detailed operation method is the same as the tree editing described in the first embodiment, and thus the description thereof is omitted. In the newly created intermediate node window shown in FIG. 42, enter the node name in the newly created node name input area 350 while confirming that the newly created tree name, that is, the top node name is displayed in the selected node name. When the execution 351 is clicked, a node with a specified name is newly created. Similarly, when adding an end node, an intermediate node to which the end node is to be added is selected from the tree display window. After that, FIG.
From the node menu shown in (1), select New Generation 140 and then End Node Creation 146 to display the End Node Creation window. FIG. 43 shows a diagram of the terminal node new creation window. In the figure, reference numeral 360 is an area for inputting the name of a newly created terminal node, and 362 is a database name list for designating a table associated with the terminal node. From the database list 362, for example, “P
When "NDB" is selected, the table name in the selected database is displayed. Reference numeral 364 is a table name list. Database name list 362, table name list 364
If they cannot be displayed together, the contents can be scrolled and the contents can be switched, and a table to be associated with the corresponding end node can be selected from an arbitrary database. The system administrator inputs the name of the end node into the input area 360, specifies the database and table names, and then clicks execute 366 to create a new end node. As a result, the created end 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 during this operation.
In this way, 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 change of the privilege of the shared tree is started by selecting the 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 A371 to 375 are column displays showing the setting of the reference right among the access rights.
71, the reference right B372, and the reference right C373 are currently set. Further, the reference right D374 and the reference right E375 are displayed in white, which means that they are not currently set. By clicking an arbitrary column with the 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 he / she wants to change, and clicks Execute 377. Then
The access right to the specified shared tree "electronic component catalog information" is changed.

Further, with respect to the editing and updating of the shared tree, it is possible to carry out editing including moving and copying as in the case of the user tree. Since the actual operation method is the same as the editing of the user tree described in the first embodiment, the description thereof will be omitted.

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

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

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

Example 3. In the above-described embodiment, the user tree is configured to be accessed by the user who has the ownership. The user tree is the same as the shared tree
The access may be made possible if the access rights (reference right, update right) match.

Example 4. 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 showing an example of setting a user's access right. In the figure, "1" indicates that the access right is set. The user X has reference rights A, B, E and update rights A, B.
Also, the user Y has the reference rights B and E and the update right E. In this way, the data and the tree may be managed by using the access right designated for each user.

Example 5. Access rights may be set for each database, each table, and each field.

Example 6. 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 a tree without access may be displayed in a neutral color to distinguish it from a tree with access.

Example 7. Further, when performing a common item search, a plurality of databases may be selected instead of selecting only one. In that case, the search is performed in the selected order, 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 a window is opened by the number of selected databases and the user switches the windows to specify which database the search is to proceed.

[0065]

In the database apparatus of the present invention, the tree creating section arbitrarily selects the data stored in the database and displays it in the tree format, so that the user can easily display only the necessary data. Further, since the tree storage unit stores the tree format, the created tree can be used at any time.

Since the tree creating unit of the present invention is provided with the tree copying unit, it is possible to create another tree by utilizing a part or all of the already created tree. As a result, it is not necessary to newly create the entire tree, and the tree can be created efficiently.

Further, since the tree creating section of the present invention is provided with the tree editing section, it is possible to obtain a tree that is easier for the user to perform arbitrary editing in response to the user's request.

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

Since the search unit is provided, the database can be searched intuitively using a tree.

Since the access right storage unit is provided, it is possible to arbitrarily select accessible data. Therefore, you can limit the data that users use,
It becomes possible to protect the data.

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

[Brief description of drawings]

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

FIG. 2 is a block 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 of the present invention.

FIG. 5 is a diagram illustrating the creation of a user tree of 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 of the present invention.

FIG. 9 is a network configuration diagram of the present invention.

FIG. 10 is a diagram showing a display screen when the system of the present invention is activated.

FIG. 11 is a diagram showing a display screen when the system of the present invention is activated.

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

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

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

FIG. 15 is a diagram showing a display operation of a lower node of 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 an 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 this 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 an 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 this 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 this 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 main body, 2 CRT, 3 database, 4 mouse, 5 keyboard, 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 node, 22a top node, 22b
Intermediate node, 22c End node, 23 table, 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.

 ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Shigemi Hashimoto, 325 Kamimachiya, Kamakura City, Mitsubishi Electric Corporation Information System Works (72) Inventor, Ryoji Igushi, 325, Kamikura City, Kamikura City Mitsubishi Electric Corporation, Information Systems Works (72) 72) Inventor Shunsuke Mimura 325 Kamimachiya, Kamakura City, Mitsubishi Electric Corporation Information System Works (72) Inventor Seiichi Amata 325, Kamimachiya, Kamakura City Mitsubishi Electric Corporation, Information Systems Works

Claims (7)

[Claims] 1. A database device having the following elements: (a) a database for storing data, (b) a tree creating section for arbitrarily selecting data in the database and displaying the selected data in a tree format, (c) ) A tree storage unit that stores the tree format created by the tree creation unit. 2. The database apparatus according to claim 1, wherein the tree creating unit includes a tree copying unit for copying 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 further comprises 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. The database device described. 5. The database device according to claim 4, wherein the tree data processing unit includes a search unit that searches for data. 6. The database device further includes an access right storage unit that stores an access right to data,
6. The database device according to claim 1, wherein the tree creation unit refers to the access right stored in the access right storage unit and arbitrarily selects accessible data. 7. The database apparatus according to claim 1, wherein the database defines a data structure of the data, and the tree creating unit creates a tree independently of the data structure.