JPH11184857A - Tree structure information retrieval device/method and recording medium recording program executing retrieval method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a tree structure information retrieval device which can speed up retrieval when the sequence column of an instance name AVA(attribute value assertion) at a part near the highest order is identical. SOLUTION: History of instance names AVA followed at the time of previous retrieval is stored in a cache memory 3. An AVA comparison part 2 compares the instance name AVA contained in a management object instance parameter DN inputted from a management object instance retrieval processing part 1 with the instance name AVA stored in the cache memory 3 in the order starting from the highest order. When they are not matched, an address corresponding to the instance name AVA in a stage one step higher stage is returned to the retrieval processing part 1. The retrieval processing part 1 takes out the instance name AVA of the obtained address from a tree structure information storage part 82 and starts retrieval from AVA.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a tree structure information search device, a search method, and a recording medium on which a program for executing the search method is recorded.
The present invention relates to a tree structure information search device and a search method for performing a search based on a managed object instance parameter included in a (SystemInterconnection) management message, and a recording medium storing a program for executing the search method.

[0002]

2. Description of the Related Art FIG. 9 is a schematic illustration of an example of tree structure information used for this type of search. In the figure, information is displayed as instances 51 to 58 (or collectively, “50”).

[0003] That is, the top (or "root": root)
Three instances 5 one level below instance 51
2 to 54, two instances 55 and 56 exist one step below the instance 54, and an instance 56
There are two instances 57 and 58 one stage below.

In addition, tables 61 to 64 (or collectively, “60”) are provided corresponding to these instances 51 to 58.

That is, the instance 51 located at the highest level
Is a table corresponding to 61, instances 52 to 54 located in the second row are 62, and tables corresponding to instances 55 and 56 located in the third row are 6
64 is the table corresponding to the instances 57 and 58 located in the third and fourth rows.

Each of the tables 61 to 64 is configured as a set of entries 71 to 78 (or collectively indicated as “70”) corresponding to the instances 51 to 58.

That is, the table 61 has one entry 7
1, the table 62 has three entries 72 to 74, the table 63 has two entries 75 and 76, and the table 64 has two.
Each entry 77 and 78 is constituted.

Next, the entry 70 will be described. FIG. 10 is a format diagram of the entry 70. Entry 7
All types 1 to 78 are formed identically.

Referring to FIG. 1, an entry 70 includes an AVA representing an instance name and a next lower table 6 to be traced.
Table pointer TP specifying 0, and peer table 6
And an instance pointer IP for designating one instance 50 to be acquired from 0.

That is, each entry 7 in the tree information table 62
2 to 74 are table pointers T to this table 62
It includes instances 52, 53, and 54 located immediately below the instance 51 indicated by the instance pointer IP in the table 61 having P.

Similarly, each entry 7 in the tree information table 63
5 and 76 include instances 55 and 56, and each entry 77 and 78 of the tree information table 64 has an instance 57,
58.

The tree structure information is stored in each of the entries 71 to 7
8 are stored at different addresses in the tree structure information storage unit (not shown). Therefore, if this address is known, it is possible to know in which stage of the tree structure the target entry 70 exists.

The search command is given by a managed object instance parameter. This managed object instance parameter DN (Distinguished N
Ame) is an AVA (A) representing an individual instance name from the top of the tree structure to the instance to be searched.
tribute Value Assertion)
Is represented by the following sequence.

That is, referring to FIG. 9, if the search target is the instance 57, the DNs are the instances 51, 54,
56 and 57 are specified in the order of AVA.

Next, a conventional procedure for retrieving tree structure information will be described. FIG. 11 is a configuration diagram of an example of a conventional tree structure information search device, and FIG. 12 is a flowchart showing the operation of the device. Note that FIG. 9 is referred to in addition to FIGS.

The conventional tree structure information retrieving apparatus comprises a retrieval processing unit 8
1 and a tree structure information storage unit 82. In the tree structure information storage unit 82, each of the entries 71 to 78 related by the tree structure is stored at different addresses.

If the search target of the management message is the instance 57, the DN is the instance name A of the instances 51, 54, 56, 57 as described above.
It is specified in the order of VA.

This DN is input to the search processing section 81 (S101).

The search processor 81 first extracts the highest instance 51 (S102) and compares it with the highest instance 51 stored in the tree structure information storage 82 (S103).

Since both of the instances 51 match, the search processing unit 81 proceeds to the next lower-level instance 54.
(S104, 105), the tree structure information storage unit 82
(S103).

In this case, since the comparison results do not match, the comparison is performed again from the highest instance.

First, the highest instance 51 is extracted (S102) and compared with the highest instance 51 stored in the tree structure information storage unit 82 (S103).

Since both of the instances 51 match, the search processing unit 81 proceeds to the next lower-level instance 54.
(S104, 105), the tree structure information storage unit 82
(S103).

Also in this case, since the comparison results do not match, the comparison is performed again from the highest instance.

First, the highest instance 51 is extracted (S102) and compared with the highest instance 51 stored in the tree structure information storage unit 82 (S103).

Since both the instances 51 match, the search processing unit 81 proceeds to the next lower instance 54
(S104, 105), the tree structure information storage unit 82
(S103).

This time, since the comparison results match, the search processing unit 81 takes out the next lower instance 56, and
A comparison is made with the lower-level instance 55 stored in the tree structure information storage unit 82 (S104, 105).

Hereinafter, the same procedure is repeated to finally obtain the instance 57.

As described above, when both instances do not match during the search, the search is repeated from the highest instance.

Next, another example of the conventional tree structure information retrieval apparatus will be described. FIG. 13 is a configuration diagram of another example of the conventional tree structure information search device. Note that FIG. 9 is referred to together with FIG.

In another example, a cache memory 83 is inserted between a search processing unit 81 and a tree structure information storage unit 82.

That is, the cache memory 83 stores the latest one of the instances 50 fetched from the tree structure information storage unit 82 or the one fetched frequently.

Therefore, if the instance 50 that the search processing unit 81 wants to retrieve from the tree structure information storage unit 82 is stored in the cache memory 83, the cache memory 8
Since the target instance 50 need only be extracted from the tree structure 3, the access time is shorter than when the instance 50 is extracted from the tree structure information storage unit 82. Therefore, the time required for the search is also reduced.

[0034]

However, when the conventional tree structure information search device searches for a managed object instance to be searched for included in an OSI management message, it compares the intermediate instance 50 and finds a mismatch. Had the disadvantage that the comparison had to be redone from the top-level instance again. This is the same when no hit occurs even if the instance 50 is arranged in the cache memory 83.

In addition, although the order of the instance name AVA in the stage closest to the highest level is often the same in a plurality of searches, it is necessary to repeatedly perform the same tree information in order from the highest level. There was also a disadvantage that it did not.

On the other hand, Japanese Patent Application Laid-Open No. Hei 7-319894 discloses a technique for speeding up a search by searching from a specific node in a direction from the base to the end of the tree structure. This has the same purpose as the present invention in that the search is started from the middle node of the tree structure to speed up the search.

This technique is used when data retrieval is continuous.
By specifying a relatively narrow search range of a tree structure including a node where a search target instance exists, prior to the search, the search is performed in the terminal direction from the node.

However, in the case of this technique, it is necessary to specify a search range in advance.

Accordingly, an object of the present invention is to provide a tree structure information retrieval system capable of speeding up retrieval without specifying a retrieval range in advance when the order of instances near the top is the same. An object of the present invention is to provide an apparatus, a search method, and a recording medium on which a program for executing the search method is recorded.

[0040]

According to the present invention, a plurality of pieces of information related by a tree structure are sequentially searched from the highest-order information to obtain a target lowest-order information. A structure information search device, wherein the tree structure information search device includes a history storage unit for storing a history of information at an intermediate position traced during information search, and a search target of each position before performing a new information search. Comparing means for comparing the information and the same information with the same rank information among the information stored in the history storage means in order from the highest order information; and a predetermined order according to the comparison result by the comparing means. And a search means for starting a search from the information.

Another invention according to the present invention is a tree structure information search method for sequentially searching a plurality of pieces of information related by a tree structure from the highest-order information to obtain the target lowest-order information. In the tree structure information search method, at the time of information search, a first process for recording the history of the information at the intermediate position traced, and before each new information search is performed, the information to be searched for at each position is recorded in the first process. A second process of sequentially comparing the searched information of each rank and the information of the same rank in order from the highest rank information among the pieces of information,
And a third process of starting a search from predetermined information in accordance with the comparison result in the second process.

Still another invention according to the present invention is to execute a tree structure information search method for sequentially searching a plurality of pieces of information related by a tree structure from the most significant information and obtaining the desired least significant information. And a first process of recording a history of intermediate information traversed at the time of information retrieval on the recording medium, and information to be searched for before each new information retrieval. And a second process of sequentially comparing the searched information of each rank and information of the same rank in the information recorded in the first processing, starting from the highest rank information.
A program for executing a third process of starting a search from information at a predetermined position according to a comparison result in the process is recorded.

According to the present invention, at the time of information retrieval, the information that has been traversed is stored in the storage means in the tracing order, and at the time of the next retrieval, the information stored in the storage means and the information to be searched are compared. An apparatus is provided that performs comparison in order from the highest order, omits the containing tree (tree portion of the tree structure) traced up to that point if the comparison result matches, and starts the search from the upper information immediately before the mismatched information. Therefore, the search can be speeded up.

According to another aspect of the present invention, at the time of information retrieval, the information that has been traced is stored in the storage means in the order of tracing, and at the time of the next search, the information stored in the storage means and the information to be processed are stored. Since the search information is compared in order from the top, if the comparison result is a match, the inclusion tree traced so far is omitted, and a method of starting the search from the upper information immediately before the mismatched information is obtained. The search can be speeded up.

Further, according to another aspect of the present invention, at the time of information search, the intermediate information is stored in the storage means in the order of tracing, and at the next search, the information stored in the storage means is stored in the storage means. Compares the searched information with the information in order from the top and records a program to start the search from the upper information immediately before the mismatched information, omitting the inclusion tree traced up to that point if the comparison result matches Is obtained,
The search can be speeded up.

[0046]

Embodiments of the present invention will be described below with reference to the accompanying drawings. FIG. 1 is a configuration diagram of a first embodiment of a tree structure information search device according to the present invention. Note that the same components as those in the conventional example (FIGS. 9 to 13) are denoted by the same reference numerals, and description thereof will be omitted.

The tree structure information search device searches for an object instance specified in the arrived OSI management message by a managed object instance search processing unit 1.
AVA comparison unit 2 that compares the instance name AVA with the
, A cache memory 3 in which an instance name AVA is stored, and a tree structure information storage unit 82. The entries 71 to 78 stored in the tree structure information storage unit 82 are the same as in the conventional example.

The managed object instance search parameter 1 receives a managed object instance parameter DN. If the search target is instance 57, D
N is specified by the sequence of the AVA of the instances 51, 54, 56, and 57.

The AVA comparison unit 2 is configured to execute the AVA included in the DN input to the managed object instance search processing unit 1.
Are stored in the cache memory 3 one by one in order.
Compare with VA.

When an information search is performed on the cache memory 3 by the managed object instance search processing unit 1,
The history of the traced intermediate AVA is stored. The AVA is information stored in advance in the tree structure information storage unit 82, and the address D of the tree structure information storage unit 82 where the AVA is stored is stored in the cache memory 3 together with the AVA.

Further, a table pointer TP for designating the next tracing table 60 is stored in the cache memory 3 together with the AVA and the address D.

That is, the cache memory 3 has an entry 7 comprising an AVA, an address D and a table pointer TP.
0 are stored in the order of tracing.

The following two types of entries 70 are stored in the cache memory 3.

The first case is that the entry 70 traced at the time of searching for the latest information is always stored in the cache memory 3.

This takes into account the fact that the path of the containment tree to be followed in the next information search has a relatively large number of portions common to the path in the previous information search.

The second case is that the history of the entry 70 with the highest access frequency at the time of past information retrieval is stored in the cache memory 3.

This takes into account the fact that there are relatively many information searches following the same route.

The present invention can be applied to both the first and second aspects.

Although the storage control unit for storing the entry 70 in the cache memory 3 is not shown in FIG. 1, when the managed object instance search processing unit 1 searches for information, the managed object instance search processing unit 1 Are stored in the cache memory 3 in the order in which the storage control unit has traced the entries 70 that have been traced.

The AVA comparison unit 2 has the instance name AV included in the managed object instance parameter DN input from the managed object instance search processing unit 1.
A is compared with the instance name AVA stored in the cache memory 3 in order from the top, and when they do not match, the address D corresponding to the instance name AVA at the next higher level is returned to the management object instance search processing unit 1.

Using the obtained address D, the managed object instance search processing section 1 retrieves the entry 70 stored at the address D of the containment tree information storage section 82, performs a search process from the entry 70, and Get an object instance of

Next, the operations of the managed object instance search processing unit 1 and the AVA comparison unit 2 will be described with reference to flowcharts. FIG. 2 is a flowchart showing the operation of the AVA comparison unit 2. In the figure, S2 to S5 show the operation of the AVA comparison unit 2. On the other hand, S1 and S6 show the operation of the managed object instance search processing unit 1.

The managed object instance search processing unit 1 determines that “managedElementId = 1 @ vp
4CTPId = 1 @ tug3Id = 1 @ tug2Id =
2 {tug2CTPId = 1} ($ indicates a delimiter) Managed object instance parameter DN
The operation in the case of searching for the managed object instance represented by the following from the tree structure information stored in the tree structure information storage unit 82 will be described.

The managed object instance search processing unit 1 for obtaining the managed object instance corresponding to the managed object instance parameter DN is stored in the managed object instance parameter DN in the managed object instance search processing unit 1 and the cache memory 3. A request is made to the AVA comparison unit 2 for comparison with the managed object instance parameter DN (S1).

Next, the AVA comparison unit 2 first uses the managed object instance parameter DN of the managed object instance search processing unit 1 to start with “managedE”.
elementId = 1 "(S2), and is compared with the highest instance name AVA of the managed object instance parameter DN existing in the cache memory 3 (S3).

Referring to the cache memory 3, the highest instance name AVA is "managedElement"
Since ntId = 1 ”and the two are equal, the AVA comparison unit 2 takes out the next, that is, the next lower instance name AVA from both (S4), and compares both (S3).

By repeatedly comparing the management object instance parameter DN, a mismatch is detected in “tug2Id = 1” in the cache memory 3 (instance name A of the management object instance search processing unit 1).
VA is “tug2Id = 2”).

Therefore, the AVA comparison unit 2 sets “tug2Id
= 1 ”, the instance name AVA that is one level higher than“ t ”
ug3Id = 1 "and this address D (addr in FIG. 1)
ess3) is returned to the managed object instance search processing unit 1 (S5).

Next, the managed object instance search processing unit 1 uses the instance name AVA “tug3Id =
1 "and the tree structure information storage unit 8 using this address D
2 and retrieves the remaining instance name AVA to obtain a managed object instance (S6). This ends the operation.

That is, the managed object instance search processing unit 1 sets the instance name AVA “tu” in the middle of the inclusion tree.
The search can be started from "g3Id = 1", and the search can be speeded up.

Next, a second embodiment will be described. FIG. 3 is a schematic explanatory view of the second embodiment. FIG.
Is the instance name AV stored in the cache memory 3
FIG. 3 is a configuration diagram of A, an address D, and a table pointer TP.

Referring to FIG. 15, in the cache memory 3, the tables that have been traced in the past are stored in the top tables 91 to 5.
It is stored linearly up to the table 95 of the stage,
In the table 96 in the sixth row, the instance name AVA 96a
And 96b are branched and stored.

That is, the branched instance name AVA
In each of 96a and 96b, an instance name AVA having a relatively high access frequency is selected and stored.

Instead of being selected based on the access frequency, for example, the instance name AVA traced in the previous search is stored as the instance name AVA 96a, and the instance name A traced twice before is recorded as the instance name AVA 96b.
VA may be stored. That is, the instance names AVA in arbitrary two times in the past are stored.

Furthermore, the number of branches is not limited to two, and it is of course possible to branch three or more.

Next, the operation of the second embodiment will be described. This operation shows the operation of the AVA comparison processing unit 2.

Now, the comparison results in the AVA comparison processing section 2 are identical in the tables 91 to 94,
It is assumed that there is a mismatch at. In this case, it is assumed that the instance name AVA95a “tug2Id = 1” has been selected in the table 95.

If only the instance name AVA 95a is stored in the table 95,
The AVA comparison processing unit 2 returns the address “address4” of the instance name AVA 94 one level higher than this to the managed object instance search processing unit 1.

However, in the case of this embodiment, the instance name AVA95b “tug2I
d = 2 ”is also stored.

Therefore, if the instance name AVA 95a “tug2Id = 1” and the instance name AVA 95a do not match, another AVA comparison processing unit 2
The VA 95b is compared with the corresponding instance name AVA in the managed object instance search processing unit 1.

If the comparison result indicates a match, the managed object instance search processing section 1 further stores the instance name AVA 96b “tu12CTPId = 3” immediately below the instance name AVA 95b in the next lower table 96 in the managed object instance search processing section 1. Compare with the corresponding instance name AVA.

If the two do not match, the AVA comparison processing unit 2 returns the address “address7” of the next higher instance name AVA 95 b to the managed object instance search processing unit 1.

That is, by storing two instance names AVA 95a and 95b in the cache memory 3 as the table 95, the instance name AVA 95a
If the instance name AVA 95b does not match even if the AVA comparison processing unit 2 does not match,
Instance name A in table 95 one level lower than 4
The VA 95b can be returned to the managed object instance search processing unit 1, thereby further speeding up the search.

Next, a third embodiment will be described. FIG. 4 is a configuration diagram of the third embodiment. The third embodiment relates to a recording medium on which a program for executing a tree structure information search and retrieval method is recorded, and shows a configuration of the recording medium and an apparatus for driving the recording medium.

The recording medium drive includes a CPU (central processing unit) 11, an input device 12, a storage device 13, an output device 14, the above-described managed object instance search processing unit 1, the AVA comparison processing unit 2, Cache memory 3
These drive the recording medium 15.

The program shown in the flowchart of FIG. 2 is recorded on the recording medium 15, and information such as the instance name AVA is also stored in the cache memory 3.

Next, the operation will be described. First, CP
When U11 reads a program for executing the tree structure information search / search method recorded on the recording medium 15, the program is stored in the storage device 13.

Next, when information for starting a search is input from the input device 12 to the CPU 11, the CPU 11 stores the search processing unit 1, the comparison processing unit 2, and the cache memory 3 based on the program obtained from the storage device 13. Control and perform information search. Then, the search result is output to the output device 14.
The contents of the control are as described above.

Next, an example of the first embodiment will be described.

[0090]

FIG. 5 is a schematic explanatory diagram of the tree structure information of the embodiment. In this embodiment, a predetermined circuit is searched for among the circuits of the three devices A to C constituting the network.

Referring to FIG. 5, at the top of the tree structure information, there is an instance name AVA called “network”.
Directly under the “network” are three instance names AVA “device A”, “device B”, and “device C”.

Further, immediately below “Device A”, there are four instance names AVA “Tana A”, “Tana B”, “Tana C”, and “Tana D”, and “Tana A” There are three instance names AVA immediately below “Board A”, “Board B” and “Board C”, and immediately below “Board A” two instance names AVA “Amplifier A” and “Line A”. There is.

For example, when the device A is described, the device A constituting the network is composed of the boards A to D, and the shelf A is composed of the boards A to C. This indicates that the line A is installed.

Now, it is assumed that the search target is “Amplifier A” immediately below “Board A”. The managed object instance parameter DN is input to the managed object instance search processing unit 1. If the search target is “Amplifier A” immediately below “Board A”, DN is “Network”,
"Device A", "Tana A", "Board A", "Amplifier A"
In the order of AVA.

FIG. 6 is a schematic explanatory view showing an example of information stored in the cache memory 3. Referring to the figure, the cache memory 3 has "network", "device A",
Stores the managed object instance parameters DN specified by the sequence of the AVA of “Tana A”, “Board B”,.

Next, the operation of the AVA comparison section 2 when this example is stored in the cache memory 3 will be described. It should be noted that the flowchart of FIG.

First, the managed object instance parameter DN of the managed object instance search processing unit 1
Is input to the AVA comparison unit 2 (S1).

Next, the AVA comparison unit 2 extracts the highest AVA from the managed object instance search processing unit 1 and the cache memory 3 (S2). Then, the two are compared (S3).

In this case, since both AVAs match in the “network”, the AVA comparison unit 2 sets the next lower AVA
From the management object instance search processing unit 1 and the cache memory 3 (S4). Then, the two are compared (S3).

Also in this case, since both AVAs match in “apparatus A”, the AVA comparing unit 2 extracts the next lower AVA from the managed object instance search processing unit 1 and the cache memory 3 (S4). Then, the two are compared (S3).

Also in this case, since the two AVAs match with each other, "A", the AVA comparison unit 2 retrieves the next lower AVA from the managed object instance search processing unit 1 and the cache memory 3 (S4). Then, the two are compared (S3).

In this case, the AVA of the managed object instance search processing unit 1 is “board A”,
The AVA in the cache memory 3 is “board B”,
The comparison results are inconsistent.

For this reason, the AVA comparison section 2 outputs the next higher AV
A “Tana A” and its address D are returned to the managed object instance search processing unit 1 (S5).

Next, the management object instance search processing section 1 starts searching from the AVA "Tana A" to obtain the target AVA "Amplifier A" (S6).

FIG. 7 is a schematic explanatory view showing another example of the information stored in the cache memory 3. Referring to the figure, the cache memory 3 has two items, a managed object instance parameter DN specified by an AVA sequence of “network”, “device A”, and “tana A”, and “tana A”. AVA "Board B" and "Board A"
And the AVA “line A” one level below “board A”.

Next, another example is the cache memory 3.
The operation of the AVA comparison unit 2 when the data is stored in the. FIG. 8 is a flowchart showing another example of the operation. Note that the flowchart in FIG. 2 is used together with FIG. 8 in the description.

First, the managed object instance parameter DN of the managed object instance search processing unit 1
Is input to the AVA comparison unit 2 (S1).

Next, the AVA comparison unit 2 extracts the highest AVA from the managed object instance search processing unit 1 and the cache memory 3 (S2). Then, the two are compared (S3).

In this case, since both AVAs match in the “network”, the AVA comparison unit 2 outputs the next lower AVA.
From the management object instance search processing unit 1 and the cache memory 3 (S4). Then, the two are compared (S3).

Also in this case, since both AVAs match in “apparatus A”, the AVA comparing unit 2 extracts the next lower AVA from the managed object instance search processing unit 1 and the cache memory 3 (S4). Then, the two are compared (S3).

Also in this case, since the two AVAs match each other with "Tana A", the AVA comparison unit 2 extracts the next lower AVA from the managed object instance search processing unit 1 and the cache memory 3 (S4). Then, the two are compared (S3).

In this case, the AVA of the managed object instance search processing section 1 is “board A”,
The AVA in the cache memory 3 is “board B”,
The comparison results are inconsistent.

In this case, the AVA comparing section 2 checks whether or not there is an AVA of the same rank as “board B” in the cache memory 3 (S11). If not, the processing of S5 and S6 described above is performed.

However, in another example, since the AVA “board A” of the same rank as “board B” is stored in the cache memory 3, the AVA comparison unit 2 stores the AVA “board A” from the cache memory 3. Take it out (S12). Then, the AVA “board A” is compared with the AVA “board A” of the managed object instance search processing unit 1 (S13).

Since the comparison results match, the AVA comparison unit 2
Retrieves the next lower AVA from the managed object instance search processing unit 1 and the cache memory 3 (S
14). Then, the two are compared (S3).

In this case, the AVA of the managed object instance search processing unit 1 is “Amplifier A”,
The AVA of the cache memory 3 is “line A”, and the comparison result is inconsistent.

Since there is no AVA at the same rank as the “line A” (S11), the above-described processing of S5 and S6 is performed.

That is, the AVA comparison unit 2 instructs the managed object instance search processing unit 1 to execute the AV of “board A”.
A and this address are returned (S5).

Next, the management object instance search processing section 1 starts searching from the AVA "board A" to obtain the target AVA "amplifier A" (S6).

[0120]

According to the present invention, at the time of information retrieval, the intermediate information traversed is stored in the storage means in the tracing order, and at the next retrieval, the information stored in the storage means and the information to be searched are retrieved. Are compared in order from the top, and if the result of the comparison is a match, the containment tree traced so far is omitted, and a device that starts the search from the upper information immediately before the mismatched information is obtained. Can be speeded up without pre-designating.

According to another aspect of the present invention, at the time of searching for information, the information that has been traced is stored in the storage means in the order of tracing, and at the time of the next search, the information stored in the storing means is stored in the storage means. Since the search information is compared in order from the top, if the comparison result is a match, the inclusion tree traced so far is omitted, and a method of starting the search from the upper information immediately before the mismatched information is obtained. The search can be speeded up without specifying the search range in advance.

Further, according to another aspect of the present invention, at the time of information retrieval, the intermediate information traversed is stored in the storage means in the tracing order, and at the time of the next retrieval, the information stored in the storage means is stored. Compares the searched information with the information in order from the top and records a program to start the search from the upper information immediately before the mismatched information, omitting the inclusion tree traced up to that point if the comparison result matches Thus, a high-speed search can be achieved without specifying a search range in advance.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a first embodiment of a tree structure information search device according to the present invention.

FIG. 2 is a flowchart showing an operation of an AVA comparison unit 2 of the device.

FIG. 3 is a schematic explanatory view of a second embodiment of the device.

FIG. 4 is a configuration diagram of a third embodiment of the device.

FIG. 5 is a schematic explanatory diagram of tree structure information according to the embodiment of the apparatus.

FIG. 6 is a schematic explanatory view showing an example of information stored in a cache memory 3.

FIG. 7 is a schematic explanatory view showing another example of the information stored in the cache memory 3.

FIG. 8 is a flowchart showing an operation of another example.

FIG. 9 is a schematic diagram illustrating an example of conventional tree structure information.

FIG. 10 is a format diagram of an entry.

FIG. 11 is a configuration diagram of an example of a conventional tree structure information search device.

FIG. 12 is a flowchart showing the operation of the apparatus.

FIG. 13 is a configuration diagram of another example of the device.

[Explanation of symbols]

 Reference Signs List 1 managed object instance search processing unit 2 AVA comparison unit 3 cache memory 15 recording medium 82 tree structure information storage unit

Claims (24)

[Claims] 1. A tree structure information search device for sequentially searching a plurality of pieces of information related by a tree structure from the highest-order information to obtain the lowest-order information of interest. History storing means for storing the history of intermediate information, and prior to performing a new information search, of the searched information of each rank and the information stored in the history storing means, the same as the searched information of each rank; A tree structure information search device, comprising: comparison means for comparing information in order from the highest-order information; and search means for starting a search from predetermined information in accordance with the comparison result of the comparison means. 2. The tree structure information search device according to claim 1, wherein the history storage means stores intermediate information obtained at the time of a previous search. 3. The tree structure information search device according to claim 1, wherein the history storage means stores intermediate information having the highest access frequency. 4. The tree structure information search device according to claim 1, wherein said history storage means includes intermediate information associated with said tree structure. 5. The comparison means retrieves information one level higher than the information in which a mismatch is detected from the history storage means and sends it to the search means, and the search means uses the information obtained from the comparison means as a starting point. The tree structure information search device according to any one of claims 1 to 4, wherein the search is started. 6. A tree structure information storing means for storing each of a plurality of pieces of information related by the tree structure at different addresses, and the intermediate information stored in the history storing means includes the information. 6. The tree structure information search device according to claim 1, further comprising an address of the stored tree structure information storage unit. 7. Each piece of information related by the tree structure specifies main information, an information group pointer for specifying a next lower information group to be traced, and one piece of information to be obtained from a peer information group. The tree structure information search device according to any one of claims 1 to 6, further comprising: 8. The tree structure information according to claim 1, wherein the tree structure information is information for searching for a predetermined circuit among circuits included in each device constituting the network. Search device. 9. A tree structure information search method for sequentially searching a plurality of pieces of information related by a tree structure from the highest-order information and obtaining the lowest-order information of interest. A first process of recording the history of the intermediate information, and prior to performing a new information search, of the searched information of each rank and the same information as the searched information of each rank among the information recorded in the first processing. Tree structure information, comprising: a second process for sequentially comparing information with the highest-order information; and a third process for starting a search from predetermined-position information in accordance with the comparison result in the second process. retrieval method. 10. The tree structure information search method according to claim 9, wherein, in the first processing, information of an intermediate position in a previous search is recorded. 11. The tree structure information search method according to claim 9, wherein, in the first processing, intermediate information having the highest access frequency is recorded. 12. The tree structure information search method according to claim 9, wherein the information recorded in said first processing includes intermediate information associated with said tree structure. 13. In the second process, when the result of the comparison indicates a mismatch, information one level higher than the mismatched information is extracted from the information recorded in the first process.
The tree structure information search method according to any one of claims 9 to 12, wherein the third process starts a search starting from information obtained by the second process. 14. A fourth process for recording each of a plurality of pieces of information related by the tree structure at different addresses, and the information is recorded in intermediate information recorded in the first process. 14. The tree structure information search method according to claim 9, further comprising an address in the fourth processing performed. 15. The information associated with the tree structure includes main information, an information group pointer for specifying a next lower information group to be traced, and one information to be obtained from the same information group.
The tree structure information search method according to any one of claims 9 to 14, further comprising one information pointer for specifying the information of the tree structure. 16. The tree structure information according to claim 9, wherein the tree structure information is information for searching for a predetermined circuit among circuits included in each device constituting the network. retrieval method. 17. A recording medium storing a program for executing a tree structure information search method for sequentially searching a plurality of pieces of information related by a tree structure from the highest-order information and obtaining the lowest-order information of interest. In the information search, a first process for recording the history of the intermediate information traversed, and information to be searched for and information recorded in the first process prior to performing a new information search. A second process of sequentially comparing the searched information of each rank and information of the same rank in order from the highest rank information, and a third process of starting a search from the predetermined rank information according to the comparison result in the second process. Recording medium on which a program for executing the above is recorded. 18. The recording medium according to claim 17, wherein, in the first processing, information of an intermediate position at the time of a previous search is recorded. 19. The recording medium according to claim 17, wherein intermediate information having the highest access frequency is recorded in said first processing. 20. The recording medium according to claim 17, wherein the information recorded in said first processing includes intermediate-level information related by said tree structure. 21. In the second process, when the result of the comparison indicates a mismatch, information one stage higher than the mismatched information is extracted from the information recorded in the first process.
The recording medium according to any one of claims 17 to 20, wherein the third process starts a search starting from information obtained by the second process. 22. A fourth process for recording each of a plurality of pieces of information related by the tree structure at different addresses, and the information is recorded in intermediate information recorded in the first process. 22. The recording medium according to claim 17, further comprising an address in said fourth processing performed. 23. Each piece of information related by the tree structure includes main information, an information group pointer designating a next lower information group to be traced, and one information to be obtained from a peer information group.
23. The recording medium according to claim 17, further comprising one information pointer for specifying the information of (1). 24. The method according to claim 17, wherein the tree structure information is information for searching for a predetermined circuit among circuits included in each device constituting the network. The recording medium according to the above.