JPH0218641A - Data control method - Google Patents

Abstract

PURPOSE:To cut down the data transfer frequency between the memory means and to improve the data retrieving efficiency by transferring the data related to the desired data retrieved out of a 2nd memory means in a 2nd retrieving step to a 1st memory means to store said data there in case the desired data is not obtained from a 1st memory means in a 1st retrieving step. CONSTITUTION:The desired data specified by an inputted identifier is retrieved out of the data stored in a 1st memory means 1 in a 1st retrieving step 10. While the paired data related to the desired data is retrieved out of the paired data stored in a 2nd memory means 4 in a 2nd retrieving step 11. In the case the desired data is not obtained in the step 10, the paired data retrieved in the 2nd step 11 are sent to the means 1 and stored there. Therefore the data related to the desired data can be retrieved out of the means 1 in the subsequent data retrieving steps. Thus it is possible to cut down the data transfer frequency between two memory means and to improve the data retrieving efficiency.

Description

[Detailed Description of the Invention] [Industrial Application Field] This invention provides a data management method in a system that utilizes data stored in a plurality of storage means, such as a database system, and in particular, to efficiently perform data retrieval. This is related to the method by which this can be done.

[Conventional technology]

For example, in a conventional database system, each piece of data is assigned an identifier for identifying the data and stored in a storage means, and the data is searched based on the identifier. In addition, there are two types of storage means: main storage, which has a limited capacity to some extent but can be searched quickly, and secondary storage, which has a relatively slow search speed but can have a large capacity.8 Normally, both of these storage devices are used. It is used to manage data accumulation and search. Figure 7 is 2
For example, ADDISON4ESLEY PUBLIS)I
C, J, FA written by DATE published by ING COMANY
n Introduction to Databas
75 is a flowchart when searching for data based on the conventional data management method as shown on page 75 of eSystemsj. First, in step (71), an identifier for specifying data to be searched (hereinafter referred to as a search identifier) is input. Next, in step (72), a search is performed from data in the main memory, where search processing is fast. That is, in the first step (73) of searching for data with the same identifier as the search identifier input in the above step (71) from among the data stored in the main memory, it is determined whether the corresponding data exists or not. If it exists, the corresponding data is stored in the output register as a search result in step (74), and the search process is ended. See you again.

If it is determined in step (73) that the corresponding data does not exist, a search is performed from the data in the secondary storage device in step (75), and the same identifier as the above search identifier is used in step (75). Search for the data with the ``mark'' in the data in the secondary storage device. Then, in step (76), it is determined whether the corresponding data exists, and if the corresponding data does not exist, it is determined that there is no corresponding data and the search process ends. Further, if the corresponding data exists, in step (77), the corresponding data is transferred to the main storage device together with the identifier attached to the data and stored therein. This is to improve processing efficiency by allowing the retrieved data to be immediately obtained from the main storage device without having to retrieve it from the secondary storage device each time when the retrieved data is referred to frequently later. Then, in step (78), the corresponding data is stored in the output register, and the search process is ended.

[Problem to be solved by the invention]

In the conventional data management method described above, if the desired data does not exist in the main storage and is retrieved from the secondary storage, only the retrieved data is transferred to the main storage. When continuously searching for data related to data, if the related data exists in the secondary storage device, both the main storage device and the secondary storage device are searched, and the search data Since the process of transferring data from the secondary storage device to the main storage device is executed one by one, the time required to search from the storage device and the number of times data is transferred between the storage devices increases, resulting in inefficiency. .

This invention was made in order to solve these problems, and when managing data using multiple storage means, it is possible to efficiently retrieve data by reducing the number of data transfers between the storage means. The purpose is to obtain management methods.

[Means to solve the problem]

The data management method according to the present invention includes an input step of inputting an identifier specifying desired data.

a plurality of data colors each assigned a data identifier and stored in the first storage means; a first search step for searching for desired data assigned a data identifier corresponding to the identifier input in the input step; Among the paired data stored in the second storage means, a pair of data and a data identifier assigned to the data is formed as a pair, and an identifier of the data related to the data is assigned as a related data identifier. a second search step of searching for paired data to which a related data identifier corresponding to the identifier input in the input step is added; 1. A transfer step of transferring the paired data retrieved in the search step to the first storage means and storing them therein.

[Effect]

In this invention, the desired data specified by the input identifier is searched from among the data in the first storage means in the first search step, and a related data identifier corresponding to the input identifier is assigned. The paired data, that is, the paired data related to the desired data is searched from the paired data in the second storage means in the second search step, and when the desired data is not found in the first search step, the second search step is performed. The paired data retrieved in the retrieval step is transferred to and stored in the first storage means, so that when data related to the desired data is retrieved in the second or subsequent data retrieval, the related data is stored in the first storage means. The processing time for retrieving the related data from the second storage means is reduced, and the data transfer from the second storage means to the first storage means is omitted. The number of data transfers is reduced.

[Embodiments of the invention]

FIG. 1 is a block diagram showing one embodiment of the present invention, and (1
) is a main storage device serving as a first storage means for storing data and data identifiers assigned to the data in one-to-one correspondence, and is capable of high-speed retrieval. This main storage device (1
), paired data formed by data and a data identifier assigned to the data constitutes a code, and the data identifier is stored in the data m interest field (2) and the data is stored in the data field (3). ing. (4) stores paired data formed by data and a data identifier, and a related data identifier that is assigned to this paired data and consists of the data identifier of the paired data and the data identifier of the paired data related to the paired data. This is a secondary storage device as a second storage means.

Within this secondary storage device (4), data, a data identifier assigned to that data, and a related data identifier assigned to paired data consisting of these constitute a code,
Each data identifier is a data identifier field (5)
The data is stored in the data field (6) and the related data identifier is stored in the related data identifier field (7). In the example data structure shown in Figure 1, D
Ata-a contains that Data as a related data identifier.
-a's own data identifier a and the identifier of Data-b of data related to Data-a are assigned and stored in the related data identifier field (7) of the record (8). (9) is a search identifier register into which a search identifier for specifying data to be searched is input; (10)
(11) is a main memory search means for searching the data in the main memory (1) for data attached with a data identifier corresponding to the input search identifier; a secondary storage that searches for the assigned paired data from the paired data in the secondary storage device (4) and extracts data assigned a data identifier corresponding to the search identifier from the retrieved paired data; The retrieval means (12) is this secondary memory retrieval means (1
Transfer means (13) transfers the paired data retrieved in step 1) to the main storage device (1);
), whether the desired data was found as a result of the search by the secondary storage search means (1), that is, whether the desired data existed in the secondary storage device (1) or the secondary storage device (4). 1. A data presence register stores a value indicated as 0 when the data does not exist. (14) is a data register that stores retrieved data.

When searching for desired data in such a configuration, the search is performed based on the flowchart shown in FIG. First, in step (21), the data existence flag (13
), data register (14), and initialize the contents of the transfer buffer. Next, in step (22), an identifier specifying the desired data to be searched is manually entered into the search identifier register (9). Next, in step (23), the main memory (1
) to search for desired data from the data in ). The details of this main memory search are shown in FIG. First, in (3),
Among each record in the main storage device (1), a record whose value in the data identifier field 2) matches the value in the search identifier register (9) is searched. Next, in step (32), it is determined whether or not a corresponding record exists, and if it does not exist, the search in the main memory is terminated (S2). If it exists, the value of the data existence flag (13) is set to 1 in step (33), and the value of the data field (6) of the corresponding record is stored in the data register (14) in step (34), and the value is stored in the main memory. The search is ended (S2). Then, the process proceeds to step (24) in FIG. 2, and it is determined whether the value of the data presence flag (13) is 1. If the value is 1, the desired data is retrieved and stored in the data register (14). Therefore, to finish the data search process, step (2)
5)), and if the value of the data existence flag (13) remains O, this indicates that the desired data does not exist in the main memory (1), so the process proceeds to step (26) and the data is stored in the secondary memory. Search for device (4). Details of this secondary memory search are shown in FIG. First, in the step (41), a search identifier register (9) is stored in the related data identifier field ('7) from among each record in the secondary storage device (4).
Find records that contain the same value as . Then step (
42) determine whether the corresponding record exists,
If it does not exist, end the secondary memory search (s4)
. If the corresponding record exists, the value of the data existence flag (I3) is set to 1 in step (43), and the value of the data existence flag (I3) is set to 1 in step (43).
In step 4), the values of the data identifier field (5) and data field (6) of each corresponding record are stored in the transfer means (12) as paired data, and the search in the secondary storage is completed (S4). Here, in this embodiment, an identifier that is never used as a data identifier is not used as a related data identifier. Therefore, if the data identifier of each data item itself is stored in the related data identifier field (7) as described above.

Among the paired data stored in the transfer means (I2), there is always data having a data identifier having the same value as the search identifier, that is, desired data. Then step (27) in Figure 2
), it is determined whether the value of the data existence flag (13) is 1, and if it is 1, the paired data stored in the transfer means (12) is transferred to the main memory (1) in step (28). )
At the same time, from among the transferred paired data, data whose data identifier value matches the search identifier value is extracted, and the value of that data is stored in the data register (
14) and ends the data search process (step (25). Also, in step (27), the data existence flag (
13) is O, the desired data is stored in the secondary storage device (
4) indicates that the data does not exist, and ends the search process without the corresponding data.

When data related to the data searched this time is to be searched for the second time and subsequent data searches due to the transfer operation in step (28) above, the related data will be stored in the main memory (1).
, and will be searched immediately. For example, mutually related data 1. Data 2. When data 3 exists in the secondary storage device (4) and these three pieces of data are searched in order, the conventional method is as shown in Fig. 5(a).
), and each time each data is searched, the main storage device (1) is searched (step (51b)).
, (52b).

(53b)), search of secondary storage device (4) (ste knob (51c)).

(52c), (53c)), data transfer (step (5]d).

(sza), (sza)) will be performed one after another,
According to this invention, as shown in FIG. 5(b), data 2
．． Searching for data 3 only requires searching from the main memory (1), which reduces the number of searches from the secondary storage (4), which takes processing time, and the number of data transfers, reducing processing time. In this way, the efficiency of search processing can be improved comprehensively.

In the above embodiment, the secondary storage device (4) is searched after the main storage device (]) is searched, but the main storage device (1) and the secondary storage device (4) are searched.
), and the search results in the secondary storage device (4) are transferred to the main storage device (1) based on the search results in the main storage device (1). play. In this case, if the desired data is found by searching the main storage device (1), the search in the secondary storage device (4) is stopped at that point and the next process starts, and if the desired data is not found, the next process is started. By completing the search in the next storage device (4), processing time can be made more efficient.

In addition, although the above embodiment has been described using a main storage device (1) and a secondary storage device (4), the present invention can be applied to a plurality of data management devices connected by a communication line. FIG. 6 is a block diagram showing an embodiment thereof.

In Fig. 6, (61) and (62) are the data management devices of the own site and other sites, respectively, (63) and (64).
) is the search means (65) provided in each data management device (61), (62), and (6B) is the search means (65) provided in each data management device (61), (62).
6]) and (62), and (67) is a communication line connecting each data management device (61) and (62). When performing a data search, the desired data is first searched from the storage means (65) of the own site, and if the desired data does not exist, it is searched from the storage means (66) of another site via two communication lines. However, if this invention is applied, similar to the above embodiment, - when searching from the storage means (66) of the perversion site, by transferring related data to the own site, the 9th time At the time of subsequent data searches, related data can be obtained only by search processing within the own site, reducing processing time and the number of times communication lines are used for communication between the two sites.

Furthermore, in the above embodiment, the case has been described in which the related data identifier given to each data is stored in the secondary storage device (4) together with paired data consisting of the data and the data identifier to form a code. The related data identifier may be stored separately from the pig.

〔Effect of the invention〕

According to the present invention, when the desired data is not found in the first storage means in the first search step, the data is retrieved from the second storage means in the second search step. The data related to the desired data is transferred and stored in the first storage means, so that when searching for data related to the desired data from the second time onward, the related data can be retrieved from the first storage means. Since data can be obtained, the time required for retrieval from the second storage means and the number of data transfers between the first and second storage means are reduced, and there is an effect that efficient data retrieval can be performed.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram for realizing an embodiment of the present invention,
FIG. 2 is a flowchart showing the operation in this embodiment, and FIGS. 3 and 4 are detailed flowcharts showing the detailed operation of this flowchart. FIG. 5 is the processing at the time of data search based on the conventional data management method and the data management method of this invention. An explanatory diagram showing the flow. FIG. 6 is an overall configuration diagram for realizing another embodiment of the present invention, and FIG. 7 is a flowchart of data search in a conventional data management method. In the figure, (1) is the main memory, (4) is the secondary memory, (9) is the search identifier, (10) is the main memory search means, (11) is the secondary memory search means, and (12) is the It is a means of transfer. Note that the same reference numerals in each figure indicate the same or corresponding parts.

Claims (1)

[Claims] (1) An input step of inputting an identifier specifying the desired data; and an input step of inputting an identifier input in the input step from among a plurality of data each assigned a data identifier and stored in the first storage means. a first search step of searching for desired data to which a corresponding data identifier is assigned; and a first search step in which the data and the data identifier assigned to the data are formed as a pair, and the identifier of the data related to the data is associated data. a second search step of searching for paired data to which a related data identifier corresponding to the identifier input in the input step is assigned from among the paired data assigned as an identifier and stored in the second storage means; and a transfer step of transferring and storing the paired data searched in the second search step to the first storage means when the desired data is not found in the first search step. data management methods.