JP3502440B2 - High-speed data search device and high-speed data search method - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a database device capable of high-speed data retrieval of graphic information and a graphic information processing method. In particular, the present invention relates to a high-speed data search apparatus and method capable of high-speed graphic search for large-capacity graphic information such as in-chip wiring in VLSI or ULSI layout.

[0002]

2. Description of the Related Art The amount of data handled by a database device in recent years, such as a database device in a VLSI layout or a ULSI layout, has been increasing, and the processing time required to search for these data is inevitably increased. ing. MOSdRAM technology is now entering the era of 256 Mbits to 1 Gbits, and in the in-chip wiring in ULSI or VLSI layout, the size of the area in which terminals included in a certain wiring net are distributed is the same as the size of the entire chip. It is becoming very small in comparison. On the other hand, practically, in the wiring processing on the chip, etc., it is often the case that a specific partial data set in the area around the terminal is continuously searched multiple times, and data outside the area is required during wiring. Mostly not.

Considering a database device in such a VLSI layout, most of the data handled in the VLSI layout is rectangular graphic data, and therefore it is necessary to perform a search for a rectangular set at high speed. Hereafter, when simply written as a figure, it means a rectangle,
A data search for a graphic is called "graphic search". In the conventional database device, even in the search for such a partial data set, all the data in the database may become a search target, and therefore a wasteful search time is spent.

FIG. 31 is a flowchart showing a processing procedure for data retrieval of a conventional database device. The conventional data search process of the database device includes input of search target data (step S11), search targeting all data in the database (step S12), and output of search result (step S13).

Description will be made by taking FIG. 32 and FIG. 33 as an example. The data search in this case is specifically a graphic search on the VLSI chip. Plural pieces of rectangular data {R1, R2, ... R12} exist on the VLSI chip 11.
These rectangular data are distributed and stored in each node of the quadtree.

A specific method of storing rectangular data is as follows:
Rectangle data {R2, R6, R7, R8, R9, R10} that intersects horizontal and vertical line segments that divide 1 into 4 is divided into nodes A
To store. In the following, the rectangular data R1 included in the upper left area divided into four is placed below the node B, the rectangular data {R3, R4, R5} included in the upper right area is placed below the node C, and the rectangle included in the lower right area. Data {R11, R12} is recursively stored below node D.

The data search is always started from the node A which is the root of the quadtree, and proceeds toward the end of the tree structure. In the following example, description will be made assuming that the rectangular data sought is present in the rectangular area 13. FIG. 32 shows a case where the figure search is started leftward from the point S and the rectangular data R11 is obtained as a solution. A quad tree as a conventional data compression technique for a pyramid-type data structure.
It is known that a rectangular set is structured and stored in a storage area by using, and a graphic search is performed. However, in FIG. 32, a node F is started from a node A indicated by an arrow 14 and a node F is passed through the node D. And has ended (see the alternate long and short dash line in the lower figure of FIG. 32). The rectangular data referenced during the search is {R2, R6
R7, R8, R9, R10, R11, R12} are eight in total.

FIG. 33 shows a case in which the rectangular data R11 is obtained as a solution by searching downward from the point T. Also at this time, the search starts from the node A indicated by the arrow 14 in the figure,
It reaches the node F via the node D and ends (Fig. 33).
(See the chain line below). The rectangular data referenced in the search is {R2, R6, R7, R8, R9, R10, R1.
1, R12} in total.

Here, the rectangular data stored in the node A {R2, R6, R7, R8, R9, R10, R11}
Since none of them are included in the rectangular area 13 and thus do not serve as a search solution, they are always referred to, so it can be said that the search is wasted. Therefore VLS
The figure search in the I layout or the like requires a longer time as the data amount becomes larger, and there is a drawback that the speed cannot be increased.

Further, when the line segment 31 is present in the VLSI chip 11 of FIG. 34 and the rectangle having the shortest distance in one direction (direction indicated by the arrow in the figure) in the orthogonal direction is obtained, so-called proximity figure search is performed. Consider the case of. In this case, the area to be searched (hereinafter simply referred to as the search area) is assumed to be the area indicated by 30 in FIG. (The solution of the proximity figure search in FIG. 34 is r17.) Again, using a quadtree as a conventional technique, a rectangular set {r2 to r17} is structured and stored in a storage area, and a proximity figure search is performed. To do.

In FIG. 35, the rectangular set {r2 to r17} is set to 4
It is a figure showing the process of structuring with a branch tree, and the dendritic structure after structuring. First, a line segment Q1 that divides the VLSI chip 11 into four is generated in 11 and a rectangular set {r2, r3, r4, r5, r6, r7, r1 that intersects the cross-shaped line segment Q1 is generated.
0, r11, r15} and a rectangular set {r12}, {r16, r1 included in the four regions divided by Q1.
7}, {r8, r9}, and {r13, r14}. Rectangle sets {r12}, {r16, r17}, {r9}, which are included in the four regions divided by Q1,
The division process is recursively performed on {r13, r14}. Through the above processing, the quadtree structure shown in the figure is created.

Next, referring to FIG. 36, a processing procedure of a conventional figure search by a quadtree will be described. First, the root rectangle set of the quadtree structure, that is, the rectangle set {r2, r3, r4, r5, r6, r7, r10, which intersects the dividing line segment Q1.
The solution is obtained by targeting r11, r15}, and the rectangle r15 closest to the line segment 31 is obtained as the solution. Next, a set of rectangles intersecting the cross-shaped dividing line segment Q3 {r16, r1
7} is obtained and r17 is obtained as a solution. There r15
And r17, which is the closest to 31 is selected as the solution. Since the solution is obtained from the rectangle set intersecting Q1, it is not necessary to search after the rectangle set intersecting the cross line segment Q5.

The point to be noted here is that in the above case, Q1
Since the solution was obtained from the rectangle set that intersects with Q5, it is no longer necessary to search after the rectangle set that intersects Q5. Conversely, if no solution is obtained from the rectangle set that intersects Q1, T17 The point is that it is necessary to recursively search a rectangle set that intersects Q5 as a rectangle to be compared with. That is, in the worst case, all nodes may be searched in the y direction. In addition, two line segments that intersect in a cross shape like a quadtree are used as dividing line segments,
When the rectangles that intersect with this are grouped into one set, the rectangles that do not intersect the search area occupy most of the set, so the proximity figure search for these becomes inefficient.

In the conventional adjacent figure search using the quadtree as described above, the search in the rectangle set intersecting the dividing line segment is inefficient, and the search is advanced in the tree structure in the x direction. The search range of is gradually reduced to 1/2,
In the worst case, the range of the search in the y direction must search all the nodes that intersect the search area 30, and in this case, there is a drawback that a processing time proportional to the number of rectangles is required. In this way, the figure search by the quadtree is unsuitable for high-speed proximity figure search, and as described above, even in the figure search of a partial data set, it always refers to a useless figure that does not become a search solution. Therefore, there is a drawback that the processing time becomes very long.

[0015]

SUMMARY OF THE INVENTION In order to solve the above-mentioned problems, an object of the present invention is to select in advance the data to be searched when a specific partial data set in the database is continuously searched. By doing so, it is an object of the present invention to provide a high-speed data retrieval apparatus and method capable of omitting useless figure references and capable of retrieving a large amount of data.

Another object of the present invention is to store a pointer to a data set which is a search target when a specific data search is continuously executed a plurality of times so that the next search target data is the data. It is an object of the present invention to provide a high-speed data search device and method capable of executing a search for them when they are included in a set.

Still another object of the present invention is to provide a novel figure searching method which overcomes the drawbacks of the figure searching by the conventional quadtree structure, and to provide a high speed data search apparatus by the method.

Still another object of the present invention is VLSI or U.
It is an object of the present invention to provide an inexpensive high-speed data retrieval device and method, which requires a small memory capacity for ultra-large-capacity graphic information such as LSI pattern layout.

[0019]

In order to achieve the above object, the present invention comprises a search range determining section (B12), a search range storing register (B14), a search processing section (B15),
The search range determining unit includes at least a data storage memory (B13) and an input / output interface (B11), and a search range determining unit selects a specific part of the data set to obtain a search range address. A high-speed data search device is characterized in that an address is stored in a search range storage register and a search for a data set is performed using the search range address pointed to by the search range storage register. Here, the search range determination unit and the search range storage register are connected to each other, and the search range storage register and the search processing unit are connected to each other. Further, the search range determination unit, the search range storage register, and the search processing unit are each connected to a data storage memory. The input / output interface is connected to the search range determination unit and the search processing unit, respectively.

Further, the high-speed data search device of the present invention further comprises a search range comparison processing unit (B16), and when the search is executed a plurality of times in succession, the search range storage register used in the previous search. It is characterized in that the search range comparison processing unit performs comparison with the search range address stored in.

Further, the high-speed data search device of the present invention further connects the register file (B17) directly to the search range comparison processing section (B16), and independently holds two or more search range addresses in this register file. It is characterized by being able to.

Further, according to the present invention, the first step (S14, S17) of inputting the search range and the data to be searched and the second step (S15) of determining the search range address in the database using this search range. ), A third step (S16) of storing the search range address of the database determined in the second step, and a fourth step (S18) of searching data for the search range address in the database. , And a fifth step (S19) of outputting the retrieval result of the fourth step, which is a high-speed data retrieval method.

Further, according to the present invention, it is judged whether the search range address in the database at the time of the previous search stored in the third step is applicable or not (S21), and if applicable, the database at the time of the previous search. The high-speed data search method is characterized in that the internal search range address is set as the search target (S22), and if not applicable, the internal search range address is updated (S23).

Further, according to the present invention, a high speed for storing the search range address in the database which includes all the data to be searched in the fourth step and corresponds to the node farthest from the root when the database is tree-structured It is characterized by a data search method.

Further, the tree structure of the database in the high-speed data retrieval method of the present invention is as follows: (a) A rectangular area including a rectangular set is divided into vertical and horizontal division line segments, and a rectangle intersecting the division line segments is used. Dividing into a set and a set of rectangles located on the left or below the dividing line and a set of rectangles located on the right or above the dividing line to construct a binary tree structure and store it in a storage area; External tree structuring that recursively performs the partitioning process on the rectangle set located on the left or bottom, or on the right or top of the dividing line segment, and (b) on the right side of the rectangle set that intersects the dividing line segment. Alternatively, the step of taking out one rectangle with the maximum coordinate value of the upper side and dividing the remaining rectangle set into two based on the coordinate value of the lower side or the left side to construct a binary tree structure and storing it in the storage area, Take one rectangle with the smallest coordinate value However, a step of dividing the remaining set of rectangles into two based on the coordinate values of the lower side or the left side to build a binary tree structure and storing it in the storage area, and taking out one rectangle with the maximum coordinate value of the right side or the upper side The step of dividing the rectangle set into two based on the coordinate value of the upper side or the right side to build a binary tree structure and storing it in the storage area, and taking out one rectangle with the minimum coordinate value of the left side or the lower side and extracting the remaining rectangle set. It is characterized in that it comprises internal tree structuring in which the steps of constructing a binary tree structure by dividing it into two parts based on the coordinate values of the upper side or the right side and storing them in a storage area are sequentially and recursively executed.

[0026]

According to the present invention, when the data stored in the database is searched for, when a search for a specific partial data set in the data is continuously executed a plurality of times, the minimum data to be searched is searched in advance. The range determination unit refers to the data storage memory and selects it, stores the selected in-database search address in the search range storage register, and executes the data search in the search processing unit using the stored search range address. To do. Therefore, it is not necessary to search the entire database including a useless part, and an efficient search can be performed in a short time. That is, the normal data search is started from the root of the tree structure database, but the search of the present invention has a search range storage register so that the search can be performed from the end node of the tree structure. Configure and
The end node is stored in this register as a search range address, and a search is performed using this stored search range address.

Further, according to the present invention, the node for starting the data search is stored in the search range storage register or the register file as the search range address, and the pointer to the minimum data set to be searched is always held. When a plurality of data searches are consecutive, the held pointer is used to perform the search. That is, when the previous search range address can be continuously used as the search target data by the judgment of the search range comparison processing unit, the search is immediately performed on them so that the search is executed at extremely high speed and high efficiency. If the previous search range address cannot be used, the search is started from the root of the tree structure of the database, the new search range address is stored, and the address data of the search range storage register or register file is updated.
Prepare for subsequent searches.

Further, according to the present invention, a dedicated register file is directly connected to the search range comparison processing unit so as to hold a plurality of independent search range addresses, for wiring processing on a VLSI chip having a complicated sequence. Perform such figure search at high speed and high efficiency.

Further, the present invention can be applied to the data search using various tree structures, but in particular, the external tree structure binary tree and the internal tree structure binary tree (the external tree structure and the internal tree structure are described in the fourth embodiment). (Described in detail) by using a novel structured data search using a two-stage binary tree,
Conventionally, a more efficient graphic search is performed than a search using a quadtree structure that is generally used. In other words, instead of a figure search using a data structure that uses two line segments that intersect in a cross as a dividing line segment, such as a quadtree structure data search, a figure search using a data structure that uses one line segment as a dividing line segment is performed. By doing so, efficient and high-speed data retrieval is performed. The search range and search data are input, and the search results are output via the input / output interface.

[0030]

EXAMPLE A database apparatus according to the present invention will be described below with reference to VL.
An embodiment when applied to the SI layout will be described with reference to FIGS. The data search in this case is specifically a graphic search on the VLSI chip, but for simplification, a case where a plurality of rectangular data 12 exist on the chip 11 will be described. First, the case where the rectangular data is distributed and stored in each node of the quadtree and stored and managed will be described. However, as will be described later, it is faster and more desirable to use the new binary tree structure. Of course.

When storing data in the form of a quadtree, normal data retrieval starts at the most root node of the tree structure.
If it is known that the data stored at the root node cannot be the solution of the search and is stored after the end node of the tree structure, do not start the data search from the root, By starting from the end nodes as much as possible,
The number of search targets is reduced, and the processing time can be shortened. Two
Even in the case of the branch tree structure, the processing time can be further shortened by starting from the end node as much as possible. In other words, the data stored in the end direction of the tree structure from the node that starts the data search becomes the search range in the database. It can be said that the determination of the search range address in the database is to determine the node that starts the data search. The concrete storage method of rectangular data is
This is the same as the description of the conventional example.

First Embodiment FIGS. 1 to 5 show a first embodiment of the present invention. FIG. 1 is a block diagram of a database device used in the first embodiment of the present invention. In FIG. 1, B11 is a data input / output interface with the outside of the database, B12 is a search range determining unit in the database, B13 is a memory for storing data, and B is a memory.
14 is a register for storing the search range in the database, B15
Is a data search processing unit. Examples of the memory (storage device) of B13 include a RAM and a magnetic disk.

When the data search range is first input to the data input / output interface B11, it is transferred to the in-database search range determination unit B12. The search range deciding unit B12 is a data search range and data storage device B1.
3, the search range address in the database is determined and stored in the search range storage register B14.

Next, the data search request input to the input / output interface B11 is transferred to the data search processing section B15. The search processing unit B15 performs a data search from the address data included in the in-database search range address pointed to by the search range storage register B14 in the data storage device B13, and obtains the obtained solution as the input / output interface B.
Return to 11. The input / output interface B11 receives it and outputs the search result to the outside of the database. The above search processing is repeated a plurality of times. A specific search process will be described with reference to FIGS.

FIG. 2 is a flow chart showing the processing procedure of the first embodiment of the present invention. In FIG. 2, the input of the searched data (step S17) and the output of the search result (step S19) are the same as the processing procedure by the conventional method, but other than that, the input of the search range (step S1).
4), the determination of the search range in the database (step S15), the storage of the search range in the database in the register (step S16), and the data search for the data in the designated search range (step S18) are conventionally performed. Unlike the method, it is a feature of the method according to the present invention.

In the first embodiment of the present invention, a register is provided in the quadtree that points to the node at which the data search is to be started, and the search is always started from the node pointed to by that register, and is directed toward the end of the tree structure. Proceed with the search. Before designating a search range, that is, a rectangular area that occupies a part of the chip, the register points to the node A that is the root of the quadtree. Below,
A first embodiment will be described with reference to FIGS.

First, the rectangular area 13 of FIG. 3 is designated as the search range (step S14). Next, the rectangular data stored in the node A is referred to, and it is confirmed whether or not these intersect with the rectangular area 13. In the example of FIG. 3, the rectangular data {R2, R6, R7, R8, R stored in the node A is used.
9 and R10} do not intersect the rectangular area 13. That is, this indicates that it is not necessary to refer to the rectangular data stored in the node A in future data retrieval.

Next, among the four nodes of the child of the node A of the quadtree structure of FIG. 3, the nodes other than the node D including the rectangular area 13 are irrelevant to the retrieval, and therefore the rectangular data stored in the node D. See R12. Since this rectangular data R12 intersects the rectangular area 13, it can be a solution for a later search. Therefore, it is understood that it is sufficient to skip the node A in the quadtree structure and start from the node D in the subsequent data search, so that the search range address in the database is determined (step S15), and the node to start the data search is selected. The indicated register points the node D and stores the search range address in the database (step S16).

As described above, first, among the rectangular data in the tree structure, a node that includes one that intersects the rectangular area 13 of the search range specified in step S14 is obtained (however, a certain node intersects the rectangular area 13). If it is found that there is rectangular data that does not have to be searched, it is not necessary to search for the nodes in the end direction after that), then find the node farthest from the root of the tree structure including all these nodes, and register for search range storage. B1
By storing in No. 4, it is possible to obtain the node that starts the desired data search. The method of the present invention is not limited to the quadtree structure, but the tree structure (k
-D tree etc.)

4 and 5 show the retrieval operation after the retrieval range is stored in the register in step S16 in the first embodiment of the present invention. FIG. 4 shows a case where the search is performed leftward from the point S (step S17) and the rectangular data R11 is obtained as a solution. At this time, the search starts from the node D indicated by the arrow 14 in the quadtree diagram (step S18), reaches the node F, obtains the search result (step S19), and ends (see the chain line in FIG. 4). reference). There are two pieces of rectangular data referred to during the search, {R11, R12}.

In FIG. 5, the point T is input, the search is performed downward from the point T (step S17), and the rectangular data R11 is obtained as a solution. Also in this case, the search is started from the node D indicated by the arrow in FIG. 14 (step S18) to the node F, and the search result is obtained (step S1).
9) Completed (see the dashed line in FIG. 5). There are two pieces of rectangular data referred to during the search, {R11, R12}. Thus, the rectangular data {R1, R2, ... R1
2} In the case of 12 simple cases, in the conventional example, a solution cannot be obtained without referring to at least 7 to 8 pieces of rectangular data in each search, but in the search method of the present invention, the search range in the database is determined. After that, the number of rectangular data to be referred to in each search is only two at maximum. This difference becomes more remarkable as the number of rectangular data that intersects the rectangular area 13 decreases, the total number of data as a database increases, and the number of searches increases.

Second Embodiment Next, a second embodiment of the present invention will be described with reference to FIGS. FIG. 6 is a block diagram of a database device used in the second embodiment of the present invention. In the figure, B11
Is a data input / output interface with the outside of the database,
B12 is a database search range determination unit, B13 is a data storage memory, B14 is a database search range storage register, B15 is a data search processing unit, and B16.
Is a search range comparison processing unit. Examples of the memory (storage device) of B13 include a RAM and a magnetic disk.

Immediately after starting the database device, the in-database search range storage register B14 indicates the entire database. When the data search request and the search range are specified in the data input / output interface B11, they are transferred to the search range comparison processing unit B16. In B16, B
It is confirmed whether or not the search range from 11 is included in the range indicated by the in-database search range storage register B14. If not included, the processing moves to the in-database search range determining unit B12, determines the in-database search range address from the data search range and the contents of the data storage device B13, and stores it in the data search processing unit B14. After that, the processing moves to B15, and the solution obtained after the search is output to the outside via B11. If included, the search request is transferred from B16 to the data search processing unit B15, and the solution obtained after the search is output to the outside via B11. The above search processing is repeated a plurality of times.

FIG. 7 is a flow chart showing the processing procedure of the second embodiment of the present invention. In FIG. 7, the output of the search result (step S25) is the same as the processing procedure according to the conventional method, but other than that, the input of the search range and the searched data (step S20) and the previous search range can be applied. Whether it is applicable or not is determined (step S21), and if applicable, the previous search range is determined as the search range (step S2
2) The features of the method according to the present invention are different from the conventional method in the processing of updating and storing the search range in the database when the previous search range cannot be applied (step S23) and the data search in the search range (step S24). Is. As in the first embodiment, a register is provided in the quadtree that points to the node that starts the data search, and the node that started the data search at each search is saved.

First, the in-database search range is obtained from the search range specified in the first data search. That is, the node at which the data search should be started is obtained, stored in the register, and then the data search is performed (steps S20, S21, S2).
3, S24, S25). In the second and subsequent data searches,
First, it is confirmed whether the specified search range is included in the search range stored in the register (step S2).
0, S21), if it is included, the search is started from the node pointed to by the register (step S22). If not, a node matching the new search range is obtained and stored in the register (step S23), and then data search is performed. (Step S
24) The result is output (step S25). Therefore, it is a suitable method when similar data retrievals are continuously executed a plurality of times.

The first search will be described with reference to FIG. In FIG. 8, the point S and the search range are specified in the rectangular area 13,
A search is performed leftward from the point S (step S17). Since this is the first search, the search range in the database is first determined (step S21). Since the data search may be started from the node D in the tree structure, this is stored in the register (step S23). The search starts from node D, rectangular data R11 is obtained, and the search ends (steps S24 and S2).
5).

Next, referring to FIG. 9, the second search will be described. In this case, the search range is specified in the rectangular area 13, and the search is performed downward from the point T (step S20). Since the current search range is the same as the previous search range (step S21), the previous database search range can be applied (step 2).
2). The search is started from the node D of the tree structure and the rectangular data R1
When 1 is obtained, the search ends (steps S24 and S25).

In the conventional example, a solution cannot be obtained without referring to at least 7 to 8 pieces of rectangular data in each search of a set of 12 rectangles, but in the search method of the present invention, after the search range in the database is determined. The maximum number of pieces of rectangular data referred to in each search is only two. This difference becomes more significant as the number of rectangles intersecting the rectangular area 13 decreases, the number of rectangles in the entire database such as VLSI pattern layout increases, or the number of searches increases.

Third Embodiment A third embodiment of the present invention will be described with reference to FIGS. In the third embodiment, high-speed data search is performed by independently storing and holding two or more search ranges in the database. FIG. 10 shows a block diagram of a database device used in the third embodiment. The database device of the second embodiment shown in FIG. 6 has a structure in which a dedicated register file B17 is provided in the search range comparison processing unit. Has become. The number n of registers in the register file B17 may be selected according to the number of search ranges in the database that are independently held. In the following description, the case of n = 2 will be described, but it goes without saying that n ≧ 3 or n = 1. In FIG. 10, devices having the same reference numerals as those in FIG. 6 mean the same devices. The flowchart in the third embodiment may be the same as that shown in FIG. 7 used in the description of the second embodiment, except that it will be stored in either the first or second register of the register file B17 in step S23. different.

First, the in-database search range is obtained from the search range specified in the first data search. That is, the node that should start the data search is found, and the register file B1
No. 7 first register and search range storage register B14
The first data search is performed after it is stored in (step S2).
0, S21, S23, S24, S25).

It is confirmed whether or not the search range designated by the next data search (the second and subsequent data searches) is included in the search ranges stored in the first and second registers (steps S20 and S21). If so, the search is started from the node pointed to by the first or second register (step S
22), otherwise, find a node that matches the new search range, store it in the register with the longest unupdated time (step S23), then perform data search (step S24) and output the result (step S24). S25).

Description will be made with reference to FIGS. 14 in the figure
The arrow indicated by indicates which node the first and second registers point to. In FIG. 11, the point S is input, the search range is specified in the rectangular area 13, and the search is performed from the point S to the left (step S20). Since it is the first search, the search range in the database is first determined (step S2).
1). Since the data search may be started from the node D of the quadtree, it is stored in the first register and the search range storage register (step S23). The search starts from node D, rectangular data R11 is obtained, and the search ends (step S
24, S25).

Next, referring to FIG. 12, the second data search will be described. In this case, the rectangular area 13 which is the search range is not moved, and the search is performed downward from the point T (step S20). Since the current search range is the same as the previous search range (step S21), the previous database search range can be applied (step S22). The search is started from the node D, the rectangular data R11 is obtained, and the search is ended (steps S24 and S2).
5).

Next, FIG. 13 shows the third data search. The rectangular area 13 serving as the search range is moved to search upward from the point U (step S20). Since the third search range is different from the content indicated by the first register (step S21), the search is started from the node A and the node E is obtained as a new search range, which is stored in the first register and the search range storage register. Remember. Prior to this, the node D stored in the first register is stored in the second register. That is, the newer search range is stored in the register with the smaller number (step S23). Rectangle data R4
Is obtained and the search ends (steps S24, S25).

In FIG. 14, which is the fourth data search, the rectangular area 13 which is the search range is the same as the third time, and the search is performed from the point V to the right (step S20).
Since the fourth search range matches the content indicated by the first register (step S21), the search is started from the node E pointed to by the first register (step S22), and the rectangular data R
4 is obtained and the search ends (steps S24 and S25).

Next, in FIG. 15, which is the fifth search, the rectangular area 13 which is the search range is moved again, and the search is performed from the point W to the right (step S20). Since the current search range matches the contents of the second register (step S21), the search is started from the node D, the node E stored in the first register is stored in the second register, and the node D is stored in the second register. The data is stored in the 1 register (step S23). The rectangular data R11 is obtained and the search ends (steps S24 and S2).
5).

As described above, according to the conventional method, the solution cannot be obtained without always referring to at least 7 to 8 pieces of rectangular data in each search, but in the search method of the present invention, the search range in the database is limited. After the determination, the number of pieces of rectangular data referred to in each search is only three at maximum. This difference becomes more remarkable as the number of rectangular data intersecting the rectangular area 13 decreases, the total number of rectangles in the entire database increases, and the number of searches increases.

Fourth Embodiment Next, a fourth embodiment of the present invention will be described with reference to FIGS. Although the first to third embodiments of the present invention have been described by using the search by the quadtree structure, the present invention is not limited to the database processing by the quadtree structure as described above. It is also applicable to tree structure search. The fourth embodiment of the present invention describes a high-speed database processing that can further exhibit the characteristics of the present invention by using a novel tree structure search. Therefore, the fourth embodiment of the present invention can be realized using any of the database devices of FIGS. 1, 6 and 10 described in the first to third embodiments. Since the tree structure search processing used in the fourth embodiment is a novel one in which the structuring method itself is structured by using a binary tree, this graphic information processing method is first described with reference to FIG.
~ It demonstrates by FIG. Hereinafter, when simply described as “binary tree”, it means a novel binary tree structure according to the present invention.

It is assumed that a plurality of rectangles {r2 to r17} are present in the rectangular area 11 showing the semiconductor chip of FIG. 16 (a). The actual VLSI layout is much more complicated but will be simplified. FIG. 16 shows a structuring process when these rectangles are stored and managed by the graphic information processing method according to the fourth embodiment of the present invention, and a tree structure after structuring. In the fourth embodiment of the present invention, a figure is divided into two stages.
Structure using a branch tree. Each of these binary trees is external 2
It is called a branch tree or an external tree structure and an internal binary tree or an internal tree structure. While the number of external tree structures is 1, there are multiple internal tree structures, and one node is included in each node of the external tree structure. In FIG. 16, (b) is an external tree structure, (c),
(d) and (e) represent the internal tree structure. (c), (d), and (e) are included in the nodes with the same symbols in (b). However, in FIG. 16, when the number of rectangles included in the node of the external tree structure is 1, the description of the internal tree structure diagram included therein is omitted. As described above, in the graphic information processing system according to the fourth embodiment of the present invention, the structuring process of the graphic differs between the external tree structure and the internal tree structure.

In FIG. 16, a set of rectangles {r2-r1
7} is divided by dividing line segments B1 to B7 to create an external tree structure, and an internal tree structure is created for a rectangular set intersecting each dividing line segment. FIG. 17 is a flowchart of the process of creating the external tree structure, and FIGS. 18 to 20 are diagrams showing the state. In addition, FIG. 21 is a flowchart of the process of creating the internal tree structure, and FIGS. 22 and 23 are diagrams showing the state. As shown in FIG. 17, the process (B _eh , B _ev ) for creating the external tree structure is divided by the direction (vertical or horizontal) of the dividing line segment.

The process (B _eh ) using the vertical dividing line segment is a process of checking whether or not the figure to be processed remains (step 101), a vertical dividing line segment is generated, and a rectangle intersecting the dividing line segment is generated. A process of dividing the rectangular set into a set C, a rectangular set A located to the left of the dividing line segment, and a rectangular set B located to the right of the dividing line segment (the difference in the number of rectangles included in the rectangular set A and B at this time is The process is divided so that it is at most 1 (step 102), the process B _ev is applied to the rectangular sets A and B to recursively form an external tree structure (step 103), and the process B _iv is applied to the rectangular set C. By recursively creating an internal tree structure (step 104).

The process using the horizontal dividing line segment (B _ev ) is a process of checking whether or not the figure to be processed remains (step 105), generating a horizontal dividing line segment, and a rectangle intersecting with the dividing line segment. A process of dividing the rectangular set into a set C, a rectangular set A located below the dividing line segment, and a rectangular set B located above the dividing line segment (at this time, the difference in the number of rectangles included in the rectangular set A and B is The process is divided so that it is at most 1 (step 106), the process B _eh is applied to the rectangle sets A and B to recursively create an external tree structure (step 107), and the process B _ih is applied to the rectangle set C. By recursively creating an internal tree structure (step 108).

Further description will be made with reference to FIGS. First, make sure that there is a rectangle in 11 (step 10
1), in FIG. 18, a vertical dividing line segment B1 is generated in the rectangular area 11, and a rectangular set C {r2, r intersecting with B1 is generated.
3, r4, r5, r6, r7}, a rectangle set A {r8, r9, r10, r11, r12}, B located to the left of B1
Rectangle set B {r13, r14, r1 located to the right of 1
5, r16, r17} (the difference in the number of rectangles included in the rectangle sets A and B is 0) (step 102), and the process B _ev is applied to the rectangle sets A and B (step 10).
3) (described later), the process B _iv is applied to the rectangular set C (step 104) (described later).

Next, in step 103, the rectangle sets A and B are set.
The process B _ev applied to is described with reference to FIG.
Here, A of the rectangular sets A and B will be described as an example. The same processing as A is performed on the rectangular set B. First, it is confirmed that the rectangle set A includes one or more rectangles (step 105), and in FIG. 19, a horizontal dividing line segment B2 is generated in a region where A exists in the rectangular region 11, and a rectangle intersecting B2 is generated. It is divided into a set C {r10, r11}, a rectangular set A {r12} located below B2, and a rectangular set B {r8, r9} located above B2 (the number of rectangles included in the rectangular sets A and B). Is 1) (step 106), the process B _eh is applied to the rectangle sets A and B (step 107),
The process B _ih is applied to the rectangle set C (step 10).
8) (described later).

FIG. 20 shows how the above process (B _ev ) is executed for the rectangular set B of FIG. An external tree structure is created by recursively performing the above processing.

Next, the process of creating the internal tree structure will be described. FIG. 21 is a flowchart of a process for creating an internal tree structure, and FIGS. 22 and 23 are diagrams showing the situation. The process of creating the internal tree structure is divided by the direction (vertical or horizontal) of the dividing line segment when the external tree structure is created. Here, processing when the dividing line segment is in the vertical direction (B _{iv1 to} B _iv4 ).
Will be described as an example. The processing (B _{ih1 to} B _ih4 ) when the dividing line segment is in the horizontal direction may be considered by exchanging x and y of B _{iv1 to} B _iv4 . As shown in FIG. 21, there are four types of internal tree structure processing when the dividing line segment is in the vertical direction.

In any of the processes, it is confirmed whether there is a rectangle to be processed (steps 109, 113,
117, 121) first, and then the rectangle with the smallest x ₁ is extracted from the set of rectangles (steps 114, 12).
2) or the rectangle with the largest x ₂ is extracted (steps 110 and 118). Next, the remaining rectangle sets are sorted by y ₁ (steps 111 and 115) or y ₂ (steps 119 and 123). Where x ₁ , x
₂ , y ₁ and y ₂ are the coordinate values of the rectangle shown in FIG. Next, the sorted rectangle set is divided into two rectangle sets, the first half and the second half. At this time, the rectangles whose sorting keys have the same value are not divided into two sets. Finally 2
The above process is recursively executed for each of the two rectangle sets (process B
_{After ivn} , processing B _{iv (n + 1)} is performed (n is a natural number of 1 to 4, n (= 4) + 1 → 1). An internal tree structure is created by executing the above processing.

22 and 23, an internal tree structure is created for a rectangular set C intersecting B1 in FIG. 18 (FIG. 17).
Step 104) of FIG. First, it is confirmed that there is at least one rectangle in the rectangle set C (step 10
9), a rectangle r4 having the maximum x ₂ is taken out and set as a parent node (P in FIG. 22) (step 110), and the remaining rectangle set {r2, r3, r5, r6, r7} is coordinate value y of the lower side.
After sorting by the value of ₁ , it is divided into two in that order, and the rectangle set D
Obtain {r6, r7} and E {r2, r3, r5} (step 111). Next, the process B _iv2 is applied to the rectangle sets D and E to make it a child node of P.

Next, referring to FIG. 23, a set of rectangles E {r2, r
The processing procedure when the processing B _iv2 is applied to 3, r5} will be described. The same processing as E is executed for the rectangular set D. First, it is confirmed that there are one or more rectangles in the rectangle set E (step 113), the rectangle r2 having the smallest coordinate value x _{1 on the} left side is taken out, and is set as a parent node (P in FIG. 23) (step 114). The rectangular set {r3, r5} of is sorted by the value of the coordinate value y ₁ of the lower side, and then divided into two in that order,
Obtain new rectangle sets D {r5} and E {r3} (step 115). Similarly, the processing B _{iv3 and the} subsequent _steps are recursively applied to the new rectangle sets D and E to create an internal tree structure.

Next, the processing of the fourth embodiment of the present invention in the case of performing a near figure search on a rectangular set structured by the above method will be described. FIG. 24 is a diagram showing how a neighboring figure is searched for a rectangular set in the rectangular area 11 and how a tree structure is searched. 25 and 26 are flowcharts of a process of performing a proximity figure search in the external tree structure, and FIGS. 27 to 30 are flowcharts of a process of performing a proximity figure search in the internal tree structure. As shown in FIGS. 25 and 26, a process (S _eh ,
S _ev ) is divided according to the direction of the dividing line segment (vertical or horizontal) and the direction of the near figure search (upper, lower, left and right).

FIG. 25 shows the process S _{ehUP of the} near-graphic search in the external tree structure when the dividing line segment is vertical and the direction of the near-graphic search is upward.
As shown in step _S165 , a process for checking whether or not there is a figure to be processed remains (step 165), and the neighboring figure search process S _ivUP is applied to the rectangular set C to obtain a solution R ₀ (step 16).
6), branching into three ways depending on the positional relationship between the search area and the dividing line segment (step 167), and recursively closes the figure search process S for either or both of the rectangular areas A and B.
_evUP is applied to obtain the solution R ₁ (steps 168, 169, ₁
70), R ₀ , R ₁ whichever is closer is the solution (step 171). Here, S _ivUP is a proximity figure search process in the internal tree structure when the dividing line segment is vertical and the search direction is upward, and S _evUP is in the external tree structure when the dividing line segment is horizontal and the search direction is upward. It represents a near figure search process. Similarly S
_ihUP is a search process for adjacent figures in the internal tree structure when the dividing line segment is horizontal and the search direction is upward. 26 S
_27-30 of evUP show the flowchart of _SivUP . As shown in FIG. 26, the process S _evUP is a process for confirming whether or not the figure to be processed remains (step 17).
2), the process S _ihUP is applied to the rectangle set C to obtain the solution R ₀ (step 173), and if the search area is on the dividing line segment, the process _proceeds to step 178, and if not, the step 175.
(Step 174) and recursively applies the processing S _ehUP to the rectangular area A to obtain the solution R ₁ (step 17).
5), the closer _one of R ₀ and R ₁ is set as a new solution R ₀ (step 176). If R ₀ is above the dividing line segment, the process branches to step 178, and if not, to step 179. (Step 177) Let R ₀ be the solution (Step 17
9), the process S _ehUP is recursively applied to the rectangular area B to obtain a solution R ₁ (step 178), and the closer _one of R ₀ and R ₁ is taken as the solution (step 180).

Further description will be made with reference to FIG. Since the dividing line segment B1 is vertical, the process S _ehUP is applied first. First, it is confirmed that there is a rectangle in the VLSI chip 11 (step 165), and a rectangle set C {r2, r3, r4, r5 is set.
The internal tree structure proximity figure search process S _ivUP is applied to r6, r7} to obtain “no solution” (step 166) (this process S _ivUP will be described later). Next, since the search area is located to the right of the dividing line segment B1, the process branches to step 170 (step 167), and the rectangular set B {r13, r14, r15,
Recursive search processing S _{ev UP} in the external tree structure is applied to r16, r17} (step 170). The process to which this process S _evUP is applied first _confirms that the given rectangle set B includes one or more rectangles (step 17
2), a solution r15 is obtained by applying a search process S _{ih UP} in the internal tree structure to the rectangular set C {r15} that intersects the dividing line segment B3.
Is obtained (step 173). Next, the search area is the dividing line segment B
Since it is not located above 3, the process branches to step 175 (step 174), and recursively applies the external tree structure adjacent figure search process S _ehUP to the rectangular set A {r16, r17} to obtain the solution r17 ( Step 175). r15 and r17
And r17 is set as a new solution R ₀ (step 1
76). Since R ₀ is located under the dividing line segment B3, the process branches to step 179 (step 177), and R ₀ = R17 is set as the final solution. By performing the above processing recursively, it is possible to realize the proximity figure search in the external tree structure.

Next, the search for adjacent figures in the internal tree structure will be described. The processing of the fourth embodiment of the present invention for performing a proximity figure search in the internal tree structure is performed in the direction (vertical or horizontal) of the dividing line segment when the external tree structure is created and in the direction of the proximity figure search (vertical direction). It is divided. Here, the processing when the dividing line segment is in the vertical direction and the direction of the near figure search is upward (S _iv1UP ~
S _iv4UP ) will be described as an example (FIGS. 27 to 30). When the dividing line segment is in the vertical direction and the direction of the proximity graphic search is upward, there are four types of proximity graphic search processing in the internal tree structure as shown in FIGS. In both processes, a process of checking whether there is a rectangle to be processed (steps 181, 19)
0, 199, 208) first, and then the search area to the left of the coordinate value x ₁ of the left side of the rectangle of the parent node (step 19
1, 209) or the coordinate value x ₂ on the right side (step 182, 200) depending on whether or not it is branched in two directions, and it is confirmed whether the search area and the parent node rectangle intersect (step 183). , 192, 20
₁ , 210), and if it intersects, the rectangle of the parent node is set to R ₀ (steps 184, 193, 202, 211), and the search area is sorted by the value of the coordinate value y ₁ of the lower side and divided into two rectangle sets D, A process of branching in two directions depending on whether it is below (steps 185, 194) or above (steps 203, 212) the boundary of E, rectangle set E (step 1
86, 195) or D (steps 204, 213)
A recursively executed (process S _IvUPn the next processing _S ivUP _{(n + 1)} the processing for the (n is a natural number of 1 to 4, n
(= 4) + 1 → 1)) Obtain a solution R ₁ . The closer _one of R ₀ and R ₁ is set as a new solution R ₀ (steps 187, 19).
6, 205, 214), rectangle set D (step 188,
197) or E (steps 206 and 215), the above processing is performed to step 186 (or 195 and 20).
4, 213) and recursively execute it to obtain a solution R ₁ .
This is a process in which the closer _one of R ₀ and R ₁ is the final solution (steps 189, 198, 207, 216).

Further description will be made with reference to FIG. Since the first dividing line segment B1 is vertical, the processing S _{eh UP} is first applied (step 166 in FIG. 25), and the rectangle set C {r2, r
The processing S _ivUP1 is applied to 3, r4, r5, r6, r7}. First, it is confirmed that the given rectangle set C includes one or more rectangles (step 181). Next, since the search area is located to the right of the coordinate value x ₂ on the right side of the rectangle r4 of the parent node, it is immediately known that there is no solution in the rectangle set C (step 182), and the processing S _ivUP is _executed . It ends. This is the explanation of the step 166 for obtaining the above-mentioned "no solution".

As described above, when the graphic information processing method based on the binary tree structure is used, the dividing line segments intersect in a cross shape.
Since it is not a line segment in a book, a neighborhood figure search for a set of rectangles intersecting with it (that is, an internal tree structure) can be performed efficiently, and when there is no solution in the internal tree structure, it is almost always the most Since it can be found by referring to only one rectangle of the parent node, it is possible to execute the proximity figure search at high speed. Therefore, by applying the graphic search using the binary tree structure to the first to third embodiments of the present invention, a higher speed data search apparatus is realized. In the fourth embodiment of the present invention, a register is provided in the binary tree structure to indicate the node at which data search is started,
By always starting the search from that node, that is, searching from the node far from the root of the binary tree structure as much as possible, a high-speed graphic search can be performed with a small memory usage. For example, in FIG. 24, if the rectangular area 13 is designated as the search range, if the external tree structure adjacent figure search processing S _ehUP is applied to the rectangular set {r16, r17} by using the dividing line segment B ₆ , the solution is immediately obtained. 17 is obtained. Since the binary tree structure data search is fast, it is also effective when searching from a node relatively close to the root of the tree structure. In particular, if the search is continued and the previous search range is not applicable, it is necessary to start the search from the root node of the tree structure to find a new search range node. At this time, the binary tree structure data search Is effective because it is extremely fast. Further, even when the searches are not continuous, that is, when the register for storing the address of the data set to be searched cannot be used, the database device is extremely effective and has a wide range of versatility.

[0076]

As described above in detail with reference to the embodiments, the high-speed data search apparatus and method according to the present invention do not search all data but a minimum search target in advance. Since the data is selected and the search can be executed only for them, unnecessary reference to the data is omitted, and it is possible to search for graphic information in an extremely short time.

According to the present invention, only a minimum amount of data needs to be searched. Therefore, even if the entire database has a very large amount of data, the amount of storage area used in the database device can be small and high-speed search can be performed. Is possible.

Furthermore, according to the present invention, it is sufficient to perform a search only in a direction toward the end from a specific node of the tree structure of the database, and since the specific node can be stored, data search can be continued. When it is executed a plurality of times, extremely efficient high speed data retrieval becomes possible.

Further, according to the present invention, since it can be applied to data retrieval having various tree structures such as a quadtree structure and a binary tree structure, it is extremely versatile and has a relatively small memory capacity and a large capacity. Since data can be searched for, an inexpensive database device can be provided. In particular, when searching from the root of the tree structure to find the new search start node in order to update the previous search range address, the binary tree structure reduces the time loss when updating the address. It operates at high speed as a whole.

In the wiring processing in the semiconductor integrated circuit pattern layout for handling VLSI data and ULSI data, which is in the process of increasing in scale and has reached a step even in the era of 1 gigabit dRAM, it is a search target in each wiring net. Rectangular area (1 in Figure 4, 5, 8, 9 etc.)
The area of 3) is becoming smaller than the entire chip, and the number of data searches in the rectangular area 13 is also increasing. According to the present invention, it is particularly effective in a semiconductor integrated circuit manufacturing process or the like in which a very small part of the entire ultra-large-capacity rectangular data is repeatedly searched, and an extremely efficient high-speed search is possible. Become.

Further, according to the present invention, since a dedicated search range storage register or register file is prepared, the contents of the data storage memory can be changed without changing.
Since it is sufficient to determine and store the search range address and perform the data search process by this, there is an advantage that a program for operating the device can be easily created.

[Brief description of drawings]

FIG. 1 is a block diagram of a high-speed data search device according to a first embodiment of the present invention.

FIG. 2 is a flow chart of the first embodiment of the present invention.

FIG. 3 is an example of determining a search range in a database according to the first embodiment of the present invention.

FIG. 4 is an example of data search in the first embodiment of the present invention.

FIG. 5 is an example of data search in the first embodiment of the present invention.

FIG. 6 is a block diagram of a high-speed data search device according to a second embodiment of the present invention.

FIG. 7 is a flow chart of a second embodiment of the present invention.

FIG. 8 is an example of determination of a search range in a database and data search according to the second embodiment of the present invention.

FIG. 9 is an example of search range determination and data search in a database according to the second embodiment of the present invention.

FIG. 10 is a block diagram of a high-speed data search device according to a third embodiment of the present invention.

FIG. 11 is an example of determination of a search range in a database and data search in the third embodiment of the present invention.

FIG. 12 is an example of search range determination and data search in a database according to the third embodiment of the present invention.

FIG. 13 is an example of search range determination and data search in a database according to the third embodiment of the present invention.

FIG. 14 is an example of search range determination and data search in a database according to the third embodiment of the present invention.

FIG. 15 is an example of search range determination and data search in a database according to the third embodiment of the present invention.

FIG. 16 is an example of binary tree structuring of a rectangular set used in the fourth exemplary embodiment of the present invention.

FIG. 17 is a flowchart of external tree structuring in the fourth exemplary embodiment of the present invention.

FIG. 18 is an explanatory diagram of external tree structuring in the fourth exemplary embodiment of the present invention.

FIG. 19 is an explanatory diagram of external tree structuring in the fourth exemplary embodiment of the present invention.

FIG. 20 is an explanatory diagram of external tree structuring in the fourth exemplary embodiment of the present invention.

FIG. 21 is a flowchart of internal tree structuring in the fourth exemplary embodiment of the present invention.

FIG. 22 is an explanatory diagram of internal tree structuring in the fourth example of the present invention.

FIG. 23 is an explanatory diagram of internal tree structuring in the fourth example of the present invention.

FIG. 24 is an example of a proximity graphic search using the fourth embodiment of the present invention.

FIG. 25 is a flowchart of a proximity figure search (S _ehUP ) in an external tree structure according to the fourth embodiment of the present invention.

FIG. 26 is a flowchart of a proximity figure search (S _evUP ) in the external tree structure according to the fourth embodiment of the present invention.

FIG. 27 is a flowchart of a proximity figure search (S _ivUP1 ) in an internal tree structure in the fourth example of the present invention.

FIG. 28 is a flowchart of a proximity figure search (S _ivUP2 ) in an internal tree structure in the fourth example of the present invention.

FIG. 29 is a flowchart of a proximity figure search (S _ivUP3 ) in an internal tree structure in the fourth example of the present invention.

FIG. 30 is a flowchart of a proximity figure search (S _ivUP4 ) in an internal tree structure in the fourth example of the present invention.

FIG. 31 is a flowchart of a conventional data search.

FIG. 32 is an example of data search according to the related art.

FIG. 33 is an example of data search according to the related art.

FIG. 34 is an explanatory diagram of a proximity figure search.

FIG. 35 is an example of quadtree structure.

FIG. 36 is an example of a proximity figure search using a quadtree structure.

[Explanation of symbols]

11 rectangular area showing the entire VLSI chip 12 data in a rectangular area in which a path cannot be generated in VLSI wiring 13 data search range 14 register 30 pointing to a node for starting data search with line segment 31 30 serving as a base point of proximity graphic search as a base point A search area {A, B} targeted by the adjacent figure search is a rectangle set B1 to B7 divided into two by B1 to B3. A rectangle intersecting the dividing line segment {C} B1 to B3 in the structuring of the rectangle set according to the present invention. Set {D, E} of the rectangle set P divided into two by D1 and D2. A rectangle Q1 to Q5 in which x ₂ is the largest or x ₁ is the smallest in the rectangle set C. Cross shape in the structuring of the rectangle set by the quadtree. Dividing line segment {R1 to R12, r2 to r17} VLSI chip 11
Rectangle set existing in

Continuation of the front page (56) References JP-A-5-12355 (JP, A) JP-A-63-241633 (JP, A) JP-A-4-86950 (JP, A) Tatsuro Takahashi, "Information Retrieval", Toyo Keizai Shinposha, February 20, 1970, p. 70-76 Yu Osawa, 2 others, Geometric information processing environment with emphasis on spatial search, Technical Report of the Television Society of Japan, May 29, 1992, Vol. 16, No. 31, p. 13-18 Seiji Norimatsu, two others, comparative experiments and discussions on Quad Trees, Research Report of Information Processing Society of Japan 90-AL-17, September 29, 1990, Vol. 90, No. 79, p. 35-44 Naohito Kojima, Evaluation of New Data Structure Suitable for Wiring Program, IPSJ Research Report 94-DA-71, June 24, 1994, Vol. 94, No. 54, p. 7-14 (58) Fields surveyed (Int.Cl. ⁷ , DB name) G06F 17/30 G06F 17/50

Claims (7)

(57) [Claims] 1. A data storage memory for storing a data set, and a data search range and a detection range which are a part of the data set.
An input / output interface for inputting search target data defining a search direction from the outside and outputting a search result to the outside, and a specific part of the data set in the data set using the data search range A search range determining unit that obtains a search range address by selecting, a search range storage register that stores the search range address, and the search range address stored in the search range storage register as a reference. And a search processing unit for performing a plurality of searches for the data set. 2. When performing the search a plurality of times in succession, a new search range input from the outside corresponds to the search range address stored in the search range storage register used in the previous search. If the search range address is included in the search range address, the search range address stored in the search range storage register used in the previous search is used to store the data. When a set is searched, and the search range address is not included, a new search range address is determined from the new search range and the data set stored in the data storage memory, and the new search range address is determined. 2. The search of the data set is performed by updating the search range address stored in the search range storage register with an address, and the data set is searched. High-speed data retrieval apparatus. 3. The high-speed data search device, further comprising a register file directly connected to the search range comparison processing unit, wherein the register file independently holds two or more search range addresses. The described high-speed data retrieval device. 4. The input / output interface has a search range and
The step of inputting the search target data defining the search direction from the outside a plurality of times consecutively, and the search range determination unit using the input search range,
Selecting a specific part of the data set stored in a database from which the solution is searched and determining a search range address corresponding to the data search range; and the determined search range address In a register for storing a search range, and the search processing unit uses the stored search range address as a reference to continuously search the data set a plurality of times. A high-speed data search method characterized by the above. 5. In the step of performing a plurality of continuous searches, it is determined whether or not the search range address stored in the previous search is applicable to a new search range input from the outside. 5. The high-speed data search method according to claim 4, wherein if applicable, the search range address is set as a search target, and if not applicable, the search range address is updated. 6. The search range address including all the data to be searched and corresponding to a node farthest from a root when the database is tree-structured is stored. High-speed data retrieval method described in. 7. The tree structure of the database is as follows: (a) A rectangular area including a rectangular set is divided into vertical and horizontal dividing line segments, and a rectangular set intersecting the dividing line segment and a left dividing line segment are intersected. Alternatively, a step of dividing into three sets of a rectangle set located below and a rectangle set located to the right or above the dividing line segment to construct a binary tree structure and storing in a storage area, and a dividing line segment to the left or below , Or an external tree structuring including the step of recursively performing the division processing on a rectangle set located on the right or above, and (b) for the rectangle set intersecting the dividing line segment, The step of taking out one rectangle with the largest coordinate value and dividing the remaining rectangle set into two based on the coordinate value of the lower side or the left side to build a binary tree structure and storing it in the storage area, and the coordinate value of the left side or the lower side Takes out the smallest rectangle and sets the remaining rectangles Based on the coordinate value of the lower side or the left side, it is divided into two to build a binary tree structure and stored in the storage area, and one rectangle with the largest coordinate value of the right side or the upper side is taken out and the remaining rectangle set is the upper side or the right side. Based on the coordinate values of the two, construct a binary tree structure and store it in the storage area, and take out the rectangle with the smallest coordinate value on the left side or the lower side and set the remaining rectangle set to the coordinate value on the upper side or the right side. 7. The high-speed data retrieval according to claim 6, further comprising: an internal tree structuring in which the steps of constructing a binary tree structure by dividing into two based on the above and sequentially storing the same in a storage area are recursively executed. Method.