JPH0816448A - Data deleting method for data group - Google Patents

Abstract

PURPOSE:To easily delete data by holding reference data that data specified as virtual data different from data constituting the data group, and then deleting the reference data and specified data. CONSTITUTION:When the deletion specification of data C is inputted at the time of the editing of, for example, a composite document A, a data base management file is opened and a relinking process routine is called. In the relinking process, the specified data C to be deleted are linked with the virtual data 100 different from the data constituting the hyper-structure data group used when specific data are deleted from the hyper-structure data group. Then storage position information on data A with which the specified data C to be deleted is linked is obtained from the data identifier of the data A. Further, its data management file is opened and link data for linking the data to be deleted are deleted from the link data of the data A with which the specified data C to be deleted are linked, and this file is closed.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for deleting data from a data group, and more particularly, to a method for referring to at least one upper data and a data for referencing at least one lower data. The present invention relates to a data deletion method for a data group, in which specific data is deleted from a data group composed of a plurality of data that holds one of them as reference data.

[0002]

2. Description of the Related Art Conventionally, a network-like data structure (hereinafter referred to as a hyper-structured data group) as shown in FIG. 9 has been formed to store data. For example, the data D in FIG. 9 is referred to by the data B and G (hereinafter referred to as link) as upper data, and the data H and I are linked as lower data. Such data types include documents, figures, tables, graphs and the like. Here, for example, assuming that the data A is document data and the data B and data C are graphic data, the document A (data A) is a composite of FIG. B (data B) and C (data C) linked. It becomes a document.

By freely linking and storing data in this way, it becomes possible to display or output other data related to one data at high speed.

A unidirectional link system has been proposed as one of the methods for storing the data of the above-mentioned hyper-structured data group. The one-way link method holds, as link data, either one of data for referencing at least one upper data and data for referencing at least one lower data. The hyper-structured data group shown in FIG. 9 is an example in which at least one piece of data for referencing lower order data is held as link data.

Each of the data A to I in FIG. 9 is shown in FIG.
It is composed of a data management file that manages the data itself and a media file that is the content of the data. The media file is composed of text data, vector data, image data, audio data, moving image data, etc., and the data is formed as documents, figures, tables, graphs and the like.

The data management file (see FIG. 10) includes an attribute data section (FIG. 10A) and a link data section (FIG. 1).
0 (b)). The attribute data section stores a data identifier, a media type, a creation date and time, a creator, a last modification date and time, an attribute and the like. Further, the link data section stores, for example, the number of links indicating the number of links with lower-order data and the data identifier and link information for linking linked partner data. The link information includes the link date and time, as shown in FIG.
Has attributes. Here, the contents of the link data shown in FIG. 10 (b) of the hyper structure data group shown in FIG. 9 are as shown in FIG. 15 (A). That is, for example, since the data A is linked to two data B and C, the number of links is 2.
The link data are B and C. Further, for example, regarding the data C, since the data C is linked to two data E and F, the number of links is 2, and the link data is E and F.

Each data A having such contents
Each I is managed by a database management file as shown in FIG. The database management file is composed of the number of stored data, a data identifier for identifying each data, and storage position information of the data paired with the data identifier.

Next, taking the hyper-structured data group of FIG. 9 as an example, a data deletion method in the one-way link system will be described with reference to FIGS. 12 to 15.

If the operator editing the document A (data A) determines that the diagram C (data C) linked to the document A is unnecessary, the data name to be deleted (data C) Is input (step 20 (see FIG. 12)), the database management file is opened in step 21, and the link release processing routine is called in step 22.

In step 201 of this link release processing routine (see FIG. 13), the data storage position information is acquired from the identifier (data A) of the data that is linked with the data designated for deletion (data C), and the information is acquired. Originally, in step 202, the data management file of the data (data A) that links the data (C) designated for deletion is opened, and in step 203, the link data (data B) in the opened data management file is opened. , C) deletes the link data of the designated data (data C).
As a result, the link data of the data A is only the data B (see FIG. 15B). And step 205
Then, the data deletion processing routine is called.

At step 210 of the data deletion processing routine (see FIG. 14), a variable i for counting all data other than the data designated for deletion is initialized (i
= 0), the variable i is incremented by 1 in step 211, and the data storage information of the i-th data is acquired from the data identifier of the i-th data in the database management file in step 212. Step 213
In step 214, the data management file of the i-th data is opened from the i-th data storage information, and in step 214, the link data in the data management file of the i-th data contains the data designated for deletion (data C). By determining whether or not it is determined whether the i-th data links the data designated for deletion.

At this stage, as described above, in step 203 of the link release processing routine (FIG. 13), the data designated for deletion is deleted from the link data (B, C) of the linked data (data A). Since the link data of the designated data (data C) has been deleted, it is determined in step 214 that the data designated for deletion is not linked, and the process proceeds to step 216. In step 216, it is determined whether or not i has a value equal to or more than the number N of all the data other than the data designated to be deleted, and thus the processing of step 214 is performed for all the data other than the data C designated to be deleted. Judge whether you went. i is N
If the value is not the above value, the process returns to step 211 and the above processes (steps 211 to 214) are repeated.

On the other hand, in step 216, i is a value of N or more, that is, steps 211 to 21 for all data other than the data C designated for deletion.
When the process of No. 4 is performed, the data management file of the data designated for deletion (data C) is opened in step 217, and the link data (data E, F) of the data designated for deletion is opened in step 218. A variable j for counting is initialized (set to j = 0), and in step 219,
Increment j by 1.

In step 220, the link of the data designated for deletion with the j-th link data is released. Because of this processing, the above-mentioned link release processing routine (FIG. 12)
Is recursively called to execute the above-mentioned link release processing routine (data deletion processing).

In step 221, it is judged whether or not j is larger than the link data number m of the data designated to be deleted, and it is judged whether all the link data of the data designated to be deleted are released. , Until the link with all link data is released (step 21
9 to step 221) are repeated. In this case, if the link data of the data designated for deletion is not linked from all other data, for example, the data F in the example of FIG.
With respect to the data F, the link data of the data F is erased (see FIG. 15B), and the data F is deleted. Then, when the link data of the data C designated for deletion is erased (see FIG. 15B) and the links with all the link data are released, in step 222,
The data management file of the data designated for deletion is closed, the data management file and the media file of the data designated for deletion are deleted in step 223, and the data management of data other than the data designated for deletion in step 215. Close the file and go to step 23
Then, close the database management file and end the process.

As a result of the above processing, the data linking the data C designated for deletion includes the data A, and the link data of the data C designated for deletion is deleted from the link data of the data A (FIG. 15). (See (B)). Further, of the link data E and F of the data C designated for deletion, the link data of the data F is erased for the data F that is not linked from other data (see FIG. 15B), and the deletion is designated. Along with the deletion of the deleted data C, the data F linked with the specified deletion data C is deleted (see FIG. 15C).

[0017]

However, in the data deletion method in such a one-way link method, before deleting the data designated to be deleted, each link data of other data is accessed and deleted. It is necessary to judge whether each of the data E and F to which the designated data C is linked is not linked from other data, and when there is data that is not linked from other data ( For example, for the data F), the data F
The link data of No. 1 is deleted, and it is judged whether the data I linked based on the link data of the data F is not linked from other data (note that the data I
Process is also performed), the data F (and the data I, if applicable) must be deleted, and the data C designated for deletion must be deleted. Therefore, there is a problem that it takes time to delete the data, and it is not suitable for use in which the link is frequently released.

The present invention has been made in view of the above points, and it is an object of the present invention to provide a data deleting method of a data group that can easily delete data.

[0019]

In order to achieve the above object, the invention according to claim 1 is any one of data for referencing at least one upper data and data for referencing at least one lower data. In the data deletion method of a data group that deletes specific data from a data group composed of a plurality of data that holds one of them as reference data, virtual data different from the data that constitutes the data group is provided, and the specified deletion data After holding the reference data held by the virtual data in the virtual data, the deletion-designated data and the reference data held by the deletion-designated data are deleted.

According to a second aspect of the invention, in the first aspect of the invention, the data designated to be deleted and the reference data held by the data designated to be deleted are held in the virtual data. Until all the reference data is deleted, the first step of determining whether the data referred to based on the reference data held in the virtual data is referred to by other data, The second step of deleting the reference data from the virtual data, and the data referred to based on the reference data held in the virtual data if not referenced from other data. After holding the reference data to be held in the virtual data, the data referred to based on the reference data held in the virtual data and the reference held in the virtual data Data referenced based on chromatography data is to repeat the third step of deleting the reference data stored.

[0021]

A data group of the invention according to claim 1 is a plurality of data holding at least one of data for referencing at least one upper data and data for referencing at least one lower data as reference data. Data.

In order to delete the data of such a data group, in the present invention, virtual data different from the data forming the data group is provided, and the reference data held by the data designated for deletion is held in the virtual data. Then, the data designated for deletion and the reference data held by the data designated for deletion are deleted.

Here, after the reference data held by the data designated for deletion is held in the virtual data, the reference data held by the data designated for deletion is deleted and then the data designated for deletion is deleted. Alternatively, the reference data held by the data designated for deletion may be deleted after the data designated for deletion is deleted, and further, the reference data held by the data designated for deletion and the reference data held by the data designated for deletion And may be deleted at once. When there are a plurality of reference data held by the data designated for deletion, a plurality of reference data may be deleted at once, or a plurality of reference data may be deleted one by one. Good.

As described above, after the reference data held by the data designated for deletion is held in the virtual data, the data designated for deletion and the reference data held by the data designated for deletion are deleted. Deleted data can be deleted without determining whether all other data refer to the referenced data based on the reference data held by the deleted data. Can be easily deleted.

According to a second aspect of the present invention, in the first aspect of the present invention, after deleting the designated deletion data and the reference data held by the designated deletion data, the reference data held in the virtual data is deleted. The first step, the second step, and the third step are repeated until all are deleted.

Here, the first step is to judge whether or not the data referred to is referred to by other data based on the reference data held in the virtual data.

The second step is to delete the reference data from the virtual data when the data is referenced by other data.

Further, the third step is to make the virtual data hold the reference data held by the data referred to on the basis of the reference data held in the virtual data when it is not referred to by other data. After that, the data referred to based on the reference data held in the virtual data and the reference data held by the data referred to based on the reference data held in the virtual data are deleted.

As described above, since the first step, the second step, and the third step are repeated until all the reference data held in the virtual data are deleted, it is not referred to by other data. Even when deleting the data, the reference data held by the data is held in the virtual data, and the data and the reference data held by the data are deleted, so that the data that is no longer referenced by other data is deleted. Deletes data that is no longer referenced by other data without having to determine for all other data whether the referenced data is based on the reference data held by Therefore, the data can be easily deleted.

[0030]

Embodiments of the present invention will now be described in detail with reference to the drawings. FIG. 1 shows an example of a data group (hyper-structured data group) in this embodiment. Compared with the conventional hyper-structured data group, the difference is that the virtual data 100 for deletion is provided. This virtual data 100
Is virtual data different from the data forming the hyper structure data group used when deleting specific data from the hyper structure data group.

Each of the data A to I shown in FIG. 1 is composed of a data management file (see FIG. 10) and a media file as described above. And, as mentioned above,
Each of the data A to I is managed by the database management file (FIG. 11). Here, in this embodiment, as shown in FIG. 2, the database management file further stores link data of data linked to the virtual data 100 used when deleting specific data from the hyper-structured data group. There is a part (hereinafter referred to as a deletion designation data table).

Here, as the data of the hyper structure data group shown in FIG. 1, as described above, for example, a document,
Figures, tables, etc. That is, for example, assuming that data A is a document and data B and data C are figures, document A
(Data A) is shown in Figure B (Data B) and Figure C (Data C).
It is a compound document that links. Then, when the operator edits the compound document A, it is determined that FIG. C is unnecessary, and the operator designates deletion of FIG. C, the data deletion method of the data group of the present embodiment is applied.

FIG. 3 shows a schematic configuration of a system to which the data deletion method of the data group in this embodiment can be applied. As shown in FIG. 3, the present system includes a main storage device 12 including a CPU 10 that controls the entire system and a work area for various processes that stores programs related to control processing of the CPU 10. . The system also includes an instruction device 14 such as a mouse and an input device 16 such as a keyboard for inputting commands and text data. Further, the present system includes a display device 18 such as a bit map display, and an auxiliary storage device 20 such as a magnetic disk or an optical disk whose contents are saved even when the power is turned off. Auxiliary storage device 2
0 stores the above-mentioned data (data management file, media file), database management file, and various programs. Here, the storage location information is
This is information indicating the storage location of the database in the auxiliary storage device 20 for data. These various components are the bus 2
2 electrically connected.

Next, the operation of this embodiment will be described in detail with reference to FIGS. As described above, for example, when the operator edits the compound document A and decides that the diagram C (data C) is unnecessary and designates the diagram C to be deleted, that is, the data is designated to be deleted. When input (step 30 (see FIG. 4)), the database management file is opened in step 31, and the link replacement processing routine is called in step 32.

In the link replacement process (see FIG. 5), first,
In step 301, the data designated for deletion is linked to the virtual data 100. This is because the data identifier of the data designated to be deleted and the storage position information of the data designated to be deleted are M ′ (= M +) in the data table for deletion shown in FIG.
1) The first storage is performed. At this stage, the data designated for deletion is only data C, so
Only the data identifier of the data C and the storage information of the data C are stored in the deletion data table.

In step 302, the data storage information is acquired from the data identifier of the data that links the data designated for deletion. Here, as described above, the document A that links FIG. B (data B) and FIG. C (data C)
Since it is determined that FIG. C is unnecessary when (DATA A) and FIG. C (DATA C) are displayed on the display device 18 and edited, it is assumed that the data A is linked to the data C. Since the determination can be made, the storage location information of the data A linked to the data C can be acquired. In step 303, this data management file is opened, and in step 304, the link data for linking the data to be deleted is erased from the link data of the data linking the data designated for deletion. Then, in step 305, the data management file is closed and the process ends. The above process (FIGS. 4 and 5) is not a data deletion process but a link reassignment process.

After the link reassigning process is completed,
As described below, the process of actually deleting the data linked to the virtual data 100 (see FIG. 6) is performed.

In step 40, an instruction to delete the data linked to the virtual data 100 is input, and in step 41,
Opens the database management file. Step 4
At 2, the isolation determination process (see FIG. 7) of the data linked to the virtual data 100 is performed. This isolation determination process is
This is a process for determining whether the data designated for deletion (data linked to the virtual data 100) is linked to another data.

In this isolation determination process, first, at step 400, a variable k that counts all data other than the data designated for deletion in the database in the auxiliary storage device 20 is initialized (set to k = 0), In step 401,
This variable is incremented by 1. In step 402,
Obtain the data storage information of the k-th data, and step 4
At 03, the data management file is opened. In step 404, a variable h for counting the data designated for deletion is initialized (set to h = 0), and in step 405, the variable h is incremented by 1. In the present embodiment, the data designated for deletion is only the data C, so the maximum number of variables h is 1.

In step 406, it is judged whether or not the k-th data links the h-th designated data for deletion. If they are linked, the process proceeds to step 407, and if they are not linked, , Go to step 408. In the example of FIG. 1, in step 304 in the above-described link reassignment process, the data (C) specified to be deleted is linked from the link data of the data (A) linked to the data (C) specified to be deleted. Since the link data for deleting is deleted, it is determined that the kth data does not link the hth deletion target data.

At step 407, since it is judged that the data designated for deletion is linked with other data,
The link of the data designated for deletion with the virtual data 100 is released.

In step 408, it is determined whether all the data designated for deletion are linked with all the data other than the data designated for deletion. That is, it is determined whether or not the variable h has become a value equal to or larger than the total number H of data designated for deletion. If this judgment has not been completed for all data specified for deletion, step 40
Returning to step 5, the above processing (step 405 to step 40
8) is repeated, and when this judgment is completed for all the data designated for deletion, in step 409, k
Close the second data management file.

In step 410, it is determined whether or not it is determined whether or not the data designated for deletion is linked to all the data other than the data designated for deletion. This is performed depending on whether k has become a value equal to or larger than the total number of data K other than the data designated for deletion. When it is not determined whether the data designated for deletion is linked to all the data other than the data designated for deletion, the process returns to step 401, and the above processing (steps 401 to 410). When the determination is repeated for all the data other than the data designated for deletion, the isolation determination process ends.

As a result of this processing, among the data designated for deletion, data that is not linked to data other than the data designated for deletion remains linked to the virtual data 100. , Only isolated data that is not linked from other data other than the specified deletion data will be linked.

Next, in step 43 (see FIG. 6), the process of deleting the isolated data is performed. In the process of deleting the isolated data (see FIG. 8), first, in step 411, the deleted data table is copied to the local area in the auxiliary storage device 20, and in step 412, the deleted data table is initialized. In step 413, a variable p for counting the data (isolated data) stored in the deleted data table copied to the local area is initialized (set to p = 0).

In step 414, the variable p is incremented by 1. In step 415, the data management file for p-th isolated data is opened, and in step 416, p
A variable q for counting the link data of the th isolated data is initialized (q is set to 0). Step 418
Then, the link replacement processing of the q-th link data of the p-th isolated data is performed. For this processing, the above-mentioned link replacement processing routine (see FIG. 5) is recursively called. That is, in the example of FIG. 1, the link data of the isolated data (C) includes the data E and F. Therefore, for example, first, the data E is linked to the virtual data 100 (see the link replacement process (see FIG. 5). )), The information of the data E is erased from the link data of the data C (steps 302 to 305). Next, the data F is linked to the virtual data 100, and the information of the data F is erased from the link data of the data C.

At step 419, it is determined whether q is equal to or more than the total number Q of link data. That is, it is determined whether all the link data of the p-th isolated data are linked to the virtual data 100. When all the link data of the p-th isolated data are not linked to the virtual data 100, the process returns to step 417 and the above processing (step 4
17 to step 419) is repeated. On the other hand, if all the link data of the p-th isolated data are linked to the virtual data 100, the data management file of the p-th isolated data is closed in step 420, and step 421.
Then, the data management file and the media file of the p-th orphan data are deleted.

In step 422, it is determined whether or not all the isolated data has been deleted. If all the isolated data have not been deleted, the process returns to step 414 and the above processing (steps 414 to 422) is repeated. If all orphan data is deleted, step 44 (see FIG. 6)
Return to

In this way, after the link data of the data designated to be deleted is held in the virtual data 100, the data designated to be deleted and the link data of the data designated to be deleted are deleted. The specified data can be deleted without having to judge for all other data whether or not there is data linking the linked data based on the link data held by. It can be easily deleted.

At step 44, it is judged whether the number of linked data of the data linked to the virtual data 100 is 0 or not. In the example of FIG. 1, the data E and F are the virtual data 10 in step 418 in the above-described isolated data deletion processing.
Since it is linked to 0, it is determined that the number of linked data of the data linked to the virtual data 100 is not 0, and the process returns to step 42 (step 42,
Repeat step 43). That is, in the isolation determination process (FIG. 7), whether or not other data other than the link data of the data (C) designated for deletion and the data (E, F) designated for deletion link the data E, F. To determine.
Regarding the data E, since the data B and I link the data E, the link of the data E with the virtual data 100 is released. On the other hand, as for the data F, only the data C links the data F, so the data F is not released from the virtual data 100. In this case, only the data F is judged to be the isolated data (data E
Is not determined to be isolated data because it is linked to the data B and I), and the data to be deleted in the isolated data deletion processing (see FIG. 8) is the data F.

In the isolated data deletion processing performed on the data F, as described above, the link data I of the data F is deleted.
Is linked to the virtual data 100, and the data F is deleted. When the orphan data deletion processing ends, step 44
(See FIG. 6), in step 44, the virtual data 10
It is determined whether or not the number of link data of 0 is 0. In this case, since the data I is linked to the virtual data 100, it is determined that the number of linked data of the data linked to the virtual data 100 is not 0, and the process returns to step 42,
The isolation determination process (step 42) is performed.

In this isolation determination process, it is determined whether the data I is linked with other data. in this case,
Since data I is linked to data D, data I
The link with the virtual data 100 is released, and the isolated data disappears. That is, there is no data linked to the virtual data 100. This completes all the processing.

As described above, after deleting the data designated to be deleted and the link data of the data designated to be deleted, whether the data linked based on the link data of the virtual data is linked from other data or not. Judge, delete the link data from the virtual data if linked from other data, and link the data linked based on the linked data of virtual data if not linked from other data After the data is held in the virtual data, the process of deleting the data linked based on the link data of the virtual data and the link data of the data is repeated until all the link data of the virtual data 100 is deleted. The data that is linked based on the link data of the data that is no longer linked from the data It is not necessary to determine for all of the other data to see if is there, it is possible to delete the data that became link of Lek from other data, it is possible to perform the deletion of data easily.

As described above, since the hyper-structured data can be managed by the data deletion method of the data group that can easily delete the data in the one-way link method, the processing of the link operation between the data is simplified. In addition, the processing time when data deletion is designated is shortened, which is extremely effective in practice.

In the embodiment described above, an example in which specific data is deleted from a data group consisting of a plurality of data that holds at least one piece of data for referring to lower data as reference data has been described. The present invention is not limited to this, and can also be applied to the case of deleting specific data from a data group including a plurality of data that holds at least one piece of data for referencing higher-order data as reference data.

[0056]

As described above, according to the first aspect of the invention, after the reference data held by the data designated for deletion is held in the virtual data, the data designated for deletion and the data designated for deletion are held. In order to delete the reference data to be deleted, it is specified to be deleted without judging whether all the other data refer to the data referred to based on the reference data held by the specified deletion data. Since the deleted data can be deleted, there is an effect that the data can be deleted easily.

According to the second aspect of the invention, the first step is performed until all the reference data held in the virtual data is deleted.
Since the second step and the third step are repeated, even when deleting data that is no longer referenced by other data,
After the reference data held by the data is held in the virtual data, the reference data held by the data that is no longer referenced by other data is deleted because the data and the reference data held by the data are deleted. It is possible to delete data that is no longer referenced by other data without having to determine whether there is referenced data for all other data based on the data referenced based on It has an effect that it can be performed easily.

[Brief description of drawings]

FIG. 1 is a diagram showing an example of hyper-structured data and virtual data to which data designated for deletion is linked in the present embodiment.

FIG. 2 is a diagram showing a storage table (deleted data table) of data designated for deletion in a data management file.

FIG. 3 is a schematic diagram of a system to which this embodiment is applicable.

FIG. 4 is a flowchart showing a main routine of a link replacement process in the present embodiment.

FIG. 5 is a flowchart showing a subroutine of link replacement processing in the present embodiment.

FIG. 6 is a flowchart showing a main routine of data deletion processing in the present embodiment.

FIG. 7 is a flowchart showing a subroutine of isolation determination processing in the main routine of the data deletion processing of the present embodiment.

FIG. 8 is a flowchart showing a subroutine of an orphan data deletion process in the main routine of the data deletion process of this embodiment.

FIG. 9 is a diagram showing hyper structure data.

FIG. 10 is a configuration diagram of a data management file.

FIG. 11 is a configuration diagram of a database management file.

FIG. 12 is a flowchart showing a main routine of data deletion processing in the one-way link method.

FIG. 13 is a flowchart showing a subroutine of a link releasing process in the main routine of the data deleting process of FIG.

14 is a flowchart showing a subroutine of data deletion processing in the subroutine of link cancellation processing of FIG.

FIG. 15 is a diagram showing the contents of link data in a data management file during data deletion processing.

[Explanation of symbols]

 100 virtual data for deletion

Claims (2)

[Claims] 1. A specific data group consisting of a plurality of data which holds, as reference data, one of data for referencing at least one upper data and data for referencing at least one lower data. In the method of deleting data of a data group for deleting data, virtual data different from the data making up the data group is provided, reference data held by the data designated for deletion is held in the virtual data, and then the deletion designation is made. The deleted data and the reference data held by the specified deletion data are deleted. 2. After the deletion-designated data and the reference data held by the deletion-designated data are deleted,
A first step of determining whether or not the data referred to based on the reference data held in the virtual data is referred to by other data until all the reference data held in the virtual data is deleted, The second step of deleting the reference data from the virtual data when the data is referenced by other data, and the reference data held in the virtual data when the data is not referenced by other data. Based on the reference data held based on the reference data held in the virtual data after holding the reference data held by the data referred to based on the virtual data, based on the reference data held in the virtual data The method of deleting data of a data group according to claim 1, wherein the third step of deleting the reference data held by the referenced data is deleted.