JP2604787B2 - Two-dimensional data storage method - Google Patents

Description

Description: FIELD OF THE INVENTION The present invention relates to a two-dimensional data storage system, and more particularly to a two-dimensional data storage system capable of searching using multiple keys.

[Conventional technology]

The conventional two-dimensional data storage method uses a multi-level key unit in a main storage table to improve processing time, especially in a computer system that performs online processing that requires high-speed data storage and retrieval. And the data part is stored in the auxiliary storage.

In the conventional two-dimensional data storage method, the maximum capacities of the key portion and the data portion, the position of the key, the type of attribute information, and the like are determined and fixed at the stage of programming.

[Problems to be solved by the invention]

In the conventional two-dimensional data storage method described above, at the stage of programming, a table on a main memory having a key portion,
And the file on the auxiliary storage for storing the data section must be reserved and set according to the maximum capacity specified in advance by the program. There is a problem that the main memory and the auxiliary memory cannot be used efficiently when there is a considerable difference in the size of the key portion and the data portion depending on the type.

Also, since the data part is stored in the auxiliary storage,
There is a problem that it takes time to search and store data.

An object of the present invention is to use a main memory efficiently by securing a use area on a main memory necessary for a key portion and a data portion according to the type of a file to be processed at the time of execution of a process. Department is divided into segments and resident /
An object of the present invention is to provide a two-dimensional data storage method capable of processing a file having a large amount of two-dimensional data which is not limited by the main storage capacity of a computer by enabling designation of non-resident status.

[Means for solving the problem]

The two-dimensional data storage method according to the present invention includes: (A) a combination of some keys for specifying a data row and a data pointer indicating an address for storing the data row specified by the some keys, A row management key table held on the main memory of the computer for each of the types specified by the several keys, (B) the attribute information of each column given to each data of the data row, A column management table held on the main storage; (C) an address indicated by the data pointer specified by the several keys, indicating the data row holding each data of each column meaninged by each of the attribute information In the order of the number of rows of the type specified by the several keys,
A data table that can be stored in the main memory of the computer and, when the number of data rows that can be stored in the main memory of the computer exceeds the number of rows, stored in the auxiliary storage of the computer in an appropriate number of rows. I have.

〔Example〕

Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 is an information structure diagram showing one embodiment of a two-dimensional data storage method of the present invention.

As shown in FIG. 1, a row management key table 1 stores a first key for specifying a data row on a main memory of a computer.
Each column of the data pointer indicating the address for storing the data line specified by the second key, the third key,... And the value of the key has a value. L (the number of types specified by the first key, the second key, the third key,...).

That is, the data row specified by a ₁ , b ₁ , c ₁ ,.
The data line at address p ₁ and identified by a ₁ , b ₂ , c ₂ ,... Is at address p ₂ and the data line identified by a ₂ , b ₂ , c ₁ ,. There the address _{p 4, a 3, b 1} , c 2, data lines specified by ...... respectively show that the address p _3.

The column management table 2 holds the attribute information of each column given to each data of the data row in the main memory of the computer, and stores the M of the number of columns having values in these columns.
Have.

That is, each data row is data of attribute information of X to X (1), data of attribute information of X to X (2),.
...

On the other hand, the data table 3 stores, in the row management key table 1, data rows holding M pieces of data, each of which is given a meaning by each of the attribute information of the column management table 2, the first key, the second key, and the third key. ,... In the order of the addresses indicated by the data pointers specified by the data pointers, the number of rows of the type specified by the first key, the second key, the third key,. When the number of data rows that can be held in the main memory of the computer exceeds the number of rows, the data is divided into n appropriate number of rows and stored in the auxiliary storage of the computer.

It should be noted that the data table 3 contains N of the number of held data.
(N = L × M).

That is, the data table 3 in FIG. 1 is two-dimensional data of L rows and M columns. _{For, a 1, b 1, c} 1, d 11 as the first data line from the position of the address p ₁ indicated by the data pointer specified by ...,
d ₁₂ , d ₁₃ ,..., d _{1 M,} and d ₂₁ , d ₂₂ as the next data line from the position of the address p ₂ indicated by the data pointer specified by a ₁ , b ₂ , c ₂ ,. , d ₂₃ ,..., in this order, a table of index sequential organization is constructed, indicating that all of the data in the L rows and M columns are held.

Thus, the data table 3 can be searched and updated for each data row having an address.

Next, an operation of storing two-dimensional data in this embodiment will be described.

FIG. 2 is a flowchart showing the two-dimensional data storage operation of this embodiment.

When the target two-dimensional data is stored in the data table 3, the following operation is performed in response to the data to be stored which are sent out of order one after another.

First, in step S1, when the received data includes the attribute information for updating, the attribute information X to X (1), X to X of the target two-dimensional data held in the column management table 2 is stored.
X (2),... Are updated, and the number M of columns is updated and held.

Next, in step S2, a search is performed to determine whether or not there is a row in which each key of the received data matches each key of the rows held so far in the row management key table 1.

Next, in step S3, the result of step S2 is determined. If there is no matching row, the key set of the received data is new (YES). If it is not new (NO), step S5
Move on to

In step S4, each key of the received data is inserted as a row in the row management key table 1 at a row position where the key arrangement order is ascending, and the subsequent rows are shifted backward by one row. The data pointer of the inserted row has a value (L × M) indicating the new storage position of the data table 3 as an address. Further, 1 is added to the number L of rows in the row management key table 1.

On the other hand, in step S5, in the row management key table 1, the value of the address indicated by the data pointer in the row corresponding to each key of the received data is read.

Next, in step S6, the received data is received from the row management key table 1 and received from the column management table 2 by receiving the address indicated by the data pointer of the row corresponding to each key of the received data. Each piece of attribute information for data is received, the received data is divided into M parts, and each piece of attribute information (column is specified in order) from the address (data row is specified) in the data table 3. ), And M is added to the number N of data in the data table 3.

As described above, the two-dimensional data storage method according to the present embodiment secures a used area on the main memory necessary for the key part and the data part according to the type of the file to be processed at the time of executing the processing. A file having a large amount of two-dimensional data which is not limited by the main storage capacity of the computer is processed by efficiently using the main storage and dividing the data portion into segments to enable designation of resident / non-resident. be able to.

〔The invention's effect〕

As described above, the two-dimensional data storage method of the present invention secures a used area on a main memory necessary for a key part and a data part according to the type of a file to be processed at the time of executing a process. To process a file having large-capacity two-dimensional data which is not limited by the main storage capacity of the computer by efficiently using the main storage and dividing the data section into segments to enable designation of resident / non-resident. It has the effect that it can be done.

Further, in the two-dimensional data storage method of the present invention, since the processing part of the data part operates on the main storage, the data part is compared with the conventional two-dimensional data storage method in which the entire data part operates on the auxiliary storage. This has the effect of greatly speeding up the storage and retrieval of.

[Brief description of the drawings]

FIG. 1 is an information configuration diagram showing one embodiment of a two-dimensional data storage method according to the present invention, and FIG. 2 is a flowchart showing a two-dimensional data storage operation of this embodiment. 1 ... row management key table, 2 ... column management table, 3
...... Data table.

Claims (1)

(57) [Claims] (A) A combination of some keys for specifying a data line and a data pointer indicating an address for storing the data line specified by the some keys is
A row management key table held on a main memory of a computer for each of the types specified by the several keys; and (B) a column management key table for each column of attribute data given to each data of the data row. (C) The data pointer specified by the several keys indicates the data row holding each data of each column meaninged by each of the attribute information. In the order of the addresses, the number of lines of the type specified by the several keys,
A data table that is stored in the main memory of the computer and that can be stored in the auxiliary storage of the computer in an appropriate number of rows when the number of data rows that can be stored in the main memory of the computer exceeds the number of rows. Two-dimensional data storage method.