JPH0228846A - Data storing system - Google Patents

Abstract

PURPOSE:To attain high speed storage and retrieval concerning the data of the constant quantity of a same retrieving key and to efficiently utilize whole storage capacity by adding the conception of a common storing area to a retrieval sequence programming file system. CONSTITUTION:When the storage request of the data is generated, a data storage processing means 3 checks a data storing area 12 with the retrieving key, which is included in the data, and investigates whether there is an idle area or not. When there is the idle area, the storage processing means 3 stores the data to the data storing area and processing is finished. When there is no idle area, a pointer 21 for the idle area of a common storing area 2 is referred and the data are stored to a data storing area 23 of the idle area. Next, the data storage processing means 3 judges whether the common storing area 2 is used with the same retrieving key or not. Then, when the storage is the first storage to the data storing area 23, the position of the data storing area 23 is set to a pointer 13 and relating from an area 1 to an area 2 is executed.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a data storage method in a storage device in an electronic computer system, and more particularly to a data storage method for storing data having an index key in a storage area.

[Conventional technology]

Conventionally, an index sequential file system is widely known as a storage system for data having this type of index key. This indexed sequential file system prepares a fixed amount of data storage area called a record for each index key, and when setting the record size (record length), the largest amount of data to be stored is It was necessary to match.

[Invention tries to solve! IME In the conventional indexed sequential file system described above, it is necessary to set a fixed amount of data storage area corresponding to each index key and the size of the data storage area to match the maximum data. If there are variations in the amount of stored data, there is a disadvantage that for index keys with a small amount of data, the data storage area is often unused, and the data storage efficiency of the entire storage area is reduced.

In view of the above-mentioned points, an object of the present invention is to provide a high-speed storage and retrieval function for data having index keys and effective use of storage space by adding the concept of a common storage area to the conventional indexed file system. An object of the present invention is to provide a data storage method that achieves both of the following.

[Failure to solve the problem]

The data storage method of the present invention is a data storage method in which data having an index key is stored in a storage area. A common storage area provided with a data storage area for storing pigs that could not be stored in the data storage area corresponding to index 4-1 of the index key corresponding storage area, and a common storage area corresponding to the index key of the index key corresponding storage area. When there is empty space in the data storage area to store data, data is stored in this data storage area, and when there is no empty space in the data storage area corresponding to the index key in the index key corresponding storage area, the data storage area in the common storage area is stored. and data storage processing means for storing data in the empty area of the computer.

[Effect]

In the data storage method of the present invention, a data storage area that can store a certain amount of data for each index key is provided in the index key corresponding storage area, and a data storage area corresponding to the index key of the index key corresponding storage area is provided in the common storage area. A data storage area is provided to store data that cannot be stored in the storage area, and the data storage processing means stores data in this data storage area when there is empty space in the data storage area corresponding to the index key in the index key corresponding storage area. When there is no empty area in the data storage area corresponding to the index key in the index key corresponding storage area, data is stored in the empty area in the data storage area of the common storage area.

〔Example〕

Next, the present invention will be explained with reference to the drawings. '1st
FIG. 1 is a block diagram showing the configuration of a data storage method according to an embodiment of the present invention. The 'f-evening storage method of this embodiment is as follows:
Its main parts are composed of an index key corresponding storage area 1, a common storage area 2, and a data storage processing means 3.

In the index key storage area 1, a fixed amount of data storage area (record) 12 is set for each index key. Specifically, the index key corresponding storage area 1 includes a plurality of index key units 11.
, a fixed amount of data storage area 12 provided for each index key section 11 , and a pointer 13 to a common storage area provided for each index key section 11 .

The common storage area 2 is not an area corresponding to a specific index key, but a storage area common to each index key, and stores data corresponding to all index keys. Specifically, the common storage area 2 includes a pointer 21 of the curvature area, a plurality of index key sections 22, a plurality of data storage areas 23, and a plurality of pointers 24 within the common storage area.

The index key sections 11 and 22 are areas for storing index keys for classifying and identifying stored data, and the pointer 13 to the common storage area is for storing a plurality of data corresponding to the index keys in the index key corresponding storage area 1. When the data cannot be stored in the area 12, the data is stored in the data storage area 23 of the common storage area 2, but at that time, the first data stored in the common storage area 2 for each index key is stored. This is a pointer indicating the storage position of the area 23.

The empty area pointer 21 is a pointer that indicates in which data storage area 23 the data should be stored when storing it in the common storage area 2 (which data storage area 23 is the first empty area). It is.

The pointer 24 in the common storage area is a pointer for logically connecting the data storage areas 23 in which data having the same index key is stored in the common storage area 2. Empty data storage area 2
3 are also logically connected by a port lid 24 in the common storage area.

In Fig. 1, %KX (X is a positive integer) is an index key, dll~dX (11421 (n is a positive integer) is data, P11~P, , , (e is an empty area) subscript indicating,
m is a positive integer) indicates a pointer.

Referring to FIG. 2, the processing in the data storage processing means 3 includes a step 31 of checking the data storage area corresponding to the index key, a step 32 of determining the presence or absence of an empty area, and a step 33 of storing data in the data storage area corresponding to the index key. , a step 34 of storing data in the common storage area, a step 35 of determining whether the common storage area is used with the same index key, a step 36 of setting a pointer to the common storage area, a step 37 of setting a pointer in the common storage area, and an empty area pointer update step 38.

Next, the operation of the data storage system of this embodiment configured as described above will be explained.

First, when a request to store certain data occurs, the disk storage processing means 3 searches the index key part 11 of the index key corresponding storage area 1 using the index key included in the data and checks the corresponding data storage area 12. Step 31) Checks whether there is an empty area in the data storage area I2 corresponding to the index key (Step 32) If there is an empty area in the data storage area 12 corresponding to the index key, the data storage processing means 3 The data is stored in the corresponding empty data storage area 12 of the key correspondence storage area 1 (step 33), and the process is ended.

In step 32, data storage area 1 corresponding to the index key is
If there is no free space in 2, the data storage processing means 3
Data is stored in the empty data storage area 23 with reference to the empty area pointer 21 of the common storage area 2 (step 34).

Next, the data storage processing means 3 determines whether or not the common storage area 2 is used with the same index key (step 35).
, if it is the first storage in the data storage area 23 of the common storage area 2 as data corresponding to the same index key, the position of the data storage area 23 is set in the pointer 13 to the common storage area of the index key corresponding storage area 1. By setting , the index key corresponding storage area 1 is logically associated with the common storage area 2 (step 36).

Subsequently, or if it is determined in step 35 that the data with the same index key is already stored in the data storage area 23 in the common storage area 2, the data storage processing means 3 stores the data in the common storage area 23. By setting the position of the data storage area 23 in the pointer 24, the newly stored data is logically associated with the already stored data (step 37).

Finally, the data storage processing means 3 stores the empty area pointer 2.
1 to point to the first empty data storage area 23 in the common storage area 2 in preparation for the next data storage (step 38), and the process ends.

〔Effect of the invention〕

As explained above, the present invention enables high-speed storage and retrieval of a certain amount of data with the same index key by adding the concept of a common storage area (=J) to the conventional index sequential file system. For storage and retrieval of data with the same index key that exceeds a certain threshold, storage capacity is given priority, and the entire storage area can be used efficiently.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the configuration of a data storage system according to an embodiment of the present invention, and FIG. 2 is a flowchart showing processing in the data storage processing means in FIG. In the figure, 1... Index key corresponding storage area, 2... Common storage area, 3... Data storage processing means, 11... Index key section, 12... Data storage area (record), 13 . . . Pointer to common storage area, 21 . . . Pointer to empty area, 22 . . . Index key section, 23 . .

Claims (1)

[Claims] A data storage method in which data having an index key is stored in a storage area, comprising: an index key corresponding storage area provided with a data storage area capable of storing a certain amount of data for each index key; a common storage area provided with a data storage area for storing data that could not be stored in the data storage area corresponding to the index key in the corresponding storage area; and a data storage area in the data storage area corresponding to the index key in the index key corresponding storage area. When there is an empty area, data is stored in this data storage area, and when there is no empty area in the data storage area corresponding to the index key in the index key corresponding storage area, data is stored in the empty area in the data storage area of the common storage area. 1. A data storage method comprising: a data storage processing means for storing.