JPH0573615A - System for managing hierarchical structure type information - Google Patents

Abstract

PURPOSE:To efficiently manage and abolish an element in a hierarchical structure, especially, a memory. CONSTITUTION:In a storage processing 6, information showing the structure position of the element is added and it is stored by the depths of a hierarchy classifications. In a master, etc., calculation processing 3, a hierarchical structure distance between two elements is calculated by using information showing the structural position of the elements. In an abolishment priority decision processing 4, the element which is the farthest from the element made access at present is judged, and it is abolished. Furthermore, search is made efficient by starting search from a place where the element is highly possibly detected at the time of searching the element to be abolished and with a search suppression system for preventing unnecessary search.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a management / discarding method for determining a disposal priority order of information having a hierarchical structure stored in a memory and repeating acquisition / discarding.

[0002]

2. Description of the Related Art In the case where a memory has a large amount of information that is repeatedly acquired and discarded, conventionally, the LRU (Least Recent Use) that discards the oldest access order is used.
d) FIFO that discards the oldest method or acquisition order
It was common to use the (First InFirst Out) method.

[0003]

When the LRU system or the FIFO system is used in the management of hierarchical structure information as in the past, the LRU system and the FIFO system are discarded regardless of the hierarchical relationship. Something that is closely related may be discarded. In the worst case, even child relationships may be subject to disposal.

In order to solve the above problems, the hierarchical structure type information management system of the present invention takes into consideration the hierarchical structure and discards the one that is farthest in the hierarchical relationship (parent etc.) from the one currently being accessed. To This aims to reduce the number of acquisitions / disposals and increase efficiency.

[0005]

SUMMARY OF THE INVENTION According to the present invention, in a hierarchical structure type information management method in which each element is connected in a parent-child relationship between layers and stored in a memory, the maximum distance from the target element is the same as the relative degree. The first element is given priority, the element having a lower level in the hierarchy is given second priority, and the older element obtained from the memory is given the third priority and discarded from the memory.

According to the present invention, in a management method of hierarchical structure type information in which each element is connected to each other in a parent-child relationship and stored in a memory, in the same hierarchy in order from the lowest level, acquisition to the memory is performed. Search in order from the oldest element, and when the maximum degree of the relatives from the target element to the searched element up to the present is the maximum possible relative degree within the level of the hierarchy currently being searched, the search is terminated and the maximum It is characterized in that an element that is a parent or the like is discarded from the memory.

According to the present invention, in a management system of hierarchical structure type information in which each element is connected in a parent-child relationship between respective hierarchies and stored in a memory, in a group of children having a parent of the same element in an upper level hierarchy. The element number is attached to each element, and the structure information that is the element number of the elements of the system that are connected in a parent-child relationship from the highest element of each element is acquired in the memory for each level in the chain structure in the order of oldest elements. The structural information of the two elements is managed, and the level before the level where the element numbers differ from the level above is used as a branch point of the parent-child relationship of the two elements to determine the parent etc. between the two elements. Obtained, in the same hierarchy in order from a lower level hierarchy, the acquisition to the memory is searched in order from the oldest element according to the chain structure,
The search ends when the maximum degree of the relatives from the target element to the searched element up to the present is equal to or greater than the maximum possible relative degree within the level of the hierarchy currently being searched, and the element that is the maximum relative is deleted from the memory. Characterized by discarding.

[0008]

The present invention will be described below with reference to the drawings.

In the following description, an element is a unit of a hierarchical relationship of information stored in a memory, a level is a depth of a hierarchy, a parent is a distance in a hierarchical relationship, and a maximum parent is a certain element. The farthest distance of a hierarchical relationship (relative, etc.), the maximum possible relative within a level refers to the maximum possible relative at that level.

A specific example of the above words and phrases will be shown with reference to FIG. Elements surrounded by □ in the figure are elements, and the level of the element R is 3, and the level of the element S is 2. The degree between the element R and the element S is 3, and the maximum degree between the elements R is the degree up to the element T 6. The maximum possible relative in the level for element R in level 4 is 5.

FIG. 2 shows a computer system to which an embodiment of the present invention is applied. A process of transferring a huge amount of structural information having a hierarchical structure stored in a host computer (hereinafter referred to as a host) 21 to a workstation (hereinafter referred to as WS) 22 by communication and displaying a list. Performed by distributed processing. A detailed description will be given below.

As shown in FIG. 3, displaying all of the enormous structural information stored in the host 21 on the WS 22 is performed by the WS 22.
Is much smaller than the host 21, and it takes time to transfer enormous data, which is difficult.
Therefore, as shown in FIG. 4, a huge amount of structural information is collected in the same group of the same level, for example, each city of Hokkaido in FIG. 4, and this is displayed as one unit (element). Figure 4
One group surrounded by the dotted line of is an element.

In addition, transfer, display, and memory acquisition for display are performed in this unit. The memory has each element, but since the data itself has a hierarchical structure, the memory also has a hierarchical structure. FIG. 5 shows the display form.
When "Hokkaido" is selected on the "All Japan" screen, a list of cities in Hokkaido is displayed, and when "Sapporo city" is selected, a list of wards in Sapporo is displayed. If you select "Sapporo city", a list of each city in Hokkaido will be displayed again. In this way, it is displayed in a form that follows the hierarchical structure.

Since the WS 22 has a limited memory, it is necessary to discard the information stored in any of the memories when the memory overflows. At this time, as far as the element currently displayed on the WS 22 is concerned, the one with the farthest relative (distance) (the largest relative) is discarded.

FIG. 1 shows a processing flow of this embodiment. As shown in the figure, the processes are a data transfer process 1 for receiving the data transfer from the host 21, a memory judgment process 2 for judging a memory shortage, a closeness calculation process 3 for calculating a closeness between two elements, and the like. Discarding priority determination process 4 for determining discarding priority from a relative, discarding process 5 for discarding element data (hereinafter referred to as element data) and its information record (hereinafter referred to as element information), element data And a storage process 6 for storing the element information.

Of these, the storage process 6, the parent calculation process 3, and the discard priority order determination process 4 will be described.

The storage processing 6 stores the element information in order of oldness according to level, adds information indicating the structural position of the data, and thereby adds the degree of closeness calculation processing 3, the discard priority order determination processing 4, and the discard processing 5. Perform each process.

The elements are uniquely numbered within a group having the same elements at higher levels as shown in FIG.
Element number). The number above each element in the figure indicates the element number of the element. The sequence of element numbers from the top,
This is information indicating the structural position of the memory (hereinafter referred to as structural information). FIG. 7 shows the structural information of each element of FIG. This structure information indicates a parent-child relationship between memories and a level. The structure information is classified for each level, and the chain structure is managed in the oldest order.

FIG. 8 shows the management state in the case of FIGS. The elements abc ... In FIG. 8 correspond to the elements abc ... in FIGS. 6 and 7, respectively. In this situation, when the element g is newly added to the same second level as the elements b and d as shown in FIG. 9, the structure information of the new memory is added to the end of the second level chain as shown in FIG. To be added.

The closeness calculation process 3 is a process for calculating the closeness between two elements. When calculating the degree of affinity between two elements, it is basically the sum of the degrees of affinity of each element from the branch point of the system of the two elements. In the case of the element hi shown in FIG. 11, the branch point is the element x, and the degree between the elements hi is the sum of the degree between the elements x and h and the degree between the elements x and i. In this case, since the degree of closeness of the elements x to h is 1, and the degree of closeness of the elements x to i is 2, the degree of closeness between the elements hi is 3.

Next, a specific description will be given.

To find a branch point, the structure information created at the time of storage is used. The branch point is the point where the system is different from that of the same system until then. When this is applied to the structure information, the element numbers are the same until then, but the element numbers are different. That is, as shown in FIG. 12, the element numbers of the structure information are compared from the beginning, and the level before the level at which the discrepancy occurs becomes the branch point.

Next, whether it is a relative from a branch point to an element, the degree from the branch point is the depth of the hierarchy from the branch point to the element, which is "the level of the element-the level of the branch point". Can be represented. Referring to FIG. 12, the level of the branch point is 2, the level of the element h is 3, and the level of the element i is 4.
Therefore, the degree of closeness of the element h from the branch point is “3-2”, and the degree of closeness of the element i from the branch point is “4-2”, which is 2.
3 which is the sum of 1 and 2 becomes a relative between the elements h and i.

FIG. 13 shows a processing flow of the degree calculation processing 3 for the relatives. The flow of FIG. 13 will be described with reference to the examples of FIGS. The element (h in this case) that serves as the reference for the degree calculation is element 1, and the element (i in this case) that is the target for the degree calculation is element 2
And

Since the element numbers are compared from the beginning, the comparison level at the start of comparison is set to 1 (step 31). The element numbers of element 1 and element 2 at the comparison level are compared (step 32). If the results are equal, 1 is added to the comparison level and the element numbers are compared again (step 33). If they are not equal, the level obtained by subtracting 1 from the comparison level at that time is set as the branch point level (step 34). The degree between the branch point and the element 1 is obtained by subtracting the level at the branch point from the level of the element 1 (step 35), and the degree between the branch point and the element 2 is subtracted from the level of the element 2 from the level of the branch point. (Step 36). The degree of closeness between the elements 1 and 2 is obtained as the sum of the degree of closeness between the elements 1 and the degree of closeness between the elements 1 and 2 from the branch point obtained previously (step 37).

When performing the identity calculation, not only is there a clear branch point as shown in FIG. 11, but there is a direct upper rank (ancestor) such as the relation of the element k to the element j in FIG. In some cases, it may be a subordinate (descendant) of the direct line like the relation of the element m for the element l in FIG. The same process is performed in these cases, but as shown in FIG. 15, a number indicating that the element number does not exist in the element 2 during the search (hereinafter,
When this is set to 0) (hatched portion in the figure), it can be determined that the element k is the direct higher order of the element j.

As shown in FIG. 16, the element l
When the element number 0 is found in (indicated by a shaded portion in the figure), it can be determined that the element m is a direct subordinate to the element l. Even in these cases, the degree of closeness can be calculated by using the level one higher than the level where 0 is found as the branch point. For example, element j. When the case of k is used, the degree of kinship from the branch point of the element j is 2, the degree of kinship from the branch point of the element k is 0, and the degree of kinship between the elements jk is 2.

The discard priority order determination process 4 is composed of three principles: "efficient search", "priority order" when the same relative is found, and "search suppression" for avoiding unnecessary searches. There is.

"Efficient search" is to start a search from a place where there is a high possibility that there is a maximum degree of closeness and to find the maximum degree of closeness early. A place where there is a high possibility that there is a large relative is a place with a low level (lower level). Since the degree of parent is the depth of the hierarchy from the branch point, the lower the level is, the higher the possibility of the hierarchy from the branch point is. From this, by searching from low level to high level, you can quickly find a big relative. Levels are stored in a chain structure for each level at the time of storage, so that all elements of the same level can be searched by following the chain.

When the memory overflows, WS2
From the elements displayed in 2, the largest relatives are discarded, but when the same largest relatives are found, the “priority” is the one with the lowest level, and the next oldest. Since this is the storage order itself, the search is performed in order from the lowest level / storage order, and when the same parent etc. is found, the one found previously is given priority. FIG. 18 shows the order in which the element closest to the element n in FIG. 17 is searched, together with the storage state. The circled numbers above each element in the figure indicate the search order of that element.

"Search suppression" is to prevent useless searches. With efficient search, the search is done from the level where it is most likely to find the greatest degree of relatives. Therefore, the maximum degree is detected early, and the more the search proceeds, the less likely the maximum degree is to be found. Therefore, if there is no possibility that a parent or the like larger than the currently derived maximum parent (if they are the same, the previous one is prioritized) will not be derived even if the subsequent searches are performed, the search is ended there.

Since the search is performed for each level, the place where the search should end is the level at which it ends.
It means that. The level at which this search should be terminated is the level at which the currently derived maximum degree is greater than the maximum degree considered at that level. The maximum degree of relatives possible at that level, that is, the maximum possible degree of relatives within a level, is the degree of relatives when the branch point is assumed to be the highest level. This is represented by “level of element + level of target level−2”. Further, even if the maximum possible degree at the same level is found even at the same level, no further greater degree is found at that level and thereafter, so the search ends.

The process flow of the search for the maximum parent and the search suppression process in the discard priority order determination process 4 will be described with reference to FIG. ABC in the sentence corresponds to ABC in the figure.

The search starts from the level that is most likely to have the greatest degree, ie, the lowest level (step 4).
1). The initial value of the maximum degree of relatives is set to 0 (step 42).
The maximum possible relative degree within the level at the search level is calculated (step 43). If the calculated maximum possible degree relative to the level is smaller than the maximum possible relative degree that has been derived so far (0 for the first time), or if the derived maximum relative degree is the same as the maximum possible relative degree within the level, then further searching Since the relatives larger than the maximum relatives derived so far are not derived, the search ends (step 44).

The reference element and the degree of parent of one element within the level are calculated (step 45). The calculated relative degree is compared with the maximum relative degree that has been derived so far (step 46). When it is larger than the calculated relative degree and the maximum relative degree derived so far, the calculated relative degree is set as the maximum relative degree (step 47). The target of the degree calculation, etc. is advanced to the next element (step 49), and to the next level (step 50). If there is no next element or level, the search ends (step 51).

[0036]

As described above, according to the present invention, by discarding the element such as the highest parent from the elements targeted for the hierarchical structure type information, the memory that is least necessary in consideration of the hierarchical relationship is discarded. Therefore, it is less likely that the necessary memory will be discarded, and the number of communications for data acquisition will be reduced. In addition, the storage method is also conscious of hierarchical relationships, and because the storage method is also conscious of search, the search can be performed efficiently, and the search can be completed in a short time by suppressing the search. There is.

[Brief description of drawings]

FIG. 1 is a diagram showing a flow of processing according to an embodiment of the present invention.

FIG. 2 is a diagram showing a computer system to which the embodiment shown in FIG. 1 is applied.

3 is a diagram showing an example of a hierarchical structure stored in a host 21 shown in FIG.

FIG. 4 is a diagram showing an element-by-element grouping of the hierarchical structure shown in FIG. 3;

5 is a diagram showing a display transition on the WS22 side shown in FIG.

FIG. 6 is a diagram showing element numbers in the embodiment shown in FIG.

FIG. 7 is a diagram showing structural information of the example shown in FIG.

FIG. 8 is a diagram showing a storage state of structure information in the cases of FIGS. 6 and 7.

9 is a diagram in which elements are added to the example of FIG.

10 is a diagram showing a storage state of structure information in the case of FIG. 9;

FIG. 11 is a diagram for explaining a degree calculation in the embodiment shown in FIG.

FIG. 12 is a diagram showing the difference between the structure information and the element numbers of two elements and the branch point in the example shown in FIG. 11;

FIG. 13 is a diagram showing a flow of a friendship calculation method in the embodiment shown in FIG. 1.

FIG. 14 is a diagram for explaining a direct system in the embodiment shown in FIG.

15 is a diagram showing structural information in the case of a direct upper layer of the example of FIG.

16 is a diagram showing structural information in the case of a direct subordinate of the example of FIG.

FIG. 17 is a diagram for explaining a search order in the embodiment shown in FIG.

FIG. 18 is a diagram showing a storage state of structure information and a search order in the example shown in FIG. 17;

FIG. 19 is a flowchart showing a process of searching for a maximum parent and the like and a search suppression process according to the embodiment shown in FIG. 1;

FIG. 20 is a diagram for explaining basic words and phrases used in explaining the embodiment shown in FIG. 1;

[Explanation of symbols]

 1 data transfer processing 2 memory judgment processing 3 relative calculation processing 4 discard priority order determination processing 5 discard processing 6 storage processing

Claims (3)

[Claims] 1. In a management method of hierarchical structure type information in which each element is connected to each hierarchy in a parent-child relationship and stored in a memory, an element farthest from the target element in the highest degree of relative relation is given priority. A method of managing hierarchical structure type information, characterized in that an element having a lower level of hierarchy is given second priority, and an older element that is acquired in the memory is given third priority and discarded from the memory. 2. In a management method of hierarchical structure type information in which each element is connected to each other in a parent-child relationship and stored in a memory, in a hierarchy from a lower level, acquisition to the memory is older in the same hierarchy. The search is performed in order from the element, and the search is terminated when the maximum relative degree from the target element to the searched element up to the present is the maximum possible relative degree within the level of the hierarchy currently being searched, and the maximum relative degree is calculated. A management method of hierarchical structure type information, wherein a certain element is discarded from the memory. 3. In a management method of hierarchical structure type information in which each element is connected to each other in a parent-child relationship and stored in a memory, an element is included in a child group having a parent of the same element in a higher level hierarchy. Numbered, the structure information, which is a sequence of element numbers of the elements of the system connected in parent-child relationship from the highest element of each element, is managed in a chain structure in order from the oldest element acquired to the memory for each level. , The structural information of the two elements is compared from the upper level, and the level before the level where the element numbers are different is used as a branch point of the parent-child relationship of the two elements to obtain the parent degree between the two elements, In the same hierarchy in order from the lowest level, according to the chain structure, the elements that are acquired in the memory are searched in order from the oldest, and the largest parent etc. from the target element to the current searched element is the current one. Search ends when the maximum possible relative degree within the level of the hierarchy being reached,
A hierarchical structure type information management method characterized in that the element that is the highest degree of relative is discarded from the memory.