CN116662615A - A Fast Search Method for Non-matrix Data - Google Patents

Abstract

The invention discloses a method for quickly searching non-matrix data. According to the invention, a mapping table is established according to the non-matrix data, the auxiliary row address data of the mapping table is associated with the address data of the non-matrix data table, and when a character string is input by a user, quick search is started in the mapping table. Performing binary search operation on the mapping table, comparing the input character string with the keywords recorded in the middle position of the mapping table, and if the input character string and the keywords are the same, searching is successful; otherwise, dividing the table into a front sub-table and a rear sub-table from the middle position, if the keyword recorded in the middle position is larger than the searching keyword, searching the front sub-table further, otherwise, searching the rear sub-table further. The above process is repeated until a record is found that satisfies the condition, making the search successful, or until a sub-table does not exist, at which time the search is unsuccessful. And listing the non-matrix data in a matrix data mode by a mapping table mode, so as to realize quick searching and positioning of the non-matrix data.

Description

A Fast Search Method for Non-matrix Data

technical field

The invention relates to the technical field of computer software, in particular to a method for fast searching of non-matrix data.

Background technique

In today's world, it is impossible to operate without a computer, and using a computer involves a large number of algorithms and searches. In the face of huge data, the search efficiency of the computer is particularly important. Binary search, which is often used in quick search, is particularly cumbersome when faced with non-matrix data, and loses the essence of binary search. Then you have to choose some other inefficient search methods instead.

Therefore, there are defects in the prior art and need to be improved.

Contents of the invention

The purpose of the present invention is to overcome the deficiencies of the prior art and provide a method for fast searching of non-matrix data.

The technical scheme of the present invention is as follows: provide a kind of method for quick search of non-matrix data, comprise the steps:

Step 1: Generate a row header address data table of non-matrix data according to the non-matrix data to be searched;

Step 2: Enter the character string that needs to be searched and located, and start to search;

Step 3: locate the intermediate address data of the auxiliary row header address data table;

Step 4: After jumping to the intermediate address data, judge whether it is the string that needs to be searched currently;

Step 5: If the intermediate address data jumped in step 4 is not the character string to be searched, perform a binary matching search on the address data table, locate the new address data to be matched, and judge whether it is the character that needs to be searched currently string; if not, repeat step 5;

Step 6: If the jumping intermediate address data in step 4 or step 5 is the searched character string, output the result and the program ends.

Further, the specific steps of the binary matching search include:

Use two register groups to store the address and step size of the current query respectively;

Use the address of the current entry to read the entry in the lookup table for comparison;

Determine the direction of the next binary match according to the comparison result and the way the lookup table is generated, and complete the next hop operation when it is judged that it is not the desired string.

Using the above scheme, the present invention establishes a mapping table according to the non-matrix data, associates the auxiliary row address data of the mapping table with the address data of the non-matrix data table, and starts to quickly search in the mapping table when the user inputs a character string . Perform a binary search operation on the mapping table, compare the input string with the key recorded in the middle of the mapping table, if the two are the same, the search is successful; otherwise divide the table into two sub-tables from the middle position, if the middle position If the recorded key is greater than the search key, the previous sub-table is further searched; otherwise, the latter sub-table is further searched. Repeat the above process until a record meeting the condition is found, making the search successful, or until the child table does not exist, at this time the search is unsuccessful. Through the mapping table, the non-matrix data is listed in the form of matrix data, thereby improving the search efficiency of the dichotomy and realizing the fast search and positioning of non-matrix data.

Description of drawings

Fig. 1 is a schematic block diagram of the process of the present invention.

Fig. 2 is a schematic diagram of non-matrix data and mapping table.

Detailed ways

The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.

Please refer to Fig. 1, the present invention provides a kind of method for quick search of non-matrix data, comprises the following steps:

Step 1: Generate a row header address data table of non-matrix data according to the non-matrix data to be searched.

The non-matrix data table is as follows:

DS<Const=AAAAAAAAAAAAAAAAAA>,DD<ID=0x00000001>;

DS<Const=BBB>,DD<ID=0x00000002>;

DS<Const=CCCC>,DD<ID=0x00000003>;

DS<Const=D>,DD<ID=0x00000004>

An example of a mapping table is as follows:

DD<ID=0x00000000>;/////This value is the head address of the corresponding data table

DD<ID=0x00000016>;/////This value is the head address of the corresponding data table

dd<ID=0x0000001D>;

DD<ID=0x00000025>

Step 2: Enter the character string that needs to be searched and located, and start searching.

Step 3: Locate to the middle address data of the auxiliary row head address data table.

Step 4: After jumping to the intermediate address data, judge whether it is the character string that needs to be searched currently.

Step 5: If the intermediate address data jumped in step 4 is not the character string to be searched, perform a binary matching search on the address data table, locate the new address data to be matched, and judge whether it is the character that needs to be searched currently string; if not, repeat step 5.

Step 6: If the jumping intermediate address data in step 4 or step 5 is the searched character string, output the result and the program ends.

The specific steps of the binary matching search include:

Use two register groups to store the address and step size of the current query respectively;

Use the address of the current entry to read the entry in the lookup table for comparison;

Determine the direction of the next binary match according to the comparison result and the way the lookup table is generated, and complete the next hop operation when it is judged that it is not the desired string.

As shown in Figure 2, when the string ARC177 is passed in, a binary search is first performed in the Addr_Check_Map table, the first step is to locate the fifth Index, the corresponding address is 0x0000002A, and the string BCMFA2 is found in the Addr_Check table using the address 0x0000002A , it is found that it does not match the incoming string, and it is larger than the incoming string in ASCII, so continue the upward binary search, retrieve the second Index, the corresponding address is 0x0000000A, use the address 0x0000000A to find the string in the Addr_Check table ARC177, it is found that it exactly matches the incoming string, so the recognition is successful at this time, and the corresponding Type data in the data table is obtained.

When the traditional binary search is not faced with matrix data, it cannot quickly search, and it is particularly complicated and cumbersome in actual operation, losing the essence of binary search. The present invention realizes the binary search by creating an address mapping table, and realizes the maximum search efficiency at the minimum cost.

In summary, the present invention establishes a mapping table based on non-matrix data, and associates the auxiliary row address data of the mapping table with the address data of the non-matrix data table. find. Perform a binary search operation on the mapping table, compare the input string with the key recorded in the middle of the mapping table, if the two are the same, the search is successful; otherwise divide the table into two sub-tables from the middle position, if the middle position If the recorded key is greater than the search key, the previous sub-table is further searched; otherwise, the latter sub-table is further searched. Repeat the above process until a record meeting the condition is found, making the search successful, or until the child table does not exist, at this time the search is unsuccessful. Through the mapping table, the non-matrix data is listed in the form of matrix data, thereby improving the search efficiency of the dichotomy and realizing the fast search and positioning of non-matrix data.

The above are only preferred embodiments of the present invention, and are not intended to limit the present invention. Any modifications, equivalent replacements and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention. Inside.

Claims (2)

1. a method for non-matrix data fast search, is characterized in that, comprises the steps: Step 1: Generate a row header address data table of non-matrix data according to the non-matrix data to be searched; Step 2: Enter the character string that needs to be searched and located, and start to search; Step 3: locate the intermediate address data of the auxiliary row header address data table; Step 4: After jumping to the intermediate address data, judge whether it is the string that needs to be searched currently; Step 5: If the intermediate address data jumped in step 4 is not the character string to be searched, perform a binary matching search on the address data table, locate the new address data to be matched, and judge whether it is the character that needs to be searched currently string; if not, repeat step 5; Step 6: If the jumping intermediate address data in step 4 or step 5 is the searched character string, output the result and the program ends. 2. the method for fast search of non-matrix data according to claim 1, is characterized in that, the specific steps of described binary matching search comprise: Use two register groups to store the address and step size of the current query respectively; Use the address of the current entry to read the entry in the lookup table for comparison; Determine the direction of the next binary match according to the comparison result and the way the lookup table is generated, and complete the next hop operation when it is judged that it is not the desired string.