JPH1063675A - Data retrieving method and data retrieving device applying the method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a data retrieving device capable of executing data retrieval at a high speed without being influenced by the processing speed of a data storage device. SOLUTION: The data retrieving device is provided with a data storage device 11 for storing data to be retrieved as a data base of tree structure, a retrieving program generating part 12 for generating a retrieving program having a conditional branch corresponding to the tree structure from the data base, a program storage part 13 for storing the retrieving program, a retrieving program executing part 14 for executing data retrieval by executing the retrieving program in accordance with the input of a retrieval key, and an I/O interface 15 for outputting the retrieved result of the data retrieval of the execution part 14. Since the use of the data storage device 11 is not unnecessary at the time of executing the retrieving program, high speed data retrieval can be attained independently of the processing speed of the device 11.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

[0001] 1. Field of the Invention [0002] The present invention relates to a data search method for a database capable of high-speed search of large-capacity graphic data in a layout of an LSI or the like and a data search apparatus to which the method is applied.

[0002]

2. Description of the Related Art Heretofore, this kind of data search for a database has been applied to search for a figure including a given point or a nearby figure in an LSI layout, a chip wiring, a verification system or the like. Such a related technique includes, for example, a high-speed data search device and a high-speed data search method disclosed in Japanese Patent Application Laid-Open No. 7-319894.

FIG. 9 is a block diagram showing a basic configuration of the high-speed data search device. This high-speed data search device performs a graphic search on a specific partial data set in a database.
It comprises a search range storage register 93, a search processing unit 95, a data storage memory 93, and an input / output interface 91.

In this high-speed data search device, a search range and a search key are input to an input / output interface 91, a search range determining unit 92 determines a search range address, and stores this address in a search range storage register 94. The search processing unit 95 performs a search using this address, and outputs a search result from the input / output interface 91, so that a search is performed from a specific node part closer to the end than the root of the tree structure of the database. .

[0005]

In the case of the high-speed data search by the high-speed data search apparatus described above, the data between the data storage memory and the search processing unit is searched for searching the tree structure of the database stored in the data storage memory. Frequent transfers cause the data search speed to be affected by the processing speed of the data storage memory, that is, the data storage device. Therefore, even if the arithmetic processing speed of the search processing unit is increased, the data search speed is reduced. There is a problem that it is not fast.

SUMMARY OF THE INVENTION The present invention has been made to solve such a problem, and its technical problem is to provide a data search method and a data search method capable of executing a high-speed data search without being affected by the processing speed of a data storage device. It is an object of the present invention to provide a data search device to which the above is applied.

[0007]

According to the present invention, a search program generating step of generating a search program having a conditional branch corresponding to a tree structure from a database in which data is stored using the tree structure; A search result inputting a search key, executing the search program, and outputting a search result.

On the other hand, according to the present invention, a search program generator for generating a search program having a conditional branch corresponding to a tree structure from a database storing data using the tree structure, and a program storage for storing the search program A search program execution unit that executes a search program in accordance with an input of a search key to perform a data search; and an input / output interface that inputs a search key and outputs a search result of the data search by the search program execution unit. A data search device is obtained.

Further, according to the present invention, in the above data search device, a search result storage device for storing a search key and data of a search result when the data search is performed by the search program execution unit is provided. The unit obtains a data search device that skips the execution of the search program for the same search key by referring to the search result storage device during the current data search.

[0010]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A data search method and a data search apparatus to which the present invention is applied will be described in detail below with reference to the drawings.

First, the outline of the data search method of the present invention will be briefly described. This data search method includes a search program generating step of generating a search program having a conditional branch corresponding to a tree structure from a database in which data is stored using a tree structure, and inputting a search key to the search program to execute the search program. And outputting a search result.

According to such a data search method, a search program having a conditional branch structure corresponding to a tree structure is generated from a database, and data is searched for by executing the search program. There is no need to use a data storage device for execution, which enables high-speed data search independent of the speed of the data storage device.

FIG. 1 shows a basic configuration of a data search apparatus according to an embodiment to which the data search method is applied.

This data search device includes a data storage device 11 in which data to be searched is stored as a database in a tree structure, and a search having a conditional branch corresponding to the tree structure from a database in which data is stored using the tree structure. A search program generation unit 12 for generating a program, a program storage device 13 for storing a search program, a search program execution unit 14 for executing a search program in accordance with a search key input and performing a data search, and inputting a search key. And an input / output interface 15 for outputting a search result of the data search by the search program execution unit 14.

In this data search device, since the data to be searched is stored in the data storage device 11 as a database in a tree structure, the search program generation unit 12 reads the tree structure data from the data storage device 11 and generates the data. The retrieved search program is stored in the program storage device 13. The search program execution unit 14 reads the search program from the program storage device 13, inputs a search key from the input / output interface 15, executes the search program, and outputs the search result to the input / output interface 1.
5 is output.

FIG. 2 illustrates a multi-tree structure of data to be searched stored in the data storage device 11. Here, the multitree is a tree structure composed of a plurality of nodes 21 including one or less parents and n or less children. Each node 21 includes a data storage condition 22 for the node and a condition for the data storage. Any number of data 23 to be satisfied is stored. Incidentally, a node having no parent in the tree structure is called a root.

In the case of the above-described data search device, the search program generator 12 reads the data of the multi-tree structure from the data storage device 11, and recursively traces each node 21 of the multi-tree structure from the root to the multi-tree structure. A search program having a corresponding conditional branch structure is generated, and the search program is stored in the program storage memory 13. Therefore,
Subsequent processing is performed by the search program execution unit 1 as described above.
4 is stored in the program storage device 1
3, the search key input from the input / output interface 15 is input to the search program, and the search program is executed. Finally, the output result of the search program, that is, the search result is output to the input / output interface 15.

FIG. 3 is a flowchart showing a process of generating a search program having a conditional branch structure corresponding to data having a multi-tree structure in the search program generation unit 12.

This procedure is a recursive procedure,
First, call this procedure for the root node of the tree, check the data storage condition of the node, and execute the following statement if the search key corresponds to data that satisfies the data storage condition of the node. (Step S3)
1) Yes.

Next, it is determined whether data is stored in the node (step S32). If the data is stored, a command statement or a sequence of command statements for outputting all the data is generated (step S32). S33), but if no data is stored, a command statement that executes nothing is generated (step S34).

Subsequently, it is determined whether or not there is any child node of the node (step S35). If there is no child node, this procedure is terminated (step S39). Select one (Step S3
6) Then, the procedure is recursively called for the node (step S37).

Further, it is determined whether or not there is any unselected child node (step S38). If not, the procedure is terminated (step S39). If there is, one of the child nodes is selected (step S38). S36) Return to the processing to be performed,
This procedure is recursively called for all child nodes of the current node by repeating the processing of steps S36 to S38.

In this way, if a search program is generated from the data to be searched and the data search is performed by directly executing the search program, there is no need to use the data storage device 11 at the time of data search. A high-speed data search is realized without being affected by the processing speed of the data storage device 11.

By the way, if the data search apparatus shown in FIG. 1 is concretely constructed, a detailed configuration as shown in FIG. 4 is obtained.

Here, a data RAM 41 is used for the data storage device 11, a search program object file 43 is used for the program storage device 13, and an input / output terminal 45 is used for the input / output interface 15. I have. The search program generation unit 42 that embodies the search program generation unit 12 includes a search program generation program 421, a search program source file 422, and a compiler 423. The program execution unit 44 includes a program loader 441 and a program RAM 442.

The operation of the data search apparatus will be described in detail below. Here, it is assumed that the data to be searched is a one-dimensional line segment, and all the line segments including one point given as a search key are searched. or,
FIG. 5 illustrates the line segment data A to G to be searched, and FIG. 6 illustrates the line segment data to be searched shown in FIG. 5 in a binary tree structure.

First, referring to FIG. 6, a one-dimensional section [i, j] is assigned as a data storage condition of each node of the binary tree structure, and a data storage condition of a left child node of each node is assigned. Is the interval [i, (i + j) / 2], and the data storage condition of the right child node is the interval [(i + j) / 2 +
[1, j]]. A section [i,
j], specifically, the coordinates x1 and x2 (where x1 ≦ x2) at both ends of a line segment are x1 ≦ i and j ≦
If it is x2, the data of the line segment is stored in a node having the section [i, j] as a storage condition. It is assumed that the line segment data represented by the binary tree is stored in the data RAM 41.

Referring to FIG. 4, the search program generation program 421 reads the binary tree data from the data RAM 41 and recursively traces each node from the root of the binary tree, and executes conditional branching corresponding to the binary tree structure. A search program source file 422 having the following structure is generated.

FIG. 7 is a flowchart showing an operation process of a recursive procedure for generating a search program from nodes having a binary tree structure.

This procedure is first called for the root node of the binary tree. First, assuming that the data storage condition of the node is [i, j], a command sentence "If the coordinates of the search key point is not less than i and not more than j, execute the next command sentence" is generated (step S71). Next, it is determined whether or not data is stored in the node (step S72). If data is stored in the node, a command statement or a sequence of command statements for outputting all the line segment data is output (step S72). S
73) However, if no data is stored in the node, a statement that does nothing is generated (step S74).

Next, it is determined whether or not the node has a left child node (step S75), and if so, this procedure is recursively called for the left child node (step S75).
76) After performing the processing, similarly to the case where there is no left child node, it is subsequently determined whether or not the node has a right child node (step S77). Call this procedure recursively (step S
78) After performing the processing, a series of processing is returned (step S79), as in the case where there is no right child node.

In the data search apparatus shown in FIG. 4, a search program source file 422 generated from a search program generation program 421 is compiled by a compiler 423, and a search program object file 43 is generated. The program loader 441 stores the search program object file 43 in the program R
After the data is stored in the AM 442, the search program is started, and a search key, that is, data of point coordinates is input from the input / output terminal 45 and input to the search program. The execution result of the search program, that is, the line segment data as the searched result is output to the input / output terminal 35.

FIG. 8 is a block diagram showing a basic configuration of a data search apparatus according to another embodiment of the present invention.

This data search device is different from the data search device of the embodiment shown in FIG.
A search program generator 82, a program storage device 83,
In addition to a search program execution unit 84 and an input / output interface 85, the search program execution unit 84 includes a search result storage device 86 that stores search keys and data of search results when data search was previously performed. Is done.

Also in this data search device, since the data to be searched is stored in the data storage device 81 in a tree structure, the search program generation unit 82 reads the tree structure data from the data storage device 81 and generates the data. The retrieved search program is stored in the program storage device 83. The search program execution unit 84 includes an input / output interface 85
, A search key is searched for whether or not the search key exists in the search result storage device 86. As a result, if it exists, the corresponding search result data is stored in the search result storage device 8.
6 and outputs the search program to the input / output interface 85 while omitting the execution of the search program. If the search program does not exist, the search program is read from the program storage device 83 and executed, and the search result is output to the input / output interface 85. At the same time, the search key and search result data are stored in the search result storage device 86.

That is, this data search device has the same function as that of the first embodiment, and also has a function capable of omitting the execution of the search program for the same search key. A faster search can be performed.

[0037]

As described above, according to the data search method and the data search apparatus to which the present invention is applied, a search program is generated from a database in which data is stored using a tree structure, and the search program is executed. Is directly executed, there is no need to use a data storage device during data search, and data search can be performed at high speed without being affected by the processing speed of the data storage device. Further, the data search device further includes a search result storage device for storing a search key and data of a search result obtained when the search program was previously searched by the search program execution unit, and the search program execution unit executes the search program. Since the execution of the search program can be omitted for the same search key with reference to the search result storage device, a higher speed search can be performed.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a basic configuration of a data search device according to an embodiment to which a data search method of the present invention is applied.

FIG. 2 illustrates a multi-tree structure of data stored in a data storage device of the data search device shown in FIG.

FIG. 3 is a flowchart showing a process of generating a search program having a conditional branch structure corresponding to data having a multi-tree structure in a search program generation unit of the data search device shown in FIG.

FIG. 4 is a block diagram showing a detailed configuration of the data search device shown in FIG. 1 specifically constructed;

5 illustrates line segment data to be searched in the data search device illustrated in FIG.

FIG. 6 is a representation of the line segment data shown in FIG. 5 in a binary tree structure.

7 is a flowchart showing an operation process of a recursive procedure for generating a search program from nodes having a binary tree structure shown in FIG. 6 in the data search device shown in FIG. 4;

FIG. 8 is a block diagram showing a basic configuration of a data search device according to another embodiment of the present invention.

FIG. 9 is a block diagram showing a basic configuration of a conventional high-speed data search device.

[Explanation of symbols]

 11, 81 Data storage device 12, 42, 82 Search program generation unit 13, 83 Program storage device 14, 44, 84 Search program execution unit 15, 85, 91 Input / output interface 21 Node 22 Data storage condition 23 Data 41 Data RAM 43 Search program / object file 45 Input / output terminal 86 Search result storage device 92 Search range determination unit 93 Data storage memory 94 Search range storage register 95 Search processing unit 421 Search program generation program 422 Search program source file 423 Compiler 441 Program / Loader 442 Program RAM

Claims (3)

[Claims] 1. A search program generating step of generating a search program having a conditional branch corresponding to a tree structure from a database in which data is stored using a tree structure, and inputting a search key to the search program to execute the search program And outputting a search result. 2. A search program generator for generating a search program having a conditional branch corresponding to a tree structure from a database storing data using a tree structure, a program storage device storing the search program, and a search key. A search program execution unit for executing the search program in accordance with the input of the search program to perform a data search, and an input / output interface for inputting the search key and outputting a search result of the data search by the search program execution unit. A data search device, characterized in that: 3. The data search device according to claim 2, further comprising: a search result storage device that stores the search key and the data of the search result when the data search is performed by the search program execution unit. A data search device, wherein a search program execution unit refers to the search result storage device at the time of current data search and omits execution of the search program for the same search key.