JPH0344746A - Data store system - Google Patents

Abstract

PURPOSE:To flexible cope with the addition of index records by forming a chain of index records via the record pointers. CONSTITUTION:An index record Mn consits of a key part, a pointer to the next index record, the data record head address, and the parameters of the data number, etc. A data record Dn consists of a pointer to the next record, the record length (data record length), the data, etc. That is, a pointer is added to the index record like the data record and a chain of index records is obtained. Thus both data and index records are treated equally to each other without fixing an index record store area. Then the processes for reinitialization, etc., can be omitted since the index record store area produces no shortage.

Description

TECHNICAL FIELD The present invention relates to a data storage system, and more particularly to a data storage system for storing information as a record in a storage means such as a file or memory.

Prior Art Conventionally, this type of data storage method uses index records to facilitate data record searches.
This index record is stored together with the data record. In this case, it is common to predetermine an index record storage area and a data record storage area within the storage means at the time of initialization.

FIG. 4 shows an example of such a conventional data storage system. (A) is a diagram showing an image of an index record section and a data record section, in which an area for storing index records Mn and an area for storing data records Dn are distinguished and fixed in advance in the memory or file. ing.

(B) shows the format of the index record,
It includes the key part, the data part start address, the number of data, etc. (C) shows the format of the data record, which consists of a pointer to the next record, record length, data, etc.

As described above, since the storage area of the index section is preset at the initial stage, it is not easy to change the area of the index section during operation. If index data is added to the index section during operation and it can no longer be stored, this method has the disadvantage that it will be necessary to expand the area of the index section.

Purpose of the Invention Therefore, the present invention has been made to solve the drawbacks of the conventional method, and its purpose is to provide a data storage method that can flexibly respond to the addition of index records. Our goal is to provide the following.

Structure of the Invention According to the present invention, there is provided a data storage method in which data to be stored is divided into index records and data records and stored in a storage means, and the index records are chained by record pointers. There is obtained a data storage method characterized in that the index record and the data record can be stored in a mixed manner without distinguishing the storage areas for the index record and the data record in advance.

Example Hereinafter, the present invention will be explained in detail using the drawings.

FIG. 1 is a system block diagram of an embodiment of the present invention.

In the figure, an input/output device 1 performs data input/output processing, and an arithmetic processing device 2 performs necessary processing on human data.

Further, the data storage device 3 is a memory for temporarily storing processed data.

The data storage mechanism 4 has a function of performing necessary processing to store stored data in the file/memory 5, and is realized by hardware or software. The data storage mechanism 4 includes an execution mode check section 4, a formatting processing section 42, an index record creation section 43,
It consists of a data record creation section 44.

FIG. 2 is a flowchart of the operation processing of the data storage mechanism 4, and FIG. 3 shows the storage manner and format of index records and data records. In FIG. 3, (A) is a storage image diagram of an index record Mn, a data record Dn, and an empty record index record (shown as empty) in the soil/memory 5.

The record format of index record Mn is shown in Figure 3 (
As shown in B), it is assumed that the index consists of parameters such as a key part, a pointer to the next index record, a data record start address, and the number of data. Also, as shown in (C), the data record contains a pointer to the next record and a record length (length of the data record).
, data, etc.

As can be seen from Figures 3 (A) to (C), the index record is stored in a format in which the storage area of the index record section is not fixed, and a pointer is attached to the index record in the same way as the data record and chained. This greatly increases the degree of freedom when adding .

Next, the operating procedure of the embodiment of the present invention will be explained with reference to FIG. Stored data is input manually from the input/output device 1, subjected to necessary processing by the arithmetic processing device 2, and the results are stored in the data storage device 3 (step 20).

In the data storage mechanism 4, first, the execution mode is checked (step 21). At this time, if it is the initialization mode, formatting of the file/memory 5 is performed (step 22), and then empty records are chained (step 23).

On the other hand, if the execution mode is data storage mode, a check is made to see if there is any overlap between the already stored index key and the manually entered data (step 2).
4). If there is no duplication, an empty record for the index record is secured (step 25). Once an empty record is secured, an index record is created according to the format shown in FIG. 3(B) (step 26).

Next, an empty record for the data record is secured (step 27), and if it is secured, the process shown in FIG. 3(C)
A data record is created according to the format shown in (step 28).

As a result of the above, storage is performed as shown in FIG. 3(A).

Effects of the Invention As described above, according to the present invention, by chaining index records, data records and index records can be treated equally without fixing the index record storage area. Since there is no shortage of record storage area, processing such as reinitialization is not necessary, which is effective for files where data is frequently updated.

[Brief explanation of drawings]

FIG. 1 is a system block diagram of an embodiment of the present invention, FIG. 2 is a flowchart showing the operation of the embodiment of the present invention, and FIG. 3(A) is a diagram showing an example of data storage according to the embodiment of the present invention.
FIG. 3(B) is a format diagram of the index section according to the embodiment of the present invention, FIG. 3(C) is a format diagram of the data section according to the embodiment of the present invention, and FIG. 4(A) is a conventional data storage example. FIG. 4 (CB) is a format diagram of a conventional index section, and FIG. 4 (C) is a format diagram of a conventional data section. Explanation of symbols of main parts 4...Data storage mechanism 5...File/memory

Claims (1)

[Claims] (1) A data storage method in which data to be stored is divided into index records and data records and stored in a storage means, in which the index records are created by chaining each other using record pointers, and the index records are created by chaining each other using record pointers. A data storage method characterized in that the data record and the data record can be stored in a mixed manner without distinguishing between storage areas in advance.