JPH0296850A - Deletion/restoration processing system for variable length data - Google Patents

Abstract

PURPOSE:To efficiently delete and restore variable length data without the necessity of an excess area for saving by deleting and restoring variable length data by means of the operation of a registration flag. CONSTITUTION:A variable length data file 18 in which variable length data is stored, an index file 17 in which position information of the registration flag showing whether respective variable length data are registered or not and position information of respective variable length data are stored and a registration processing part 13 which stores position information of variable length data in the index file 17 at the time of storing variable length data and sets the registration flag concerned to a registered state are given. Furthermore, a deletion processing part 14 which sets the registration flag concerned to an unregistered state with respect to the deletion indication of variable length data and a restoration processing part 15 which resets the registration flag concerned to the registered state with respect to the restoration indication of deleted variable length data are provided. Then, variable length data are deleted and restored by the operation of the registration flag. Thus, variable length data can efficiently be deleted and restored.

Description

[Detailed Description of the Invention] [Summary] Variable-length data deletion/restoration processing method in a data processing system that has the processing capability of managing variable-length, finite, ordered data and deleting and restoring that data. The purpose of this document is to provide a means for efficiently deleting and restoring variable-length data regarding variable-length data, and indicates the variable-length data file in which variable-length data is stored and whether each variable-length data is registered or not. An index file that stores registration flags and position information for each variable-length data, and a registration that stores the position information of the variable-length data in the index file when storing variable-length data, and sets the corresponding registration flag to the registered state. A processing unit changes the corresponding registration flag to an unregistered state in response to an instruction to delete variable-length data, and a deletion processing unit that changes the corresponding registration flag to an unregistered state in response to an instruction to restore deleted variable-length data. The configuration is such that the variable-length data is deleted and restored by operating the registration flag.

[Industrial application field]

The present invention relates to a variable-length data deletion/restoration processing method in a data processing system having a processing function for managing variable-length, finite, ordered data, and for deleting and restoring the data.

[Conventional technology]

When dealing with character patterns such as kanji (kanji) in a computer system, 5 methods are used, such as CG character patterns, which express the pattern with a set of a predetermined number of dots, and stroke character patterns, which express the pattern with a set of line segments. It is being The latter method using stroke character patterns is often used in single-figure processing systems because it is relatively easy to enlarge or reduce one character in one rotation.

The data length of a stroke character pattern is variable depending on the number of line segments constituting one character, but when creating or changing a single character pattern, processing such as deletion or restoration of the data is required.

Conventionally, when restoring such variable-length, finite, ordered data after deletion, the data to be restored has been saved in a predetermined RJT area in advance. That is, regardless of whether or not restoration is to be performed later, an extra area is secured for restoration and the data to be deleted is saved to that area.

[Problem to be solved by the invention]

In order to provide a function that allows you to restore deleted data, the conventional method required you to save the contents of the data to be deleted in advance.

There is a problem in that an area is required to save the data, and it takes time to delete and restore the data.

Furthermore, in the conventional method, when a series of processes that create or edit data ends, the backup area that stores the contents of the deleted data is released, so it is no longer possible to restore the data after that process ends. There was a problem.

SUMMARY OF THE INVENTION An object of the present invention is to solve the above-mentioned problems and to provide a means for efficiently deleting and restoring variable length data without requiring an extra area for saving.

[Means to solve the problem]

FIG. 1 is a diagram explaining the principle of the present invention.

In FIG. 1, 10 is a processing unit including a CPU and memory, 11 is an input/output device such as a display and a keyboard, 12 is a main control unit that controls data editing, and 13 is a registration processing unit that registers data. , 14 represents a deletion processing unit that deletes data, 15 represents a restoration processing unit that restores deleted data, 16 represents an external storage device such as a magnetic disk device, 17 represents an index file, and 18 represents a variable length data file.

The present invention is applied to a data processing system that manages variable-length, finite, and ordered data.

The variable length data file 18 is a file in which variable length data to be managed is stored.

An index file 17 is provided to manage each variable length data in the variable length data file 18. In the index file 17, for example, as shown in FIG. 1(b), registration flags and relative offset information regarding each variable length data are set.

Registration flags in the index file 17 are prepared in advance for the number of variable length data that can be registered,
The order of each registration flag corresponds to the order determined depending on the type or content of variable-length data. This registration flag indicates whether or not the corresponding variable length data is registered.

The relative offset in the index file 17 is
This information indicates the position where each piece of variable length data exists, and like the registration flag, the storage area is provided according to the order of the variable length data.

In response to the registration instruction from the main control unit 12, the registration processing unit 13 stores the specified variable length data in the variable length data file 18, stores the position information of the variable length data in the index file 17, and stores the specified variable length data in the index file 17. Performs processing to set the registration flag to the registered state.

In response to an instruction to delete variable-length data, the deletion processing unit 14
Processing is performed to set the registration flag corresponding to the variable length data in the index file 17 to an unregistered state.

The restoration processing unit 15 performs a process of resetting the corresponding registration flag in the index file 17 to the registered state in response to an instruction to restore the deleted variable length data.

(Operation) The registration flag in the index file 17 is g4.
For example, when it is 1" (ON), it indicates that the corresponding variable length data is registered in the variable length data file 18, and when it is "0" (OFF).

Indicates that the corresponding variable length data is not registered.

Relative offsets have corresponding variable length data.

For example, an offset value indicating the number of bytes from the beginning of the variable-length data file 18 is shown.

Offcent value for data that is not registered from the beginning.

A value 1 that cannot actually be taken as an offset value. For example, "-
Enter "1".

When deleting variable length data, the variable length data file 18
Leave the contents as is 8 Index file 17
If only the process of turning off the registration flag is performed, the value of the relative offset and the variable length data itself remain, so when restoring, it is possible to simply turn the registration flag back on. Note that deleted data and unregistered data from the beginning can be determined based on whether the value of the relative offset is "-1" or something else.

Unless the variable length data in the variable length data file 18 is replaced or compressed, the original data will remain regardless of deletion or restoration.

Restoration is possible even after the process ends, and the period during which restoration can be guaranteed against accidental deletion is extended.

[Example] FIG. 2 shows a processing configuration of an embodiment of the present invention, FIG. 3 shows an example of the configuration of a kanji stroke table according to an embodiment of the present invention, and FIG.
The figure shows a processing flow of a registration processing unit according to an embodiment of the present invention.
FIG. 5 is a processing flow of a deletion processing section according to an embodiment of the present invention, FIG. 6 is a processing flow of a restoration processing section according to an embodiment of the present invention, and FIG. 7 is a processing flow of a deletion processing section according to an embodiment of the present invention. The processing flow of the compression processing unit is shown.

FIG. 2 shows the processing configuration of a processing system having functions for deleting and updating a kanji stroke table. Second
In the figure, the same reference numerals as in FIG. 1 correspond to those shown in FIG. 1, 20 represents a character creation processing section, and 21 represents a compression processing section.

The kanji stroke table is a table that stores coordinate data necessary for writing stroke characters (line segment characters) for each character code.

Therefore, the data stored in the kanji stroke table has a different data length for each character, the number of characters that can be defined is limited, and there is order in ascending code order.

The character creation processing unit 20 uses conversation with the user.

A stroke character pattern is created, and in response to a registration instruction, the registration processing section 13 is called to register data of the created stroke character pattern in a kanji stroke table.

The compression processing unit 21 discards the deleted data when the area for the kanji stroke table becomes insufficient or when restoration becomes unnecessary.

It organizes data.

In this example, the configuration of the kanji stroke table is
It is as shown in the figure.

Kanji stroke table is in index file 17
and a stroke character pattern file 30.

The stroke character pattern file 30 corresponds to the variable length data file 18 shown in FIG.

The registration flag of the index file 17 turns on whether the character pattern data in the stroke character pattern file 30 is accessible, that is, whether it is in the registered state.
Indicated by 10 F F. Additionally, relative offsets have corresponding character pattern data.

It shows how many digits there are from the beginning of the stroke character pattern file 30. If character pattern data corresponding to the relative offset does not exist, the relative offset value is set to "-1". Registration flags and relative offsets are arranged in ascending order of stroke character code.

The character pattern data stored in the stroke character pattern file 30 consists of a set of a two-character code, a data length, and coordinate data of line segments constituting one character. Data is stored in the stroke character pattern file 30 in order from the beginning in accordance with the order of pattern creation and registration, regardless of the order of the two-character codes.

In the example shown in FIG. 3, the character pattern data of the first character code of 5 is stored from the 12th byte onwards from the beginning of the stroke character pattern file 30. The character pattern data of the second character code is stored after the 28th byte from the beginning. On the other hand, the fourth character code is unregistered because the registration flag is OFF and the relative offset value is "-1".

The kanji stroke table has this data structure, so if you want to delete character pattern data for a certain code, set the registration flag corresponding to that code to OFF.
Just set it to F. As a result, even if you execute the deletion, 1
Relative offset values and character pattern data remain as they were.

Therefore, restoration processing after deletion only requires turning the corresponding registration flag back on, and even if the user deletes by mistake, restoration processing can be easily performed.

In this embodiment, there are approximately 26,000 types of single character patterns, and the size of the stroke character pattern file 30 is approximately 1.5 Mbytes. At this time, the size of the index file 17 is about 150 bytes, which is a small 63y area compared to the entire size.

FIG. 4 shows a processing flow of the registration processing section 13 shown in FIG. ■ to ■ in the following description correspond to processes ■ to ■ shown in FIG.

■ When registration of a character pattern created by the character creation processing section 20 shown in FIG. 2 is instructed, the final storage position (E OF: E
nd Of File), add stroke character pattern data such as the character code, data length, and coordinate data to be registered.

(2) Next, register the relative offset corresponding to the added character code in the index file 17.

(2) Also, turn on the registration flag corresponding to the added character code in the index file 17. This completes the registration process.

FIG. 5 shows a processing flow of the deletion processing unit 14 shown in FIG.

When activated by the main control unit 12 and instructed to delete data, the deletion processing unit 14 sets a registration flag corresponding to the character code to be deleted in the index file 17.
Make it FF. Then, the deletion process ends.

6 shows a processing flow of the restoration processing section 15 shown in FIG. 2. ■ to ■ in the following description correspond to processes ■ to ■ shown in FIG.

■ Refer to index file 17 and find the relative offset corresponding to the code of the character to be restored.

Determine whether it is "-1". If it is "-1", it means that the data of the character code for which restoration was instructed has never been registered from the beginning or was discarded by 1 compression.

Output an error message if necessary and end the restoration process.

(2) If the relative offset is not "-1", the registration flag corresponding to the code to be restored in the index file 17 is turned ON, and the restoration process is ended.

FIG. 7 shows a processing flow of the compression processing section 21 shown in FIG. ■ to ■ in the following description correspond to processes ■ to ■ shown in FIG.

(2) When the stroke character pattern file 30 becomes too large due to frequent deletion or replacement of data, the compression processing unit 21 is activated. The compression processing unit 21 first prepares a work area for work.

■ Refer to index file 17 and select only the character pattern data of the codes whose registration flag is ON.
It is extracted from the stroke character pattern file 30 and sequentially written to the work area from the first code to the last code.At the same time, the relative offset value in the index file F is updated.

(2) Finally, the contents of the work area are copied onto the stroke character pattern file 30, and the compression process is completed.

Due to the compression process, previously deleted data cannot be restored, but the stroke character pattern file 30
This will free up unnecessary space in . Even after the compression process, if it is likely that the previous data will need to be restored, this can be done by creating bank amplifier files for the index file 17 and stroke character pattern file 30 before compression, for example.

(Effects of the Invention) As explained above, according to the two aspects of the present invention, deletion processing can be realized by simple operations without being conscious of restoration. Restoration processing can also be accomplished with simple operations without accessing variable-length data files. As long as the user does not consciously replace or compress data, it is possible to restore the data forever, which prevents data loss due to erroneous operations.

[Brief explanation of drawings]

FIG. 1 is an explanatory diagram of the principle of the present invention. FIG. 2 is a processing configuration of an embodiment of the present invention. FIG. 3 is an example of the configuration of a kanji stroke table according to an embodiment of the present invention. FIG. 4 is a processing flow of the registration processing unit according to an embodiment of the present invention. FIG. 5 is a deletion process according to an embodiment of the present invention. FIG. 6 shows a processing flow of a restoration processing section according to an embodiment of the present invention.FIG. 7 shows a processing flow of a compression processing section according to an embodiment of the present invention. In the figure, 10 is a processing device, 11 is an input/output device, and 12 is a main f
iq control section, 13 is a registration processing section, 14 is a deletion processing section, 15
1 is a restoration processing unit, and 16 is an external storage device. 17 represents an index file 118 that is a variable length data file.

Claims (1)

[Claims] In a data processing system having a processing function for managing variable length, finite, ordered data, and deleting and restoring the data, a variable length data file in which variable length data is stored ( 18
), and a registration flag indicating whether each variable length data is registered or not according to a predetermined order of the variable length data, and an index storing information indicating the position of each variable length data in the variable length data file. File (17
), and a registration processing unit (13) that stores the specified variable length data in the variable length data file, stores the position information of the variable length data in the index file, and sets the corresponding registration flag to the registered state. ), a deletion processing unit (14) that sets the corresponding registration flag in the index file to an unregistered state in response to an instruction to delete variable-length data; A restoration processing unit (15) for resetting a corresponding registration flag in a file to a registered state, the variable-length data being deleted and restored by manipulating the registration flag. Deletion/restore processing method.