JPH07121417A - Data management device - Google Patents

Abstract

(57) [Abstract] [Purpose] To provide a data management device capable of centrally managing data and creating a plurality of different hierarchical structures for one data group. [Structure] A data storage unit 13 which is a set of data including a unique key 131 and a corresponding data entity 132, and a set of link information having a plurality of unique keys 141 and members 142 for storing one key. It is provided with two independent data groups in a certain link information storage unit 14 and an operation unit 12 for performing registration, deletion, and search operations.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data management device for managing hierarchical data on a computer.

[0002]

2. Description of the Related Art A conventional data management apparatus will be described with reference to FIGS. In the conventional data management device, the data and the link information of the individual data are integrated, and when two data A appear in the hierarchical structure as shown in FIG. Will have one.

Further, in order to have the hierarchical structure as shown in FIG. 14 in addition to the hierarchical structure as shown in FIG. 13 for the same data group, it is necessary to have each data entity separately.

[0004]

In the above conventional method, since the data and the link information of the individual data are integrated, when the same data appears more than once in one hierarchical structure. However, there is a problem that the data cannot be centrally managed because the data has two or more entities.

There is also a problem that a plurality of different hierarchical structures cannot be created for one data group.

Further, since there is no means for effectively prohibiting two identical nodes from appearing in the hierarchical structure, there is a problem that the ascending / descending of the hierarchy in the hierarchical structure of data cannot be uniquely determined. It was

The present invention solves the above-mentioned problems of the prior art, and makes it possible to centrally manage data and to create a plurality of different hierarchical structures for one data group. It is intended to provide a means for preventing duplicate registration of nodes.

[0008]

In order to achieve the above object, a data management apparatus of the present invention is provided with a data storage unit which is a collection of data including a unique key and a corresponding data entity, and a unique key. And a link information storage unit, which is a collection of link information having a plurality of members, and an operation unit for registering, deleting, and searching data in the data storage unit and the link information storage unit.

Further, the present invention adds link information to additional information. Further, the present invention has a configuration in which link source information is added to the link information.

[0010]

According to the present invention, by separating the data and the link information of the individual data by the above means, the substance of the data and the link information of the individual data are made independent, and the data is centrally managed, and the individual data is linked. It is possible to create multiple pieces of link information for the data.

Further, by adding the link source information to the link information, duplicate registration of nodes can be eliminated, and it is possible to uniquely determine the ascending / descending of the hierarchy in the hierarchical structure.

[0012]

【Example】

(First Embodiment) A first embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram of a data management device according to an embodiment of the present invention. In FIG. 1, 11 is an input unit for inputting a request to this device, 1
Reference numeral 2 denotes an operation unit that operates data in response to a request from an input unit, 121 denotes a registration unit that registers keys and data, and 12
Reference numeral 2 is a deletion unit for deleting keys and data, 123 is a search unit for searching for keys and data, 13 is a data storage unit,
Data 13a, 13b, and 13c consist of a unique key and a corresponding data entity, but the unique data entity can also serve as the key. In that case, the data consists only of the key.

Reference numeral 131 denotes a key indicating the data, 13
2 is a data entity which is the entity of data, 14 is a link information storage unit, 14a, 14b and 14c are link information, 141
Is a key indicating the link information, 142a, 142
Reference numerals b and 142c are members that store one key, and 15 is an output unit that outputs the result of the operation.

With respect to the information management apparatus configured as described above, a flow chart of processing performed by the registration unit shown in FIG. 2 and a flow chart of processing performed by the deletion unit shown in FIG.
The operation will be described with reference to the flowchart of the processing performed by the search unit shown in FIG.

First, the processing performed by the registration unit will be described. When the operation unit receives the registration request (step 20)
1) Check the object to be registered (step 202).

When the registration target is a member of the link information, that is, when the key of the link information which is the registration destination and the key of the data corresponding to the member to be registered or the key of the link information is input, the link of the registration destination The information is searched by the key (step 203). If not found, the process is terminated, and if found, the key to be registered in the member of the link information of the registration destination is stored (step 204).

When the registration target is data, the given key is first searched in the data storage unit and the link information storage unit to check whether the key is double-registered (step 20).
5) If the registration is double registration, the process is terminated. If the registration is not double registration, the key and the data entity are registered in the data storage unit (step 206).

In the case of link information, the given key is first searched in the data storage unit and the link information storage unit to check whether the key is double-registered (step 207),
If it is the double registration, the process is ended, and if it is not the double registration, the key of the link information is registered (step 208).

Next, the processing performed by the deleting unit will be described. When the operation unit receives the deletion request (step 30
1) Check the object to be deleted (step 302).

If the deletion target is a member of link information,
The link information for deleting the member is searched by the given key (step 303), and if found, the member designated by the link information is deleted (step 30).
4).

When the data to be deleted is data, first, the given key is searched in the data storage unit to check whether the key exists (step 305).
When the processing is completed and exists, the key to be deleted is deleted from all members in all the link information (step 306), and finally the target data is deleted (step 307).

When the deletion target is the link information, first, the given key is searched in the link information storage unit to check whether or not the key exists (step 308). Then, the key to be deleted is deleted from all members in all the link information (step 309), and finally the target link information is deleted (step 310).

Next, the processing performed by the search unit will be described. When the operation unit receives the search request (step 40)
1), a key is searched in the link information storage unit (step 402), it is judged whether or not a corresponding key is found (step 403), and if found, information (list of members) is taken out from it (step 407). If not found, the key is searched in the data storage unit (step 404), and it is judged whether or not the corresponding key is found (step 405). If not found, the process is terminated. The data entity) is taken out (step 406).

As described above, according to this embodiment, it is possible to centrally manage data and create a plurality of different hierarchical structures by having a plurality of link information storage units for one data storage unit. It is possible.

(Second Embodiment) A second embodiment of the present invention will be described below with reference to the drawings. FIG. 5 is a block diagram of a data management device according to the second embodiment of the present invention. In FIG. 5, reference numeral 51 is an input unit for inputting a request to this device, 52 is an operation unit for operating data in response to a request from the input unit, 521 is a registration unit for registering keys and data, and 522 is a key. And a deletion section that deletes data,
Reference numeral 523 is a search unit that searches for keys and data, 53 is a data storage unit, and 53a, 53b, and 53c are data consisting of unique keys and corresponding data entities.
The unique data entity can also serve as the key. In that case, the data consists only of the key. Reference numeral 531 is a key indicating the data, 532 is a data entity that is the entity of the data, 54 is a link information storage unit, 54a, 54
b and 54c are link information, 541 is a key indicating the link information, 542a, 542b and 542c are members that store one key, 543 is auxiliary information related to the link information, and 55 is an output unit that outputs the result of the operation. is there.

Regarding the information management apparatus configured as described above, a flow chart of processing performed by the registration unit shown in FIG. 6 and a flow chart of processing performed by the deletion unit shown in FIG.
The operation will be described with reference to the flowchart of the processing performed by the search unit shown in FIG.

First, the processing performed by the registration unit will be described. When the operation unit receives the registration request (step 60)
1) Check the registration target (step 602).

When the registration target is a member of link information,
The link information for registering the member is searched with the given key (step 603). If not found, the process is terminated, and if found, the key is stored in the member of the link information (step 604).

If the registration target is data, the given key is first searched in the data storage unit and the link information storage unit to check whether the key is double-registered (step 60).
5) If the registration is double registration, the process is terminated. If the registration is not double registration, the key and data entity of the data storage unit are registered (step 606).

In the case of link information, the given key is first searched in the data storage unit and the link information storage unit to check whether the key is double-registered (step 607).
If it is the double registration, the processing is terminated, and if it is not the double registration, the key of the link information and the attached information are registered (step 608).

Next, the processing performed by the deleting unit will be described. When the operation unit receives the deletion request (step 70)
1) Check the object to be deleted (step 702). If the deletion target is a member of link information, the link information to be deleted is searched by the given key (step 703). If not found, the process is terminated, and if found, the specified member of the link information is found. It is deleted (step 704).

If the data to be deleted is the data, the given key is first searched in the data storage unit to check if the key exists (step 705). If it does not exist, the process is terminated, and if it exists, The key to be deleted is deleted from all members in all the link information (step 706), and finally the data to be deleted is deleted (step 707).

If the deletion target is the link information, the given key is first searched in the link information storage unit to check whether the key exists (step 708). Then, the key to be deleted is deleted from all members in all the link information (step 709), and finally the target link information is deleted (step 710).

Next, the processing performed by the search unit will be described. When the operation unit receives the search request (step 80)
1), the key is searched in the link information storage unit (step 802), it is judged whether or not the corresponding key is found (step 803), and if found, the information (member list and attached information) is taken out (step). 8
07) If not found, the key is searched for in the data storage unit (step 804), and it is judged whether or not the corresponding key is found (step 805). If not found, the process is terminated, and if found, there is it. The information (data entity) is retrieved from (step 806).

As described above, according to this embodiment, it is possible to centrally manage data and create a plurality of different hierarchical structures by having a plurality of link information storage units for one data storage unit. It is possible. The range of application is expanded by including information about link information in the attached information. Also, the search time can be shortened by setting the key as a number and inserting the name of the link information in the attached information.

(Embodiment 3) A third embodiment of the present invention will be described below with reference to the drawings. FIG. 9 is a block diagram of a data management device according to the third embodiment of the present invention.

In FIG. 9, 91 is an input unit for inputting a request to this apparatus, 92 is an operation unit for operating data in response to a request from the input unit, 921 is a registration unit for registering keys and data, Reference numeral 922 denotes a deletion unit that deletes keys and data, and 923 a search unit that searches keys and data.
93 is a data storage unit, 93a, 93b, 93c are data consisting of unique keys and corresponding data entities,
However, the unique data entity can also serve as the key. In that case, the data consists only of the key. 9
Reference numeral 31 is a key indicating the data, 932 is a data entity that is the entity of the data, 94 is a link information storage unit, 94
a, 94b, 94c are link information, 941 is a key indicating the link information, 942a, 942b, 942c are members storing one key, and 943 is a link source indicating which link information the link information is a member. If the information is not a member of any link information, the link source information is empty. An output unit 95 outputs the result of the operation.

With respect to the information management apparatus configured as described above, a flow chart of processing performed by the registration unit shown in FIG. 10, a flow chart of processing performed by the deletion unit shown in FIG. 11, and a flow chart of processing performed by the search unit shown in FIG. The operation will be described using.

First, the processing performed by the registration unit will be described. When the operation unit receives the registration request (step 100
1) Check the object to be registered (step 1002).

When the registration target is a member of link information,
The link information for registering the member will be searched with the given key (step 1003). If not found, the process is terminated.

When the link information of the registration destination is found, it is checked whether or not the member to be registered is data, and if it is data, the member is unconditionally registered as the member of the registration destination link information.

If the member to be registered is the link information, the link information having the member to be registered as a key is searched (step 1004). If the link information having the member to be registered as a key is not found, the process is terminated, and if found, it is checked whether the link source information of the link information is empty (step 100).
5). If the link source already exists in the link source information and is not empty, the process is terminated, and if the link source information is empty, the link information key for registering the member from now is set there (step 1006). Finally, the member is registered in the designated link information (step 1007).

Next, when the registration target is data, first, the given key is searched in the data storage unit and the link information storage unit to check whether the key is double registration (step 1008). For example, if the process is terminated and the registration is not double registration, the key and data entity of the data storage unit are registered (step 1009).

Next, when the registration target is the link information, the given key is first searched in the data storage unit and the link information storage unit to check whether the key is the double registration (step 1010). If there is, the processing is terminated, and if it is not double registration, the key of the link information is registered (step 1011). However, at this time, the link source information is empty.

Next, the processing performed by the deleting unit will be described. When the operation unit receives the deletion request (step 110)
1) Check the object to be deleted (step 1102).

If the deletion target is a member of link information,
The link information for deleting the member is searched with the given key (step 1103). If not found, the process is terminated, and if found, it is checked whether the member designated by the link information is the link information or the data (step 1).
104), in the case of data, the member to be deleted is deleted (step 1106), and the process ends. In the case of link information, the link source information of the link information is emptied (step 1105), and finally the member to be deleted is deleted (step 1106).

If the data to be deleted is data, first, the data to be deleted is searched in the data storage section by the given key, and it is checked whether the specified data exists (step 1107). To finish. If it exists, the key to be deleted is deleted from all members in all link information (step 11).
08), and finally the target data is deleted (step 1109).

When the deletion target is the link information, the link information to be deleted is first searched in the link information storage section with the given key to check whether the specified data exists (step 1110) and it must exist. If so, the process ends. If it exists, it is checked whether the link source information of the link information is empty (step 1111). If it is empty, the process proceeds to step 1113. If it is not empty, the key indicating the link information to be deleted is deleted from the member of the link information indicated by the link source information (step 111).
2) Empty the link source information of all the link information that are members of the link information to be deleted (step 111)
3). Finally, the deletion target link information is deleted (step 1114).

Next, the processing performed by the search unit will be described. When the operation unit receives the search request (step 120)
1), the key is searched in the link information storage unit (step 1202), it is judged whether or not the corresponding key is found (step 1203), and if found, the information (member list, link source) from the link information having the key is found. (Information) is retrieved (step 1207), and if not found, the key is searched in the data storage section (step 12).
04), it is judged whether or not the corresponding key has been found (step 1205), and if not found, the process ends, and if found, the information (data entity) is taken out therefrom (step 1206).

As described above, according to this embodiment, it is possible to centrally manage data and create a plurality of different hierarchical structures by having a plurality of link information storage units for one data storage unit. It is possible. Further, the link source information uniquely determines the ascending / descending of the hierarchy in the hierarchical structure.

[0051]

As described above, according to the present invention, it is possible to realize a data management device that can manage data in a unified manner and create a plurality of different hierarchical structures for one data group. it can.

Further, it is possible to eliminate duplicate registration of nodes and uniquely determine the rise and fall of the hierarchy in the hierarchical structure.

[Brief description of drawings]

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

FIG. 2 is a flowchart of processing performed by a registration unit according to the first embodiment.

FIG. 3 is a flowchart of processing performed by a deleting unit according to the first embodiment.

FIG. 4 is a flowchart of processing performed by a search unit according to the first embodiment.

FIG. 5 is a conceptual diagram showing a configuration of an information management device according to a second embodiment of the present invention.

FIG. 6 is a flowchart of processing performed by a registration unit according to the second embodiment.

FIG. 7 is a flowchart of processing performed by a deleting unit according to the second embodiment.

FIG. 8 is a flowchart of processing performed by a search unit according to the second embodiment.

FIG. 9 is a conceptual diagram showing a configuration of an information management device according to a third embodiment of the present invention.

FIG. 10 is a flowchart of processing performed by a registration unit according to the third embodiment.

FIG. 11 is a flowchart of processing performed by a deleting unit according to the third embodiment.

FIG. 12 is a flowchart of processing performed by a search unit according to the third embodiment.

FIG. 13 is a first data diagram showing data management of a conventional data management device.

FIG. 14 is a second data diagram showing data management of a conventional data management device.

[Explanation of symbols]

 11 input unit 12 operation unit 13 data storage unit 14 link information storage unit 15 output unit 131 key 132 data entity 141 key 142b member 543 ancillary information 943 link source information

Claims (3)

[Claims] 1. A data storage section for storing data having a unique key and a data entity, a link information storage section for storing link information having a unique key and a member, and operation of the data and the link information. And an operating section,
Data in which a member of the link information is composed of at least one of a unique key of data stored in the data storage unit or a unique key of link information stored in the link information storage unit Management device. 2. The data management device according to claim 1, wherein the link information includes additional information. 3. The data management apparatus according to claim 1, wherein a key of link information including a unique key of the link information as a member is added to the link information as link source information.