JP3318787B2 - Data management method and device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method of transferring data having a structure in which a plurality of data such as list data are linked between a main memory and a secondary memory while reflecting the link structure, and a CPU (Central). The present invention relates to a data management method for efficiently storing data necessary for processing of a processing unit in a main memory.

[0002]

2. Description of the Related Art In order to process a list-structured data used in fields such as artificial intelligence, mathematical formula processing, and natural language processing at a high speed by a computer, the data must be accessed at a high speed by a CPU in consideration of its link structure. It is necessary to efficiently store the data in a main memory capable of storing data and a secondary memory having a low access speed but a large storage capacity. That is, the data frequently processed by the CPU is stored in the main memory, and the data required by the CPU is stored in the secondary memory. It is necessary to minimize the execution of the processing for transferring the data.

For example, Japanese Patent Laid-Open Publication No. Hei 2-263233 discloses that a plurality of data having a closely linked structure are handled as a unit for transferring between a main memory and a secondary memory, so that the data is closely linked to the main memory. It is disclosed that stored data is stored. Normally, a plurality of linked data is processed by the CPU at the same time or at a considerably short time interval. Therefore, as disclosed in the above-mentioned publication, by storing a plurality of closely linked data in the main memory, the CPU can execute the processing. The probability that data to be processed is stored in the main memory can be increased, and high-speed processing in a computer can be performed.

Further, the above-mentioned publication discloses that in order to effectively use a storage area of a main memory, the following processing is performed to delete unnecessary indirect pointers. Here, the indirect pointer is a cell indicating a link of a cell (data) stored in the main memory to a cell stored in the secondary memory. For example, as shown in FIG. 8A, the indirect pointer mm6 of the main memory linked to the structure 1 (str1) of the secondary memory is also linked from the cell ss1 of the structure 1 and the cell ss2 of the structure 2. May be. In this case, the data link structure shown in FIG.
The link structure can be simplified as shown in FIG. However, this simplification includes a process of changing the list structure of the cells stored in the secondary memory, and it is difficult for the CPU to perform the sequential process on the cells stored in the secondary memory having a low access speed. , The processing time becomes longer.

As a solution to this problem, the above publication discloses FIG.
An external reference table (XRT) shown in FIG. 9A for managing the link information of the cells stored in the secondary memory to the external cells for each structure, and stored in the main memory shown in FIG. 9B. Reference table (DR) for collectively managing link information from the cells stored in the secondary memory for the
T) and a structure management table (SRT) that manages addresses on a main memory in which XRTs and DRTs are stored for each structure to reduce the number of accesses to a secondary memory. . At this time,
As shown in FIG. 9A, the XRT converts the link information into information (ptr.i) specifying a cell to be linked to the outside.
d) and a pointer (d
(st). The DRT is shown in FIG.
As shown in (B), the link information is changed to information (dst.i) for specifying the cell stored in the main memory to be linked.
d) and the information (ptr.list) for specifying the cell stored in the secondary memory linked to this cell.

As described above, Japanese Patent Application Laid-Open No. 2-263233
Japanese Patent Application Laid-Open Publication No. HEI 9-303572 discloses that data transfer between a main memory and a secondary memory is performed in units of a plurality of data having a dense link structure, and data frequently accessed by a CPU is stored in the main memory. SRT, XRT
And using DRT to quickly delete unnecessary indirect pointers.

[0007]

By the way, in the processing of the CPU, a predetermined free area is required in the main memory, and the data stored in the main memory may be saved to the secondary memory in the above units. Further, in order to transfer necessary data from the secondary memory to the main memory in the processing of the CPU, the data stored in the main memory may be saved in the above-described unit in the secondary memory. However, by evacuating the main memory to the secondary memory, the number of links between the data stored in the main memory and the data stored in the secondary memory increases, and the data stored in the secondary memory is In some cases, the number of accesses of all CPUs increases, which hinders efficient processing in the CPUs.

SUMMARY OF THE INVENTION An object of the present invention is to provide a data management method and apparatus capable of solving the problems of the prior art described above and enabling a CPU to process data having a link structure at high speed.

[0009]

In order to achieve the above-mentioned object, a data management method according to a first aspect of the present invention comprises a first storage unit accessed by an operation control unit, and a storage unit in the first storage unit. And the second storage means, which can save the stored data and have a larger storage capacity than the first storage means, and manage the data processed by the arithmetic and control means to change the link structure. A data management method for storing data stored in the second storage unit.
Of Ruri link information about the plurality of links <br/> against data stored in the storage means, stores by linking respectively,
Based on the link, a search is made for one or a plurality of pieces of link information from among the plurality of pieces of link information, and based on the searched link information, the second link information is linked from the data stored in the second storage unit. The data stored in the first storage means and the data directly or indirectly linked to the data are saved in the second storage means.

In the data management method according to the first aspect of the present invention, it is preferable that, of the data saved from the first storage unit to the second storage unit, the data stored in the first storage unit be deleted. The link information relating to the link is further linked to the link information stored as a link and stored.

In the data management method according to the first invention, the data transfer between the first storage means and the second storage means is preferably performed by a plurality of data directly or indirectly linked. Is performed as a unit.

Further, in the data management method of the first invention, preferably, the link information is stored in the first storage means.

Further, a data management device according to a second aspect of the present invention includes a first storage means for managing data accessed by the arithmetic control means and processed by the arithmetic control means to change the link structure; A second storage unit capable of saving data stored in the storage unit and having a larger storage capacity than the first storage unit, wherein the second storage unit the Ruri link information about the plurality of links with respect stored in said first memory means the stored data data, respectively by linking stored in said first storage means, said first The storage means retrieves one or more pieces of link information from the plurality of pieces of link information based on the link, and links the data stored in the second storage means based on the retrieved link information. Is It said first memory means the stored data, and retreats directly the data or indirectly linked data in the second storage means.

[0014]

[0015]

According to the data management method of the first invention, the first storage means accessed by the arithmetic and control means and the data stored in the first storage means can be saved, and the first storage means can store the data in the first storage means. The data stored in the second storage unit having a relatively large storage capacity and processed by the arithmetic and control unit to manage data whose link structure changes. At this time, in the data management method of the first invention, the link information relating to a plurality of links of the data stored in the second storage unit to the data stored in the first storage unit is respectively stored. Link and remember. And, based on the link,
One or more pieces of link information are searched from among the plurality of pieces of link information, and based on the searched link information, stored in the first storage unit linked from the data stored in the second storage unit. Data, and data directly or indirectly linked to the data,
To the storage means.

Further, in the data management device of the second invention,
First, the link information relating to a plurality of links of the data stored in the second storage unit with respect to the data stored in the first storage unit is linked to each other and stored in the first storage unit. And the first storage means,
Based on the link, a search is made for one or a plurality of pieces of link information from among the plurality of pieces of link information, and based on the searched link information, the second link information linked from the data stored in the second storage unit is retrieved. The data stored in the first storage means and the data directly or indirectly linked to the data are saved in the second storage means.

[0017]

FIG. 1 is a configuration diagram of a computing system using the data management method of this embodiment. As shown in FIG. 1, a CPU (Cent
ral Processing Unit) 2 and a main memory 4 as first storage means. Also, CPU2
Are connected to a secondary memory 8 as a second storage means via an internal bus 12, an input / output circuit 6, and an external bus 10. The CPU 2 performs, for example, an arithmetic process according to a program installed in advance. The main memory 4 is, for example, a bipolar semiconductor memory that can be accessed at high speed, and holds data of a list structure as data of a link structure that is relatively frequently used in the CPU 2 as described later.

The secondary memory 8 has a larger storage capacity than that of the main memory 4. For example, a hard disk drive or the like is used. Among the data in a list structure processed by the CPU 2, for example, data not stored in the main memory 4. Is stored. The CPU 2 transmits necessary data to the secondary memory 8 via the internal bus 12 when performing arithmetic processing.
Enter from. At this time, if the necessary data does not exist in the main memory 4, the data including the necessary data stored in the secondary memory 8 is stored in the external bus 10, the input / output circuit 6, and the internal bus 12
Is transferred to the main memory 4.

The data of the list structure stored in the main memory space 4a and the secondary memory space 8a will be described. FIG. 2 is a diagram for explaining data stored in the main memory space 4a and the secondary memory space 8a.
In FIG. 2, mm1 to mm of the main memory space 4a
2, mm4 to mm8, mm10, and mm11, and ss1 to ss3 of structure 1 and ss1 and ss2 of structure 2 in the secondary memory space 8a indicate individual cells (data) constituting the list structure, respectively. . The cell includes a data portion to be stored and a pointer portion for linking (linking) another related cell. At this time, a pointer may be stored in the data section instead of the data. In FIG. 2, a pointer is stored in the data section of each cell. Arrows in FIG. 2 indicate links between cells, and broken arrows indicate links to cells not shown.

Further, mm3 and mm9 in the main memory space 4a indicate indirect pointers. This indirect pointer stores cells in the main memory space 4a in the secondary memory space 8a.
This is a pointer for linking to the cell of. In the secondary memory space 8a, cells having a list structure are stored in units of a structure having a plurality of cells having a dense link structure. This structure is a unit when data is transferred between the main memory 4 and the secondary memory 8 as described later.

In the data of the list structure shown in FIG. 2, links between cells in the main memory space 4a (for example, links from mm1 to mm2) and 2
A link from a cell in the next memory space 8a to a cell in the main memory space 4a (for example, a link from ss2 to mm4 of the structure 2) is represented by using an address in the main memory space 4a as a pointer. . A link from a cell in the main memory space 4a to a cell in the secondary memory space 8a (for example, a link from mm2 to ss1 of the structure 1) is provided by the indirect pointer in the main memory space 4a. (In this case, mm3).

Further, a link between cells in the secondary memory space 8a (for example, ss1 to s1 of the structure 2)
The link to s2) is represented by using an address in the secondary memory space 8a as a pointer.

The link between the cell in the main memory space 4a and the cell in the secondary memory space 8a and the link between the cells in different structures in the secondary memory space 8a are described below by SRT (structure management). Table). However, a link from a cell in the main memory space 4a to a cell in the secondary memory space 8a is managed by the above-described indirect pointer, and is not managed by the SRT. The SRT is stored, for example, in a predetermined area on the main memory space 4a.

FIG. 3 is a diagram for explaining the SRT. As shown in FIG. 3, the SRT table includes an external reference table (XR) for each structure (str.id) of the secondary memory 8.
This is tabular data having a pointer to T) and a pointer to a dereference table (IRT), and is referred to by a hash method or the like when managing and searching for XRT and IRT. For example, the pointer to the external reference table of srt1 (structure 1) is XRT1, and the pointer to the reverse reference table is IRT1. An external reference table (XRT) is created for each structure of the secondary memory 8, and the cells on that structure are used for cells on the main memory 4 and cells on other structures on the secondary memory 8. Has information about the link. This information includes, for example, as shown in FIG. 3, a pointer (prt.id) of the cell of the link source, an area where the cell of the link destination is stored (for example, main memory 4, structure 1,
2), etc. (dstarea), and
It has a pointer (dst.id) of the linked cell.

For example, the secondary memory space 8a shown in FIG.
Of the cell ss3 (ss3.
car) is linked to the cell mm6 in the main memory space 4a. This link is the secondary memory space 8
a from the cell on the structure 1 to the main memory space 4a
Is a link to the cell of
RT1.

As shown in FIG. 3, information on this link is stored in XRT1 as ptr. id as ss3. ca
r, dstarea as main (indicating the main memory space 4a), and dst. It is described using mm6 as id. Similarly, ss2. mm4 on main memory space 4a from car
And ss2. Information about the link from cdr to ss2 on structure 1
XRT2.

Of the link information described in the XRT, the link information (dstar) for the main memory space 4a
Link information in which ea is main) is managed as route information. The route information is used when data of a list structure stored in the main memory 4 is saved in the secondary memory 8 in order to secure a free storage area on the main memory 4 as described later. As a method of managing the route information, when there is a plurality of route information, for example, a method of linking and storing all the route information is used. By using this method, the amount of information to be stored can be reduced as compared with a case where a management table for storing information on route information is specially provided. For example, as shown in FIG. 3, the link from ss3 of structure 1 to mm6 of main memory space 4a is route information, and is linked to other route information on structures 1 and 2 as shown by arrows. I have.

As a method of this link, for example, the route information managed first as the route information is first, and then the route information is added to the last in the order in which the route information is managed as the route information. Use a method of linking to route information. Then, when performing the data transfer described later, the linked route information is used in order from the leading route information.

A reverse reference table (IRT) is created for each structure as in the case of the XRT, and is a pointer (dst.
id), information (ptrea) specifying the structure in which the link source cell is stored, and It has a pointer (ptr.id) of the link source cell. For example,
As shown in FIG. 3, ss2 of structure 1 is ss2. linked from the cdr, the information about this link is
It is described in T1.

A data management method for saving the list-structured data stored in the main memory 4 to the secondary memory 8 will be described. When it becomes necessary to secure a predetermined free area in the main memory 4 in the arithmetic processing of the CPU 2, for example, a plurality of directly or indirectly linked data stored in the main memory 4 is selected and the secondary memory 8 is selected. Transfer to At this time, when selecting data to be transferred to the secondary memory 8 from the data stored in the main memory 4, the above-described route information stored by linking is used.

That is, of the plurality of linked route information, the dst. A cell in the main memory space 4a specified by id is selected, cells directly or indirectly linked are sequentially searched from the selected cell, and all or a part of the searched cell is replaced with 2 or more. It is a unit to be saved in the next memory 8. As described above, the cells in the secondary memory space 8a linked from the cells in the secondary memory space 8a among the cells in the main memory space 4a are selected and saved, whereby the secondary memory space 8a The number of links from the upper cell to the cell on the main memory space 4a can be reduced.

The selection of the directly and indirectly linked cells from the selected cells in the main memory space 4a is performed by performing data transfer, so that the cells in the main memory space 4a are This is to prevent the number of links to cells in the memory space 8a from explosively increasing.

For example, of the route information shown in FIG.
Ss3 in XRT1. When the link information from car to mm6 is selected, of the cells in the main memory space 4a shown in FIG. 2, cells directly or indirectly linked from mm6, that is, mm10, mm
All or some of the cells linked to 11 and mm 10 and mm 11 are selected as cells to be saved in the secondary memory 8. At this time, for example, according to the capacity of the free area secured in the main memory 4, the number of cells to be saved corresponding to this capacity is selected.

The above dst. If, even if all cells directly or indirectly linked from the cells in the main memory space 4a specified by id are saved to the secondary memory 8, the capacity of the free area to be secured is not reached, for example, The same process is performed for the other route information linked to the route information on which the above-mentioned is performed, and cells to be saved are selected until the necessary free space capacity can be secured. When a cell to be saved is selected, the selected cell is transferred to the secondary memory 8.

FIG. 4 shows the state after transferring the selected cell.
FIG. 4 is a diagram for explaining data stored in a main memory space 4a and a secondary memory space 8a. When a cell directly or indirectly linked from mm6 in FIG. 2 is saved, mm5 linked to cell mm6 is linked to indirect pointer mm6 as shown in FIG. In addition, mm6, mm10, mm1 in FIG.
4, ss1 and ss1 are respectively placed on the newly created structure 3 in the secondary memory space 8a as shown in FIG.
3, ss2. At this time, the indirect pointer mm6 on the main memory space 4a links to ss1 on the structure 3 in the main memory space 4a.
The XRT and IRT are changed according to the change of the pointer of each cell due to the transfer processing and the creation of a new structure.

FIG. 5 is a diagram for explaining the changed XRT and IRT. As shown in FIG. 5, in the SRT after the structure out, information corresponding to the structure 3 is further added to the information of the SRT shown in FIG. At this time, due to the transfer process, ss3 on the structure 1
Is changed from the link for mm6 on the main memory space 4a shown in FIG. 2 to the link for ss1 of the structure 3 in the secondary memory space 8a shown in FIG. Therefore, the ptr. Of XRT1 shown in FIG. id
Is ss3. The part which is car is d as shown in FIG.
stara to str3, dst. id is changed to ss1.

As shown in FIG. 5, an IRT of the structure 3 is newly created, and the IRT portion of the structure 3 in the SRT becomes a pointer IRT3. IRT3 contains dst. id, ss1, ptrarea as str1, ptr. id as ss3. car is described. As shown in FIG. 4, since there is no link from a cell on the structure 3 to a cell on another structure or a cell on the main memory space 4a, the XRT of the structure 3 is not created and the SRT is not created. The XRT part of the structure 3 in the above becomes NULL. As described above, when the data of the link structure in the main memory space 4a is transferred to the secondary memory space 8a, the SRT, XRT, and IRT are rewritten accordingly.

A data management method for transferring data having a list structure stored in the secondary memory 8 to the main memory 4 will be described. In the arithmetic processing of the CPU 2, if necessary data is not stored in the main memory 4 or if there is sufficient free space in the main memory 4, necessary data is transferred from the secondary memory 8 to the main memory 4 in units of structures. Forward.

For example, when the data of the link structure is stored in the main memory space 4a and the secondary memory space 8a as shown in FIG. 2, all the cells stored on the structure 1 or on the structure 2 Are transferred to the main memory 4. For example, the structure 1 of the secondary memory space 8a shown in FIG.
When all the cells stored above are transferred to the main memory 4, the link structure of data in the main memory space 4a and the secondary memory space 8a is changed as shown in FIG. In FIG. 6, ss1, ss on the structure 2 shown in FIG.
2 and ss3 are respectively mm on the main memory space 4a.
It is stored as 1 ′, mm2′mm3 ′. At this time,
In FIG. 2, the link from mm2 to ss1 realized via the indirect pointer mm3 has been changed to a direct link from mm2 to mm1 'as shown in FIG.

FIG. 7 shows SRT, XRT, IR after transfer.
It is a figure for explaining T. After the transfer, the structure 1 does not exist in the secondary memory space 8a.
No information corresponding to the structure 1 is described in the SRT, and neither XRT1 nor IRT1 exists. Further, X shown in FIG.
In RT2, ss2 on structure 1 before transfer
Becomes mm2 'on the main memory space 4a after the transfer, the dst. mm2 'is described as id.

As described above, according to the data management method of this embodiment, the data transfer from the secondary memory 8 to the main memory 4 is performed using the route information obtained from the SRT and IRT. An increase in the number of links between the cells stored in the main memory 4 and the cells stored in the secondary memory 8 due to the transfer can be prevented. Further, according to the data management method of this embodiment, the route information can be searched at high speed by storing the route information in a linked manner.

[0042]

According to the data management method and apparatus of the present invention, even when the data of the link structure stored in the first storage means is evacuated to the second storage means, the data management method and the data storage apparatus can be used. The link structure of the data stored in the first storage means is changed to a state where the operation control means can efficiently obtain data necessary for processing from the first storage means without frequently accessing the second storage means. Therefore, it is possible to execute the data processing of the link structure in the arithmetic and control unit at high speed. Further, a data management method and the present invention
According to the apparatus , the link information on a plurality of links of the data stored in the second storage means with respect to the data stored in the first storage means can be searched at high speed. The processing accompanying the evacuation can be executed at high speed.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a computer system using a data management method according to an embodiment.

FIG. 2 is a diagram for explaining data stored in a main memory and a secondary memory according to the embodiment.

FIG. 3 shows an SRT stored in a main memory of the present embodiment,
It is a figure for explaining XRT and IRT.

FIG. 4 is a diagram for explaining data stored in the main memory and the secondary memory after data in the main memory is saved in the secondary memory.

FIG. 5 shows SRT, XRT, and IRT stored in the main memory after data in the main memory is saved in the secondary memory.
It is a figure for explaining RT.

FIG. 6 is a diagram for explaining data stored in the main memory and the secondary memory after data in the secondary memory is transferred to the main memory.

FIG. 7 shows SRT, XRT, IR stored in the main memory after transferring data in the secondary memory to the main memory.
It is a figure for explaining T.

FIG. 8 is a diagram for explaining a conventional technique.

FIG. 9 is a diagram for explaining a conventional technique.

[Explanation of symbols]

 2 ... CPU 4 ... Main memory 6 ... I / O circuit 8 ... Secondary memory 10 ... External bus 12 ... Internal bus

Continuation of the front page (58) Field surveyed (Int.Cl. ⁷ , DB name) G06F 9/44 G06F 12/00-12/02 G06F 12/08

Claims (5)

(57) [Claims] A first storage unit accessed by an operation control unit; and a data storage unit capable of saving data stored in the first storage unit, and having a larger storage capacity than the first storage unit. A data management method for managing data whose link structure is changed by being processed by the arithmetic and control unit and stored in the second storage unit, wherein the first data of the data stored in the second storage unit is stored. of the relationship <br/> be ruri link information to a plurality of links on the data stored in the storage means, stores by linking each, based on the link, one or from a plurality of link information Searching a plurality of link information, based on the searched link information, data stored in the first storage unit linked from data stored in the second storage unit; and Direct or indirect A data management method for saving data linked to the second storage means. 2. A method according to claim 1, wherein, among the data saved from said first storage means to said second storage means, link information relating to a link to said data of said first storage means is stored. 2. The data management method according to claim 1, wherein the link information is further linked and stored. 3. The data transfer method according to claim 1, wherein the data transfer between the first storage means and the second storage means is performed in units of a plurality of data directly or indirectly linked. Data management methods. 4. The data management method according to claim 1, wherein said link information is stored in said first storage means. 5. An arithmetic control unit, and a first unit for managing data that is accessed by the arithmetic control unit and processed by the arithmetic control unit to change a link structure.
And a second storage unit capable of saving data stored in the first storage unit and having a larger storage capacity than the first storage unit. Te, the relationship <br/> be ruri link information to a plurality of links on the data stored in the first storage means of the data stored in said second storage means, said by linking each Stored in a first storage unit, wherein the first storage unit retrieves one or a plurality of pieces of link information from the plurality of pieces of link information based on the link, and based on the retrieved link information, The first data linked from the data stored in the second storage means;
A data management device for saving data stored in the storage means and data directly or indirectly linked to the data in the second storage means.