JP2586172B2 - Table search device with learning function - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an apparatus for performing a search on a table in a sequential organization format in which records are arranged in descending or ascending order. The present invention relates to a table search device with a learning function for efficiently using the table search.

[Conventional technology]

Conventionally, as a search method for this type of table,
The following two types are known.

(1) First method The table is read sequentially from the first record,
A sequential search method that determines a corresponding record by comparing with search key information related to a search request. The specific flow of the process is as shown in FIG.

(2) Second method The entire size of the table (the total number of records) is divided into two parts, the record information at the boundary is compared with the search key information, and the next search range is narrowed by the division according to the magnitude relation. And a two-part search method to determine the corresponding record. The specific flow of the process is as shown in FIG.

[Problems to be solved by the invention]

Conventionally, a table is searched by the above-described search method, but each has the following disadvantages.

In the first sequential search method, since the search is always started from the first record of the table, it takes a lot of time in a situation where records near the tail of the table are continuously searched.

The second two-partition search method eliminates the drawbacks of the first sequential search method, but the number of records in the table is two.
If it is not a power of, it is necessary to divide the odd-numbered records in one stage of the divide-by-two process, which complicates the process.

In both the first sequential search method and the second two-partition search method, the current search processing is performed independently of the past search processing, so that even in a situation where adjacent records are continuously searched. However, the search efficiency does not change from the case where records are randomly searched, and high-speed search cannot be performed.

The present invention has solved such a conventional drawback. The purpose of the present invention is to solve the problem that in a situation where adjacent records are continuously searched for, even if the location is near the tail of the table, the complicated An object of the present invention is to provide a table search device with a learning function capable of performing a search efficiently without performing processing.

[Means for solving the problem]

In order to achieve the above object, the present invention provides a table search apparatus for searching a table in which a plurality of records are arranged in descending order or ascending order, wherein learning data storage means for storing storage key information and storage record position information. And comparing the storage key information stored in the learning data storage unit in response to the search request with the search key information according to the current search request, and comparing the comparison result with the storage record stored in the learning data storage unit. Search range determining means for determining a search range based on the position information; records in the table within the search range determined by the search range determining means are sequentially read and compared with search key information according to the search request A sequential search means; and a learning data updating means for updating stored contents of the learning data storage means when the search by the sequential search means is successful. And it has a door.

Further, in a preferred embodiment of the present invention, when a plurality of records are arranged in ascending order in the table, the search range determining means determines whether the search key information relating to the current search request is smaller than the storage key information. The range from the beginning of the table to immediately before the position indicated by the stored record position information is determined as a search range. When the range is large, the range from immediately after the position indicated by the stored record position information to the tail of the table is searched for. If the search key information according to the current search request is smaller than the storage key information, the search range determining means starts the operation immediately after the position indicated by the storage record position information in the table. The range up to the tail of the table is determined as the search range, and when the range is large, the position indicated by the stored record position information from the top of the table To determine the search range the range of up to just before.

[Action]

In the table search device with learning function of the present invention, for example, when a record at a certain position in the table is searched by a search process based on the search key information according to the previous search request, the learning data storage unit stores the search key information and The position information of the record is stored as storage key information and storage record position information. When a new search request is input,
First, the search range determining means compares the storage key information stored in the learning data storage means with the search key information according to the current search request, and if they match, the record indicated by the storage record position information is the target record. Although the following search processing is omitted, if they do not match, the search range is determined based on the comparison result and the stored record position information stored in the learning data storage unit, and the search unit sequentially determines the search range. The records in the table within the specified search range are sequentially read and compared with the search key information according to the search request. When the search by the sequential search means is successful, the learning data updating means updates the storage key information and the storage record position information of the learning data storage means in accordance with the success.

〔Example〕

Next, embodiments of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a configuration diagram of one embodiment of the present invention. The table search device with learning function 1 according to this embodiment sets a table in which a plurality of fixed-length or variable-length records R1 to Rn are arranged in a predetermined order (descending order or ascending order) as a search target table 2 and responds to a search request. Leveraging the search target table 2 is performed,
This device notifies the request source of the search result, and includes a learning data storage unit 11, a search range determination unit 12, a sequential search unit 13, a learning data update unit 14, and a search result output unit 15. Each of the means 11 to 15 has the following functions.

Learning data storage means 11 Stores storage key information and storage record position information.

Search range determining means 12 Compares the storage key information stored in the learning data storage means 11 in response to the search request with the search key information according to the current search request, and if they match, the learning data storage means 11 Search result output means 15 for the stored record position information
To terminate the processing, and if they do not match, the magnitude relationship between the search key information and the storage key information and the learning data storage unit 11
A search range suitable for the current search request is determined based on the stored record position information stored in the search unit, and the search range is notified to the search unit 13 sequentially along with the search key information. In the initial state where no significant information is stored in the learning data storage unit 11, the entire range of the searched table 2 is determined as the search range.

• Sequential search means 13 Records within the search range determined by the search range determination means 12 are sequentially read from the searched table 2 and compared with the search key information according to the search request. Search result output means 15 for location information
, And the record position information and the search key information to the learning data updating means 14.

Learning data updating means 14 Updates the storage key information and the storage record position information stored in the learning data storage means 11 with the search key information and the record position information sequentially passed from the search means 13.

Search result output means 15 Notifies the request source of the record in searched table 2 indicated by the record position information passed from search range determining means 12 or sequential search means 13 as a search result.

Next, the operation of the present embodiment configured as described above will be described.

Now, in the searched table 2, a plurality of records R1 to
It is assumed that Rn is arranged in ascending order, that is, from the record with the smallest key information to the record with the largest key information, and no significant information is stored in the learning data storage unit 11. In such a situation, for example, when a search request using the key information included in the record R2 as the search key information is input, the search range determining unit
In 12, since there is no significant information in the learning data storage unit 11, the search unit 13 is sequentially notified of the entire range of the searched table 2 as a search range. In response to this, the search means 13 sequentially reads the records of the searched table 2 from the first record R1, for example, and compares them with the search key information according to the search request. As a result, a match with the second record R2 can be obtained, so that the search means 13 sequentially notifies the search result output means 15 of the position information of the second record, and also updates the record position information and the search key information with the learning data updating means. Notify 14. The search result output means 15 acquires the record R2 according to the notified record position information, and notifies the request source as a search result. On the other hand, the learning data updating unit 14 stores the search key information and the record position information of the notified record R2 in the learning data storage unit 11 as storage key information and storage record position information.

Next, for example, if a search request using the key information included in the record R3 as the search key information is input, the search range determination unit 12 determines whether the search key information is stored key information (record Therefore, the range from record R3 immediately after the position indicated by the stored record position information (record position information of record R2) to record Rn at the end of table 2 to be searched is determined as the search range. As a result, the sequential search means 13 sequentially reads records from the record R3 of the searched table 2 and compares them with the search key information. In this case, the search key information matches the key information in the record R3. The record R3 is detected as the corresponding record, and is passed to the request source by the search result output means 15. At this time, the storage key information in the learning data storage
The stored record position information is updated to the search key information and record position information for record R3.

In this manner, in a situation in which adjacent records are continuously searched, a target record can be searched at high speed by utilizing the previous search result. At the time of a search request for the same record as the previous one, the search range determining means 12 detects that, and the search result is output by the search result output means 15 without operating the search means 13 sequentially, so that the search speed is extremely high. Search is possible. Further, the above-described operation example is for the case where the records R1 to Rn are arranged in ascending order, but the same is applicable to the case where the records R1 to Rn are arranged in descending order.

FIG. 2 is a block diagram showing a hardware configuration example of another embodiment of the present invention. The table search device with a learning function according to this embodiment includes a plurality of records as described with reference to FIG.
A search target table storage memory 6 for storing a search target table 2 in which R1 to Rn are arranged in ascending order, and a learning data storage memory 3 for storing storage key information and a storage record pointer.
And an output device 4 such as a CRT for outputting a search result, and a central processing unit 5 connected to these devices and executing a process as shown in FIG. 3, for example. The operation of this embodiment will be described below with reference to FIGS. 2 and 3.

At the time of searching the searched table 2, if search key information is given as information necessary for the search from an input device, a program, or the like (not shown), the central processing unit 5 starts the processing shown in FIG. First, a comparison is made between the stored key information stored in the learning data storage memory 3 and the above-mentioned search key information (process S1), and the result is determined (process S2). If both are equal, the process ends normally. At this time, the record pointed to by the storage record pointer stored in the learning data storage memory 3 in the searched table 2 is the target record, and the record is thereafter output to the output device 4. You.

If it is determined in the process S2 that the search key information is smaller than the storage key information, the record to be searched exists between the first record R1 of the searched table 2 and the record indicated by the storage record pointer. Record pointer value "1" that points to the first record R1
To the end record pointer, "Save Record Pointer-
"1" is stored (process S3), and the process proceeds to process S5.

If it is determined in step S2 that the search key information is larger than the storage key information, the record to be searched is determined from the record indicated by the storage record pointer.
, The stored record pointer +1 is stored as the search record pointer, and the record pointer value "N" indicating the final record Rn is stored as the end record pointer (process S4), and the process proceeds to process S5. move on.

In processes S5 to S8, a search is sequentially performed on the search range determined in process S3 or S4 by the search method as follows. First, the record pointed to by the search record pointer is read from the searched table 2, the contents thereof are compared with the search key information (process S5), and the result is determined (process S6). If the two are equal, the search is successful, and the process proceeds to step S9. If the search key information is larger, it means that a record having the same key information as the search key information does not exist in the searched table 2, so that it is processed as a search error. If the search key information is smaller, the search record pointer is incremented by 1 in order to search for the next record (process S7), and then whether the search range is ended by comparing the search record pointer with the end record pointer is determined. Is determined (processing S8), and if not completed, processing S5
And the above processing is repeated. When it is determined that the search range ends in the process S8, since a record having the same key information as the search key information does not exist in the searched table 2, it is processed as a search error.

When a record having key information equal to the search key information is detected in the processing S6, the storage key information and the storage record pointer in the learning data storage memory 3 are changed to the current search result in order to help the next search. The search key information is replaced with the search record pointer (processing S9, S10), and the process ends normally. When the process ends normally, the record pointed to by the search record pointer is the target record, and then the record is output from the output device 4.

The above operation example is directed to a table in which records are arranged in ascending order, but the same can be applied to a table in which records are arranged in descending order.

〔The invention's effect〕

As described above, the table search device with learning function of the present invention stores the search key information relating to the previous successful search and the position information of the successfully searched record as storage key information and storage record position information, At the time of a new search request, the search key information and the storage key information are compared, and which side of the table is to be set as the search range from the position indicated by the storage record position information is determined based on the magnitude relation between the search key information and the storage key information. In order to search for one record at a time to obtain the target record, in a situation where adjacent records are continuously searched, complicated processing is performed regardless of the searched place. Without this, the target record can be efficiently searched.

[Brief description of the drawings]

FIG. 1 is a block diagram showing one embodiment of the present invention, FIG. 2 is a block diagram showing a hardware configuration example of another embodiment of the present invention, FIG. 3 is a flowchart showing a processing example of a central processing unit 5, FIG. 4 is a flowchart of a conventional sequential search method, and FIG. 5 is a flowchart of a conventional two-part search method. In the figure, 1... Table search device with learning function 11... Learning data storage means 12... Search range determining means 13... Sequential search means 14... Learning data updating means 15. Search table 3 Learning data storage memory 4 Output device 5 Central processing unit 6 Search table storage memory

Claims (3)

(57) [Claims] 1. A table search device for searching a table in which a plurality of records are arranged in descending or ascending order, comprising: learning data storage means for storing storage key information and storage record position information; Comparing the storage key information stored in the learning data storage means with the search key information according to the current search request, and searching based on the comparison result and the storage record position information stored in the learning data storage means. Search range determining means for determining a range; sequential search means for sequentially reading records in the table within the search range determined by the search range determining means and comparing the records with search key information according to the search request; Learning data updating means for updating the content stored in the learning data storage means when the search in the search means is successful. Table search device with function. 2. A method according to claim 1, wherein a plurality of records are arranged in ascending order in said table, and said search range determining means, when search key information relating to a current search request is smaller than storage key information, stores record position information from the top of said table. 2. The learning function according to claim 1, wherein a range immediately before the position indicated by (1) is determined as a search range, and when the range is large, a range from immediately after the position indicated by the stored record position information to the tail of the table is determined as a search range. Table search device. 3. A plurality of records are arranged in descending order in the table, and the search range determining means indicates storage record position information of the table when search key information relating to a current search request is smaller than storage key information. 2. The learning according to claim 1, wherein a range from immediately after the position to the tail of the table is determined as a search range, and when the range is large, a range from the head of the table to immediately before the position indicated by the stored record position information is determined as the search range. Table search device with function.