JPH0540787A - System for increasing speed for apex retrieval by name in tree structure - Google Patents

Abstract

PURPOSE:To give a set of names whose number of degrees of freedom on description is large to quickly search an apex at the time of searching the apex of a tree structure. CONSTITUTION:A first search method call part detecting means 11 of a search method conversion program 1 detects a first search method call part 21 included in a search program 2 before change. A first search method executing means 12 uses a set 22 of names given to the detected first search method call part 21 to execute the first search method for a tree structure source code 3 and finds an end point. A set acquiring means 13 of a second search method name acquires a set 42 of first names of respective apexes other than the start point which appear in the route from the start point to the end point. A search method substituting means 14 uses the set 42 of names to substitute the first search method call part 21 with a second search method call part 41, thus generating a search program 4 after conversion.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for searching for vertices by name in a data structure using a tree structure, for example, a structure using a tree structure for storing a hierarchical data structure, and more particularly to a vertex by name in a tree structure. The present invention relates to a search speedup method.

[0002]

2. Description of the Related Art In the conventional vertex search method by name in a tree structure, each vertex forming a tree structure has an ordered name of 0 or more, and any vertex is adjacent to the vertex and all the neighbors from the vertex. 1 at the vertex and all vertices reachable only through unnamed vertices
When searching for vertices by name in a tree structure in which the th name is unique, a complicated vertex search method (hereinafter referred to as the first search method) is performed by weakening the restriction on the method of giving the name set. It was executed or a simple vertex search method (hereinafter, referred to as the second search method) was executed by strengthening the restriction on the method of giving the name set. The first search method is superior in that the set of names required to specify vertices has a higher degree of freedom in description than the set of names required to specify vertices by the second search method. The second search method is superior to the first search method in that it is simpler.

[0003]

In the above-described conventional tree-structured vertex search method by name, since the search is complicated as in the first search method, the execution of the search is delayed, or the second search method is executed.
There was a problem that the degree of freedom in giving a name set was low, as in the search method.

In view of the above points, an object of the present invention is to convert a set of names having a high degree of freedom in description of the first search method into a set of names for the second search method in preprocessing of the search program,
It is an object of the present invention to provide a speed-up method for vertex search by name in a tree structure, which is configured to perform vertex search at high speed by a second search method that facilitates execution of search at the time of execution.

[0005]

A method for accelerating a vertex search by name in a tree structure according to the present invention has 0 or more ordered vertices forming a tree structure, and the vertices of any vertex are And a tree structure in which the first name is unique among all adjacent vertices and all vertices that do not have a name can be reached from the start point and the start point. A first search method for finding an end point which is a vertex specified from the start point and the name set when a unique name set is given to all the vertices, and the start point and all adjacent vertices from the start point, and Given a first set of names unique to all vertices reachable only via unnamed vertices, find the endpoint that is the vertex identified by the start point and the name set. Two In an information processing system capable of executing a search method, a first search method calling part detecting means for detecting a first search method calling part included in a search program, and the first search method calling part detecting means are detected. First search method executing means for executing the first search method and finding an end point by using the set of names given to the first search method calling part, and an end point searched by the first search method executing means from the start point. Using the second search method name set obtaining means for obtaining the first name set of each vertex other than the starting point appearing on the path to and the name set obtained by this second search method name set obtaining means And a search method replacing means for replacing the first search method calling unit with the second search method calling unit.

[0006]

In the method for speeding up the vertex search by name in the tree structure of the present invention, the first search method calling unit detection means detects the first search method calling unit included in the search program, and the first search method execution unit is executed. Performs the first search method by using the set of names given to the first search method calling unit detected by the first search method calling unit detection means to discover the end point, and obtains the second search method name set. The means obtains the first name set of each vertex other than the start point appearing on the path from the start point to the end point searched by the first search method execution means, and the search method replacement means by the second search method name set acquisition means. The first search method calling unit is replaced with the second search method calling unit using the obtained set of names.

[0007]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram showing the structure of a speed-up system for vertex search by name in a tree structure according to an embodiment of the present invention. The method for speeding up the vertex search by name in the tree structure of the present embodiment is a search method conversion program 1
, Pre-conversion search program 2 and tree structure source code 3
And the post-conversion search program 4 constitute the main part thereof.

The search method conversion program 1 is provided to the first search method calling unit detecting means 11 for detecting the first search method calling unit 21 included in the pre-conversion search program 2 and the first search method calling unit 21. The first search method executing means 12 for executing the first search method and finding the end point using the set 22 of names, and the first name set 42 of each vertex other than the start point appearing on the road from the start point to the end point It is configured to include a second search method name set acquisition unit 13 for obtaining and a search method replacement unit 14 for replacing the first search method calling unit 21 with the second search method calling unit 41 using the name set 42. ..

The pre-conversion search program 2 includes a first search method calling unit 21 having a set of names 22 for specifying an end point as a parameter.

The tree structure source code 3 has a name of 0 or more in which each of the vertices forming the tree structure is ordered, and with respect to an arbitrary vertex, the vertex and all the vertices adjacent to the vertex and the vertex having no name. Describe a tree structure in which the first name is unique at all vertices reachable via only.

FIG. 2 is a diagram showing a specific example of the tree structure described by the tree structure source code 3. This tree structure has a vertex 31 having a name A, a vertex 32 having names b and B, a vertex 33 having no name, and a vertex 34 having names c and B.
, A vertex 35 having no name, a vertex 36 having names b and C, and a vertex 37 having names e and B. Here, assuming that the starting point of the search is fixed to the vertex 31, if a set of names corresponding to the vertex 36 is given,
The name set 22 that can be created by the first search method includes “C”,
"C, b,", "c, C", "c, B, b", "c,
b, C ”,“ c, B, b, C, ”,“ A, C ”,“ A,
c, b ”,“ A, c, C ”,“ A, c, B, b ”,
There are "A, c, b, C" and "A, c, B, b, C". On the other hand, the set of names 42 that can find the same vertex 36 by the second search method is only "c, b".

The post-conversion search program 4 has a set of names 42
The second search method calling unit 41 with the parameter as a parameter is included.

Next, the operation of the name-accelerating vertex searching method of the present embodiment thus constructed will be described.

When the search method conversion program 1 is activated as a pre-process for the source code of the pre-conversion search program 2, the first search method calling part detection means 11 first calls the first search method in the pre-conversion search program 2. The part 21 is detected.

The first search method calling unit detection means 11 causes the first search method calling unit 21 in the pre-conversion search program 2.
Is detected, the first search method execution means 12 searches the tree structure source code 3 by the first search method using the name set 22 which is the parameter given to the first search method calling unit 21. Then, the vertex 36, which is the end point, is found. Here, the name set 22 includes “C”, “c, b,”, “c,
C "," c, B, b "," c, b, C "," c, B,
b, C, ”,“ A, C ”,“ A, c, b ”,“ A, c,
Of course, it may be any of C "," A, c, B, b "," A, c, b, C "or" A, c, B, b, C ".

Next, the second search method name set acquisition means 1
3 obtains the first name set 42 "c, b" of each vertex other than the starting point appearing on the path from the starting point 31 to the ending point 36 from the tree structure source code 3.

Finally, the search method replacement means 14 replaces the first search method calling section 21 and the name set 22 in the pre-conversion search program 2 with the second search method calling section 41 and the name set 42 "c, b". After conversion, the converted search program 4
To generate.

When the post-conversion search program 4 thus generated is compiled and then executed, the second search method calling unit 41 calls the second search method using the name set 42 "c, b". The vertex 36, which is the end point, is searched at high speed by the second search method.

[0020]

As described above, according to the present invention, each vertex forming a tree structure has an ordered name of 0 or more, and for any vertex, the vertex and all the vertices adjacent to the vertex and the name. In searching for vertices by name in a tree structure where the first name is unique among all vertices that can be reached via only vertices that do not have By converting the set of names having a high degree of freedom into the set of names of the second search method, and performing the search of the vertices at a high speed by the second search method that is easy to execute the search when the search program is executed, This has an effect that it is possible to perform a vertex search at high speed by giving a set of names having a high degree of freedom in description.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a speed-up method for vertex search by name in a tree structure according to an embodiment of the present invention.

FIG. 2 is a diagram showing an example of a tree structure composed of vertices having 0 or more ordered names described in the tree structure source code in FIG.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 search method conversion program 2 pre-conversion search program 3 tree structure source code 4 post-conversion search program 11 1st search method calling part detection means 12 1st search method execution means 13 2nd search method name set acquisition means 14 search method replacement Means 21 First search method calling unit 22 Name set 41 Second search method calling unit 42 Name set 31 Vertices with name A 32 Vertices with names b and B 33 Vertices without names 34 Having names c and B Vertex 35 Vertex without name 36 Vertex with name b, C 37 Vertex with name e, B

Claims (1)

[Claims] 1. Each of the vertices forming a tree structure has an ordered number of 0 or more, and for any vertices, only the vertices and all vertices adjacent to the vertices and unnamed vertices are passed. 1 at every reachable vertex
For a tree structure where the th name is unique, at the vertex identified by the starting point and the name pair when a unique name pair is given at the starting point and all vertices reachable from the starting point. Given a first search method of finding an end point and a unique first set of names at the start point and all adjacent vertices from the start point and only those vertices that are unnamed In a data processing system capable of executing a second search method for finding an end point that is a vertex specified by a set of a start point and a name, a first search method calling unit included in a search program is detected. The first search method is executed by using the first search method calling part detecting means and the set of names given to the first search method calling part detected by the first search method calling part detecting means to find the end point. First Search method execution means, and second search method name set acquisition means for obtaining the first name set of each vertex other than the start point appearing on the path from the start point to the end point searched by the first search method execution means, A tree structure comprising: a search method replacing unit that replaces the first search method calling unit with a second search method calling unit using the name set obtained by the second search method name set obtaining unit. Speeding up of vertex search by name in.