Retrieval method and device, equipment, storage medium and program product
By segmenting and screening candidate key information, we ensure the non-retranslation of the target key fragments, and solve the problem of inaccurate search results in the existing search methods, achieving more efficient and accurate search results.
Patent Information
- Application Number
- CN202411836820.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-12
- Publication Date
- 2025-04-11
AI Technical Summary
The existing search methods have the problem of inaccurate search results, especially when dealing with large amounts of keywords and database data to be matched, it is inefficient and has a high hit rate.
By obtaining multiple candidate key information and segmenting them, the target key fragments are selected to ensure that the overlap probability of the target key fragments corresponding to all candidate key information is less than the preset probability threshold, thereby conducting more accurate retrieval.
It improves the accuracy of the search results and improves the search efficiency to a certain extent, avoiding the mismatch problem caused by overlapping fragments.
Smart Images
Figure CN119807504A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the technical field of big data processing, and in particular to a retrieval method, apparatus, device, storage medium and program product. Background Art
[0002] With the development of the Internet and the advancement of technology, people have begun to view, manage and operate the Internet from the perspective of "content", that is, from the perspective of "application layer". An important issue that needs to be solved in "content" networks is the retrieval and identification of content data.
[0003] In many cases, the data retrieval task is to match some important keywords in the data transmitted on the network and complete the retrieval task based on the matched content. Therefore, keyword matching, as a basic problem in computer science, has received increasing attention as the network continues to develop.
[0004] However, the above retrieval method has the problem of inaccurate retrieval results. Summary of the invention
[0005] Based on this, it is necessary to provide a retrieval method, device, equipment, storage medium and program product that can improve retrieval accuracy in response to the above technical problems.
[0006] In a first aspect, the present application provides a retrieval method, comprising:
[0007] Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information;
[0008] Filter out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold;
[0009] The target key fragments corresponding to each candidate key information are searched to obtain the search results.
[0010] The above method screens multiple key fragments corresponding to each candidate key information to ensure that the overlapping probability of the target key fragments corresponding to all key information is less than the preset probability threshold, so that the retrieval results obtained by searching based on each target key fragment are more accurate; in addition, the candidate key information is divided into fragments. Compared with the method of directly searching based on the candidate key, this method improves the retrieval efficiency to a certain extent.
[0011] In one embodiment, the above-mentioned filtering out a target key segment from a plurality of key segments corresponding to each candidate key information includes:
[0012] Extracting any one of the candidate key information from the plurality of candidate key information as the first candidate key information, and selecting a key segment from the plurality of key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information;
[0013] For a plurality of second candidate key information among the plurality of candidate key information, second target key segments corresponding to each second candidate key information are screened out from a plurality of key segments corresponding to each second candidate key information.
[0014] The method for determining the target key fragment provided in the embodiment of the present application determines the target key fragments corresponding to multiple candidate key information one by one, ensures that the overlapping probability of the target key fragments corresponding to each candidate key information is less than a preset probability threshold, and thus ensures the accuracy of the retrieval results obtained by retrieval based on each target key fragment.
[0015] In one embodiment, the above-mentioned selecting the second target key segment corresponding to each second candidate key information from the plurality of key segments corresponding to each second candidate key information includes:
[0016] For any second candidate key information, determining whether there is a non-overlapping segment between the second candidate key information and other second candidate key information and the first candidate key information;
[0017] If so, determining the second target key segment according to the non-overlapping segment corresponding to the second candidate key information;
[0018] If not, the overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information are determined, and the second target key segment is determined according to the overlapping segments.
[0019] The method for determining the second target key fragment provided in the embodiment of the present application determines a fragment from the non-overlapping fragments as the second target key fragment when there are non-overlapping fragments between the second candidate key information, other second candidate key information, and the first candidate key information, thereby ensuring the non-overlapping of the target key fragments corresponding to each candidate key information to a certain extent, and providing a data basis for the accuracy of the retrieval results.
[0020] In one embodiment, the determining the second target key segment according to the overlapping segments includes:
[0021] If the overlapping segments are multiple overlapping segments, then according to the third target key segment corresponding to the other second candidate key information and the first target key segment corresponding to the first candidate key information, the second target key segment corresponding to the second candidate key information is screened out from the multiple overlapping segments;
[0022] If the overlapping segment is one overlapping segment, the overlapping segment is determined as the second target key segment corresponding to the second candidate key information.
[0023] The method for determining the second target key fragment provided in the embodiment of the present application is that if the key fragments in the second candidate key information exist in the key fragments of other candidate key information, it means that the key fragments in the second candidate key information are all overlapping fragments. Then, based on the target key fragments of other candidate key information, the second target key fragment of the second candidate key information can be determined from the overlapping fragments, which ensures the non-overlapping of the target key fragments corresponding to each candidate key information to a certain extent, and provides a data basis for the accuracy of the retrieval results.
[0024] In one embodiment, the above-mentioned screening out the second target key segment corresponding to the second candidate key information from the multiple overlapping segments according to the third target key segment corresponding to the other second candidate key information and the first target key segment corresponding to the first candidate key information includes:
[0025] determining whether the plurality of overlapping segments include a first target overlapping segment; the first target overlapping segment is inconsistent with the third target key segment and the first target key segment;
[0026] If included, the first target overlapping segment is used as the second target key segment;
[0027] If not included, the number of times each overlapping segment in the multiple overlapping segments is screened is obtained, and the second target key segment is determined according to each screening number.
[0028] The method for determining the second target key fragment provided in the embodiment of the present application ensures, to a certain extent, the non-overlapping of the target key fragments corresponding to the various candidate key information, and provides a data basis for the accuracy of the retrieval results.
[0029] In one embodiment, the determining of the second target key segment according to the number of times each segment is screened includes:
[0030] The overlapping fragment with the least number of screenings is taken as the second target key fragment.
[0031] The method for determining the second target key fragment provided in the embodiment of the present application takes the overlapping fragment with the least number of screening times as the second target key fragment, which to a certain extent ensures the non-overlapping of the target key fragments corresponding to each candidate key information, and provides a data basis for the accuracy of the retrieval results.
[0032] In a second aspect, the present application also provides a retrieval device, comprising:
[0033] An acquisition module is used to acquire multiple candidate key information and divide each candidate key information into segments to obtain multiple key segments corresponding to each candidate key information;
[0034] A screening module is used to screen out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold;
[0035] The retrieval module is used to retrieve the target key fragments corresponding to each candidate key information to obtain the retrieval result.
[0036] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:
[0037] Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information;
[0038] Filter out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold;
[0039] The target key fragments corresponding to each candidate key information are searched to obtain the search results.
[0040] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:
[0041] Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information;
[0042] Filter out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold;
[0043] The target key fragments corresponding to each candidate key information are searched to obtain the search results.
[0044] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:
[0045] Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information;
[0046] Filter out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold;
[0047] The target key fragments corresponding to each candidate key information are searched to obtain the search results.
[0048] The above-mentioned retrieval method, device, equipment, storage medium and program product screen multiple key fragments corresponding to each candidate key information to ensure that the overlapping probability of the target key fragments corresponding to all key information is less than a preset probability threshold, thereby making the retrieval results obtained by searching based on each target key fragment more accurate; in addition, the candidate key information is divided into fragments. Compared with the method of directly searching based on the candidate key, this method improves the retrieval efficiency to a certain extent. BRIEF DESCRIPTION OF THE DRAWINGS
[0049] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.
[0050] Figure 1 An application environment diagram of a retrieval method in an embodiment;
[0051] Figure 2 A schematic diagram of a retrieval method in one embodiment;
[0052] Figure 3 is a flowchart of a retrieval method in another embodiment;
[0053] Figure 4 is a flowchart of a retrieval method in another embodiment;
[0054] Figure 5 is a flowchart of a retrieval method in another embodiment;
[0055] Figure 6 is a flowchart of a retrieval method in another embodiment;
[0056] Figure 7 Schematic diagram of a process for determining a target key segment in one embodiment;
[0057] Figure 8 A schematic diagram of a target key segment deletion process in one embodiment;
[0058] Fig. 9is a flowchart of a retrieval method in another embodiment;
[0059] Fig.10 is a structural block diagram of a retrieval device in an embodiment;
[0060] Fig.11 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION
[0061] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.
[0062] With the development of the Internet and the advancement of technology, people have begun to view, manage and operate the Internet from the perspective of "content", that is, from the perspective of "application layer". An important issue that needs to be solved in "content" networks is the retrieval and identification of content data.
[0063] In many cases, the data retrieval task is to match some important keywords in the data transmitted on the network and complete the retrieval task based on the matched content. Therefore, keyword matching, as a basic problem in computer science, has received increasing attention as the network continues to develop.
[0064] When performing data retrieval, after the user inputs a large amount of keyword information to be matched and of varying lengths, the data information in the database can be matched with these huge amounts of keyword information. The traditional approach is to directly match each keyword information with the data information in the database. Although this retrieval method has a low false-hit rate, it will significantly reduce the retrieval efficiency and will generate a large number of matching times during the data matching process. If the number of keyword information entered by the user is [AB], and the amount of data in the database is N (N>B), then each piece of data will try to match (B-A+1)*N times, and a total of (B-A+1)*N times will be matched. Second-rate.
[0065] At present, some existing models also use fixed-length feature keywords as indexes to improve matching speed, but at the same time the false hit rate will also increase, that is, there is a problem of inaccurate retrieval results. The present application provides a retrieval method, which aims to improve the accuracy of data retrieval.
[0066] After introducing the background technology of the search method provided by the embodiment of the present application, the following briefly describes the implementation environment involved in the search method provided by the embodiment of the present application. The search method provided by the embodiment of the present application can be applied to Figure 1In the application environment shown, the implementation environment includes a server 104, which can be implemented by an independent server 104 or a server cluster composed of multiple servers 104, and a data storage system 102 can store data that the server 104 needs to process. The data storage system 102 can be integrated on the server 104, or it can be placed on a cloud or other network server. Among them, the server 104 can obtain a batch of candidate key information input by the user in a preset time period, and determine the corresponding target key fragments from each candidate key information, and it needs to be ensured that the target key fragments corresponding to each candidate key information are as different as possible, and then, according to the target key fragments corresponding to each candidate key information, a search is performed to obtain a search result.
[0067] Those skilled in the art will understand that Figure 1 The structure shown in the figure is only a block diagram of a part of the structure related to the scheme of the present application, and does not constitute a limitation on the computer device to which the scheme of the present application is applied. The specific terminal may include more or fewer components than shown in the figure, or combine certain components, or have a different arrangement of components.
[0068] After introducing the application scenarios of the retrieval method provided in the embodiments of the present application above, the retrieval method described in the present application is introduced in detail below.
[0069] In one embodiment, Figure 2 As shown, a retrieval method is provided, which is applied to Figure 1 The server in the example is used to illustrate the following steps:
[0070] S201 . Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information.
[0071] The same key information may exist in the plurality of candidate key information, or the same key information may not exist at all.
[0072] In an embodiment of the present application, when data retrieval is required based on batch candidate key information, the user can enter multiple candidate key information on the retrieval interface of the retrieval device, so that the server obtains the multiple candidate key information entered by the user, and then determines the segment division length according to the retrieval requirements, and segments each candidate key information according to the segment division length to obtain multiple key segments corresponding to each candidate key information.
[0073] Among them, the retrieval requirement refers to the requirement for the accuracy of the retrieval results. For example, if the retrieval results need to have a higher accuracy, the value of the segment division length can be set to a larger value. If the retrieval results need to have a lower accuracy, the value of the segment division length can be set to a smaller value.
[0074] It should be noted that there may be overlapping segments among the multiple key segments corresponding to each candidate key information. For example, key segment A can be one of the key segments of candidate key information a or one of the key segments of candidate key information b. In addition, there may also be overlapping segments inside the candidate key information. For example, candidate key information a includes at least two key segments B. In the case that there may be overlapping segments inside the candidate key information, the overlapping segments inside the candidate key information can be deduplicated so that only non-overlapping segments are retained inside the candidate key information, thereby ensuring the accuracy of candidate retrieval.
[0075] S202: Filter out a target key segment from multiple key segments corresponding to each candidate key information.
[0076] Among them, the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold.
[0077] In an embodiment of the present application, after the multiple key fragments corresponding to each candidate key information are obtained as mentioned above, the target key fragment corresponding to each candidate key information can be screened out from the multiple key fragments corresponding to each candidate key information based on the overlap of each key fragment in the candidate key information, and it needs to be ensured that the overlap probability of the target key fragments corresponding to all candidate key information is less than a preset probability threshold.
[0078] It should be noted that a target key segment needs to be determined from each candidate key information.
[0079] S203: Search according to the target key fragments corresponding to each candidate key information to obtain a search result.
[0080] In the embodiment of the present application, after the target key segments corresponding to the candidate key information are determined, a search may be performed based on the target key segments corresponding to the candidate key information to obtain a search result.
[0081] The retrieval method provided in the embodiment of the present application obtains multiple candidate key information, and divides each candidate key information into segments to obtain multiple key segments corresponding to each candidate key information, and then screens out target key segments from the multiple key segments corresponding to each candidate key information, and performs retrieval based on the target key segments corresponding to each candidate key information to obtain retrieval results; wherein, the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold. The above method screens multiple key segments corresponding to each candidate key information to ensure that the overlapping probability of the target key segments corresponding to all key information is less than a preset probability threshold, thereby making the retrieval results obtained by retrieval based on each target key segment more accurate; in addition, by dividing the candidate key information into segments, compared with the method of directly searching based on the candidate key, the present method improves the retrieval efficiency to a certain extent.
[0082] In one embodiment, Figure 2 Based on the embodiment shown, the process of determining the target key segment can be described as follows: Figure 3 As shown, the above S202 "selecting a target key segment from multiple key segments corresponding to each candidate key information" includes:
[0083] S301 . Extract any one of the candidate key information from a plurality of candidate key information as the first candidate key information, and select a key segment from a plurality of key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information.
[0084] In the embodiment of the present application, when determining the target key segments corresponding to each candidate key information, a one-by-one determination method can be adopted, that is, first determine the target key segment corresponding to one candidate key information, and then determine the target key segments corresponding to other candidate key information one by one, until the target key segments corresponding to multiple candidate key information are determined. According to this determination method, it is necessary to first arbitrarily determine one candidate key information from multiple candidate key information as the first candidate key information, and arbitrarily determine one key segment from the multiple key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information.
[0085] S302 . For multiple second candidate key information among the multiple candidate key information, select second target key segments corresponding to each second candidate key information from multiple key segments corresponding to each second candidate key information.
[0086] The plurality of second candidate key information are other candidate key information except the first candidate key information among the plurality of candidate key information.
[0087] In the embodiment of the present application, after the first target key segment corresponding to the first candidate key information is determined, the second target key segments corresponding to the plurality of second candidate key information in the plurality of candidate key information can be further determined based on the first target key segment.
[0088] Optionally, the first second candidate key information can be determined from multiple second candidate key information, and based on the first target key fragment, the second target key fragment corresponding to the first second candidate key information can be determined from multiple key fragments corresponding to the first second candidate key information, and it is necessary to ensure that the second target key fragment corresponding to the first second candidate key information is different from the first target key fragment; further, the second second candidate key information can be determined from multiple key fragments corresponding to the second second candidate key information based on the first target key fragment and the second target key fragment corresponding to the first second candidate key information, and it is necessary to ensure that the second target key fragment corresponding to the second second candidate key information is different from the first target key fragment and the second target key fragment corresponding to the first second candidate key information; ..., until the second target key fragments corresponding to all the second candidate key information are determined.
[0089] The method for determining the target key fragment provided in the embodiment of the present application determines the target key fragments corresponding to multiple candidate key information one by one, ensures that the overlapping probability of the target key fragments corresponding to each candidate key information is less than a preset probability threshold, and thus ensures the accuracy of the retrieval results obtained by retrieval based on each target key fragment.
[0090] In one embodiment, Figure 3 Based on the embodiment shown, the process of determining the second target key segment corresponding to each second candidate key information can be further described, such as Figure 4 As shown, the above S302 "selecting the second target key segment corresponding to each second candidate key information from the multiple key segments corresponding to each second candidate key information" includes:
[0091] S401 . For any second candidate key information, determine whether there is a non-overlapping segment between the second candidate key information and other second candidate key information and the first candidate key information. If so, execute S402 ; if not, execute S403 .
[0092] The non-overlapping segment refers to a key segment that exists only in the second candidate key information and does not exist in the first candidate key information and any other second candidate key information.
[0093] The overlapping segment refers to a key segment that exists in the second candidate key information, in the first candidate key information, and in any other second candidate key information.
[0094] In an embodiment of the present application, after the first target key fragment corresponding to the first candidate key information is determined as mentioned above, the second target key fragments corresponding to other second candidate key information among the multiple candidate key information can be determined. For any second candidate key information among the multiple second candidate key information, it can be determined whether there are non-overlapping fragments between this second candidate key information and the other second candidate key information and the first candidate key information. If so, execute the following S402; if not, execute the following S403.
[0095] S402: Determine a second target key segment according to the non-overlapping segment corresponding to the second candidate key information.
[0096] In the embodiment of the present application, when there are non-overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information, any non-overlapping segment among the non-overlapping segments corresponding to the second candidate key information can be determined as the second target key segment.
[0097] S403: Determine overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information, and determine a second target key segment according to the overlapping segments.
[0098] In an embodiment of the present application, when there are no non-overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information, the overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information can be determined, and one overlapping segment can be selected from the overlapping segments as the second target key segment.
[0099] The method for determining the second target key fragment provided in the embodiment of the present application determines a fragment from the non-overlapping fragments as the second target key fragment when there are non-overlapping fragments between the second candidate key information, other second candidate key information, and the first candidate key information, thereby ensuring the non-overlapping of the target key fragments corresponding to each candidate key information to a certain extent, and providing a data basis for the accuracy of the retrieval results.
[0100] In one embodiment, Figure 4 Based on the embodiment shown, the process of determining the second target key segment from the overlapping segments can be further described, such as: Figure 5 As shown, the above S403 "determining the second target key segment according to the overlapping segments" includes:
[0101] S501: If there are multiple overlapping segments, select a second target key segment corresponding to the second candidate key information from the multiple overlapping segments according to a third target key segment corresponding to other second candidate key information and a first target key segment corresponding to the first candidate key information.
[0102] In an embodiment of the present application, when there are multiple overlapping fragments determined as mentioned above, and the third target key fragment corresponding to other second candidate key information and the first target key fragment corresponding to the first candidate key information are determined, the overlapping fragments among the multiple overlapping fragments except the third target key fragment corresponding to other second candidate key information and the first target key fragment corresponding to the first candidate key information can be used as candidate second target key fragments, and a candidate second target key fragment is randomly determined from the candidate second target key fragments as the second target key fragment corresponding to the second candidate key information.
[0103] S502: If the overlapping segment is one overlapping segment, determine the overlapping segment as the second target key segment corresponding to the second candidate key information.
[0104] In the embodiment of the present application, when there is only one overlapping segment determined above, this one overlapping segment is directly used as the second target key segment corresponding to the second candidate key information.
[0105] The method for determining the second target key fragment provided in the embodiment of the present application is that if the key fragments in the second candidate key information exist in the key fragments of other candidate key information, it means that the key fragments in the second candidate key information are all overlapping fragments. Then, based on the target key fragments of other candidate key information, the second target key fragment of the second candidate key information can be determined from the overlapping fragments, which ensures the non-overlapping of the target key fragments corresponding to each candidate key information to a certain extent, and provides a data basis for the accuracy of the retrieval results.
[0106] In one embodiment, Figure 5 Based on the embodiment shown, the process of screening the second target key segment corresponding to the second candidate key information can be further described, such as Figure 6 As shown, the above S501 "screening out the second target key segment corresponding to the second candidate key information from multiple overlapping segments according to the third target key segment corresponding to other second candidate key information and the first target key segment corresponding to the first candidate key information" includes:
[0107] S601: Determine whether a first target overlapping segment is included in a plurality of overlapping segments. If so, execute S602; if not, execute S603.
[0108] The first target overlapping segment is inconsistent with the third target key segment and the first target key segment.
[0109] In the embodiment of the present application, when it is determined that the second candidate key information only contains multiple overlapping fragments, it is determined whether the multiple overlapping fragments contain overlapping fragments that are inconsistent with the third target key fragment and the first key fragment. If so, S602 is executed; if not, S603 is executed.
[0110] S602: Use the first target overlapping segment as the second target key segment.
[0111] In the present application, if multiple overlapping segments include an overlapping segment that is inconsistent with the third target key segment and the first key segment, then an overlapping segment is determined from the multiple overlapping segments that include the overlapping segments that are inconsistent with the third target key segment and the first key segment as the second target key segment corresponding to the second candidate key information.
[0112] S603: Obtain the number of times each overlapping segment in the plurality of overlapping segments has been screened, and determine a second target key segment according to each number of times each has been screened.
[0113] The number of times of being screened refers to the number of times the overlapping segment is screened as the target key segment by other second candidate key information and the first candidate key information.
[0114] In an embodiment of the present application, if the multiple overlapping segments do not include overlapping segments that are inconsistent with the third target key segment and the first key segment, the number of times each overlapping segment has been screened can be obtained, and the second target key segment can be determined from the multiple overlapping segments based on the number of times each overlapping segment has been screened.
[0115] Optionally, to ensure that the second target key segment corresponding to the second candidate key information is inconsistent with the third target key segment and the first target key segment, it is necessary to determine the overlapping segment with a small number of screening times as the second target key segment.
[0116] Optionally, the number of times the third target key fragments corresponding to other second candidate key information and the first target key fragments corresponding to the first candidate key information have been screened can also be determined, and a first preset weight can be determined for each number of times screened, as well as the number of times the non-third target key fragments corresponding to other second candidate key information and the non-first target key fragments corresponding to the first candidate key information can be determined, and a second preset weight can be determined for each number of times screened, and then the priorities of multiple key fragments corresponding to the second candidate key information can be determined based on the first preset weight and the second preset weight, and the second target key fragment can be determined from the multiple key fragments based on the priorities of each key fragment. It should be noted that the priority of the number of times the non-third target key fragments corresponding to other second candidate key information and the non-first target key fragments corresponding to the first candidate key information need to be much greater than the priority of the number of times the third target key fragments corresponding to other second candidate key information and the first target key fragments corresponding to the first candidate key information have been screened.
[0117] Optionally, after determining the second target keyword fragment corresponding to the second candidate keyword information, multiple keyword fragments corresponding to the second candidate keyword information can be inserted into the corresponding keyword fragment chain list, wherein the keyword fragment chain list includes a used chain list and an unused chain list, and the used chain list is used to mount the keyword fragments selected as the target keyword fragments, and the unused chain list is used to mount the keyword fragments that are not selected as the target keyword fragments. In addition, when inserting into the unused chain list, the priority of the number of times each keyword fragment is screened can be used as a sorting basis, and the fragments can be inserted in descending order. Thus, it is convenient to obtain the number of times each overlapping fragment is screened in multiple overlapping fragments by score, thereby improving the efficiency of determining the second target key fragment, thereby improving the retrieval efficiency.
[0118] For example, there are 3 candidate key information, abcde, abced and abdce, with a segment length of 2 characters, and the target key segment of abcde has been determined to be de, and the target key segment of abced has been determined to be ce. When determining abdce, the multiple key segments of abdce are first determined to be ab, bd, dc and ce, among which ce is the target key segment of abced, and ce has the lowest priority to be selected as the target key segment of abdce. Ab is in the key segments of abcde and abced, and ab has a medium priority to be selected as the target key segment of abdce. Then the target key segment of abdce can be determined from bd and dc.
[0119] The method for determining the second target key fragment provided in the embodiment of the present application ensures, to a certain extent, the non-overlapping of the target key fragments corresponding to the various candidate key information, and provides a data basis for the accuracy of the retrieval results.
[0120] In one embodiment, Figure 6 Based on the illustrated embodiment, the process of determining the second target key segment can be further described. The above S603 "determining the second target key segment according to the number of times each segment is screened" includes:
[0121] The overlapping fragment with the least number of screenings is taken as the second target key fragment.
[0122] In the embodiment of the present application, when the number of times each overlapping segment is screened is determined, the overlapping segment with the least number of times screened may be used as the second target key segment.
[0123] The method for determining the second target key fragment provided in the embodiment of the present application takes the overlapping fragment with the least number of screening times as the second target key fragment, which to a certain extent ensures the non-overlapping of the target key fragments corresponding to each candidate key information, and provides a data basis for the accuracy of the retrieval results.
[0124] Optional, see Figure 7 , and also provides a method for determining a target keyword fragment, which starts loading a string keyword and determines whether the string keyword already exists. If the string keyword exists, the string count is increased by 1, and each of its fragments is parsed and fragment information is obtained. According to the existing information, the use and unused counts of each fragment are increased by 1, and then the offset of the selected feature keyword in the string keyword is returned, and the process ends; then, if the string keyword does not exist, the string keyword is added to the keyword library, and the fragments are deduplicated. For the repeated fragments in this string, only the first one is processed, and other fragments are recorded as non-first appearances, and the first-appearing fragments are counted, and each of its fragments is parsed and fragment information is obtained, and then the fragment is queried to see if it exists. If it does not exist, it is created. If it exists, the fragment management information is obtained, and the fragment information is counted (including: the number of occurrences of each fragment). Number, obtain the maximum number of times the string fragment has been occupied by other owners of the fragment that has never been occupied, obtain the situation of the current string already occupied, if the fragment appears multiple times in this string, add the number of occurrences), and calculate the fragment scores one by one, and select the best, and add the fragment nodes one by one to the use or linked list of the corresponding fragment according to whether they are used, and determine whether the fragment is selected this time, if not, directly add it to the corresponding unused linked list, if so, add the fragment selected by this string to the use linked list corresponding to the fragment, and determine whether the fragment is used for the first time, if not, return the offset of the selected feature keyword in the string keyword, if so, refresh the number of times the fragments of all strings in all unused linked lists on the fragment are occupied, and re-sort according to the new number of times the fragment is used, and return the offset of the selected feature keyword in the string keyword, and finally end the process.
[0125] Optional, see Figure 8 , and also provides a method for deleting a target keyword fragment, which starts to delete the string keyword and determines whether the string keyword exists. If not, the process ends directly. If it exists, its various fragments are parsed and the fragment information is obtained, and it is determined whether the string is the last one repeated. If so, the node is removed from the linked list. If not, it is determined whether it is a used fragment. If so, it is determined whether the length after 1 is 0. If not, the fragment nodes are used one by one according to whether they are used or the base number of the linked list corresponding to the fragment is -1. If so, the number of occupied fragments of the string in the unused linked list in the fragment is refreshed, and the fragment nodes are repeatedly sorted, and the fragment nodes are used one by one according to whether they are used or the base number of the linked list corresponding to the fragment is -1. It is determined that the number of times used and used are both 0. If so, the fragment information is deleted. If not, it is determined whether the string is the last one repeated. If so, the string information is deleted and the process ends. If not, the process ends directly.
[0126] In one embodiment, see Fig. 9 , and also provides a retrieval method, including:
[0127] S10, obtaining multiple candidate key information, and segmenting each candidate key information to obtain multiple key segments corresponding to each candidate key information;
[0128] S11, extracting any one of the candidate key information from the plurality of candidate key information as the first candidate key information, and selecting a key segment from the plurality of key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information;
[0129] S12, for multiple second candidate key information among the multiple candidate key information, for any second candidate key information, determine whether there is a non-overlapping segment between the second candidate key information and other second candidate key information and the first candidate key information, if yes, execute S13, if no, execute S14;
[0130] S13, determining a second target key segment according to the non-overlapping segments corresponding to the second candidate key information;
[0131] S14, determining overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information;
[0132] S15, when the overlapping segment is a plurality of overlapping segments, determining whether the plurality of overlapping segments include an overlapping segment that is inconsistent with the third target key segment and the first target key segment, if included, executing S16, if not included, executing S17;
[0133] S16, using the first target overlapping segment as the second target key segment;
[0134] S17, obtaining the number of times each overlapping segment in the multiple overlapping segments has been screened, and taking the overlapping segment with the least number of times screened as the second target key segment;
[0135] S18. Searching is performed according to the target key fragments corresponding to each candidate key information to obtain a search result.
[0136] The above method screens multiple key fragments corresponding to each candidate key information to ensure that the overlapping probability of the target key fragments corresponding to all key information is less than the preset probability threshold, thereby making the retrieval results based on the retrieval of each target key fragment more accurate; in addition, the candidate key information is divided into fragments. Compared with the method of directly searching based on the candidate key, this method improves the retrieval efficiency to a certain extent.
[0137] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.
[0138] Based on the same inventive concept, the embodiment of the present application also provides a retrieval device for implementing the above-mentioned retrieval method. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above-mentioned method, so the specific limitations in one or more retrieval device embodiments provided below can refer to the limitations on the retrieval method above, and will not be repeated here.
[0139] In an exemplary embodiment, Fig.10 As shown, a retrieval device is provided, comprising: an acquisition module 10, a screening module 11 and a retrieval module 12, wherein:
[0140] The acquisition module 10 is used to acquire multiple candidate key information and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information.
[0141] The screening module 11 is used to screen out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold.
[0142] The retrieval module 12 is used to perform retrieval according to the target key fragments corresponding to each candidate key information to obtain the retrieval result.
[0143] In an exemplary embodiment, the screening module 11 includes: a first screening unit and a second screening unit, wherein:
[0144] The first screening unit is specifically used to extract any candidate key information from the plurality of candidate key information as the first candidate key information, and screen out a key segment from the plurality of key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information;
[0145] The second screening unit is specifically configured to screen out second target key segments corresponding to each of the plurality of second candidate key information from the plurality of key segments corresponding to each of the second candidate key information for the plurality of second candidate key information.
[0146] In an exemplary embodiment, the above-mentioned second screening unit is specifically used to determine, for any second candidate key information, whether there are non-overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information; if there are non-overlapping segments, determine the second target key segment based on the non-overlapping segments corresponding to the second candidate key information; if there are no non-overlapping segments, determine the overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information, and determine the second target key segment based on the overlapping segments.
[0147] In an exemplary embodiment, the above-mentioned second screening unit is specifically used to, when there are multiple overlapping fragments, screen out the second target key fragment corresponding to the second candidate key information from multiple overlapping fragments based on the third target key fragment corresponding to other second candidate key information and the first target key fragment corresponding to the first candidate key information; when the overlapping fragment is one overlapping fragment, the overlapping fragment is determined as the second target key fragment corresponding to the second candidate key information.
[0148] In an exemplary embodiment, the above-mentioned second screening unit is specifically used to determine whether the first target overlapping fragment is included in the multiple overlapping fragments; the first target overlapping fragment is inconsistent with the third target key fragment and the first target key fragment; if the first target overlapping fragment is included, the first target overlapping fragment is used as the second target key fragment; if the first target overlapping fragment is not included, the number of times each overlapping fragment in the multiple overlapping fragments is screened is obtained, and the second target key fragment is determined according to each screening number.
[0149] In an exemplary embodiment, the second screening unit is further configured to use the overlapping segment that has been screened the least number of times as the second target key segment.
[0150] Each module in the above retrieval device can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each module.
[0151] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Fig.11 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store key fragment data. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a retrieval method is implemented.
[0152] Those skilled in the art will understand that Fig.11 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.
[0153] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the following steps are implemented:
[0154] Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information;
[0155] Filter out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold;
[0156] The target key fragments corresponding to each candidate key information are searched to obtain the search results.
[0157] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:
[0158] Extracting any one of the candidate key information from the plurality of candidate key information as the first candidate key information, and selecting a key segment from the plurality of key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information;
[0159] For a plurality of second candidate key information among the plurality of candidate key information, second target key segments corresponding to each second candidate key information are screened out from a plurality of key segments corresponding to each second candidate key information.
[0160] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:
[0161] For any second candidate key information, determining whether there is a non-overlapping segment between the second candidate key information and other second candidate key information and the first candidate key information;
[0162] If so, determining the second target key segment according to the non-overlapping segment corresponding to the second candidate key information;
[0163] If not, the overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information are determined, and the second target key segment is determined according to the overlapping segments.
[0164] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:
[0165] If the overlapping segments are multiple overlapping segments, then according to the third target key segment corresponding to the other second candidate key information and the first target key segment corresponding to the first candidate key information, the second target key segment corresponding to the second candidate key information is screened out from the multiple overlapping segments;
[0166] If the overlapping segment is one overlapping segment, the overlapping segment is determined as the second target key segment corresponding to the second candidate key information.
[0167] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:
[0168] determining whether the plurality of overlapping segments include a first target overlapping segment; the first target overlapping segment is inconsistent with the third target key segment and the first target key segment;
[0169] If included, the first target overlapping segment is used as the second target key segment;
[0170] If not included, the number of times each overlapping segment in the multiple overlapping segments is screened is obtained, and the second target key segment is determined according to each screening number.
[0171] In one embodiment, when the processor executes the computer program, the processor further implements the following steps:
[0172] The overlapping fragment with the least number of screenings is taken as the second target key fragment.
[0173] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:
[0174] Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information;
[0175] Filter out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold;
[0176] The target key fragments corresponding to each candidate key information are searched to obtain the search results.
[0177] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0178] Extracting any one of the candidate key information from the plurality of candidate key information as the first candidate key information, and selecting a key segment from the plurality of key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information;
[0179] For a plurality of second candidate key information among the plurality of candidate key information, second target key segments corresponding to each second candidate key information are screened out from a plurality of key segments corresponding to each second candidate key information.
[0180] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0181] For any second candidate key information, determining whether there is a non-overlapping segment between the second candidate key information and other second candidate key information and the first candidate key information;
[0182] If so, determining the second target key segment according to the non-overlapping segment corresponding to the second candidate key information;
[0183] If not, the overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information are determined, and the second target key segment is determined according to the overlapping segments.
[0184] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0185] If the overlapping segments are multiple overlapping segments, then according to the third target key segment corresponding to the other second candidate key information and the first target key segment corresponding to the first candidate key information, the second target key segment corresponding to the second candidate key information is screened out from the multiple overlapping segments;
[0186] If the overlapping segment is one overlapping segment, the overlapping segment is determined as the second target key segment corresponding to the second candidate key information.
[0187] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0188] determining whether the plurality of overlapping segments include a first target overlapping segment; the first target overlapping segment is inconsistent with the third target key segment and the first target key segment;
[0189] If included, the first target overlapping segment is used as the second target key segment;
[0190] If not included, the number of times each overlapping segment in the multiple overlapping segments is screened is obtained, and the second target key segment is determined according to each screening number.
[0191] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0192] The overlapping fragment with the least number of screenings is taken as the second target key fragment.
[0193] In one embodiment, a computer program product is provided, comprising a computer program, which, when executed by a processor, implements the following steps:
[0194] Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information;
[0195] Filter out a target key segment from multiple key segments corresponding to each candidate key information; the overlapping probability of the target key segments corresponding to all candidate key information is less than a preset probability threshold;
[0196] The target key fragments corresponding to each candidate key information are searched to obtain the search results.
[0197] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0198] Extracting any one of the candidate key information from the plurality of candidate key information as the first candidate key information, and selecting a key segment from the plurality of key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information;
[0199] For a plurality of second candidate key information among the plurality of candidate key information, second target key segments corresponding to each second candidate key information are screened out from a plurality of key segments corresponding to each second candidate key information.
[0200] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0201] For any second candidate key information, determining whether there is a non-overlapping segment between the second candidate key information and other second candidate key information and the first candidate key information;
[0202] If so, determining the second target key segment according to the non-overlapping segment corresponding to the second candidate key information;
[0203] If not, the overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information are determined, and the second target key segment is determined according to the overlapping segments.
[0204] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0205] If the overlapping segments are multiple overlapping segments, then according to the third target key segment corresponding to the other second candidate key information and the first target key segment corresponding to the first candidate key information, the second target key segment corresponding to the second candidate key information is screened out from the multiple overlapping segments;
[0206] If the overlapping segment is one overlapping segment, the overlapping segment is determined as the second target key segment corresponding to the second candidate key information.
[0207] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0208] determining whether the plurality of overlapping segments include a first target overlapping segment; the first target overlapping segment is inconsistent with the third target key segment and the first target key segment;
[0209] If included, the first target overlapping segment is used as the second target key segment;
[0210] If not included, the number of times each overlapping segment in the multiple overlapping segments is screened is obtained, and the second target key segment is determined according to each screening number.
[0211] In one embodiment, when the computer program is executed by a processor, the following steps are also implemented:
[0212] The overlapping fragment with the least number of screenings is taken as the second target key fragment.
[0213] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.
[0214] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.
[0215] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.
[0216] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be construed as limiting the scope of the present application. It should be noted that, for a person of ordinary skill in the art, several modifications and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.
Claims
1. A search method, characterized in that: The method comprises: Acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information; Filtering out a target key segment from the multiple key segments corresponding to each of the candidate key information; the overlapping probability of the target key segments corresponding to all the candidate key information is less than a preset probability threshold; A search is performed according to the target key fragments corresponding to each of the candidate key information to obtain a search result.
2. The method according to claim 1, characterized in that: The step of selecting a target key segment from the multiple key segments corresponding to each of the candidate key information includes: Extracting any one of the candidate key information from the multiple candidate key information as the first candidate key information, and selecting a key segment from the multiple key segments corresponding to the first candidate key information as the first target key segment corresponding to the first candidate key information; For a plurality of second candidate key information among the plurality of candidate key information, second target key segments corresponding to each of the second candidate key information are screened out from a plurality of key segments corresponding to each of the second candidate key information.
3. The method according to claim 2, characterized in that The step of selecting the second target key segment corresponding to each of the second candidate key information from the plurality of key segments corresponding to each of the second candidate key information includes: For any of the second candidate key information, determining whether there are non-overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information; If so, determining the second target key segment according to the non-overlapping segment corresponding to the second candidate key information; If not, the overlapping segments between the second candidate key information and other second candidate key information and the first candidate key information are determined, and the second target key segment is determined according to the overlapping segments.
4. The method according to claim 3, characterized in that The determining the second target key segment according to the overlapping segments includes: If the overlapping segments are multiple overlapping segments, then according to the third target key segment corresponding to the other second candidate key information and the first target key segment corresponding to the first candidate key information, the second target key segment corresponding to the second candidate key information is screened out from the multiple overlapping segments; If the overlapping segment is an overlapping segment, the overlapping segment is determined as the second target key segment corresponding to the second candidate key information.
5. The method according to claim 4, characterized in that The step of selecting the second target key segment corresponding to the second candidate key information from the plurality of overlapping segments according to the third target key segment corresponding to the other second candidate key information and the first target key segment corresponding to the first candidate key information includes: Determine whether the plurality of overlapping segments include a first target overlapping segment; the first target overlapping segment is inconsistent with the third target key segment and the first target key segment; If included, taking the first target overlapping segment as the second target key segment; If not included, the number of times each overlapping segment in the multiple overlapping segments is screened is obtained, and the second target key segment is determined according to each of the number of times it is screened.
6. The method according to claim 5, characterized in that The determining of the second target key fragment according to the number of times each of the selected fragments is performed includes: The overlapping segment that has been screened the least number of times is used as the second target key segment.
7. A search device, characterized in that: The device comprises: An acquisition module, used to acquire multiple candidate key information, and segment each candidate key information to obtain multiple key segments corresponding to each candidate key information; A screening module, used to screen out a target key segment from a plurality of key segments corresponding to each of the candidate key information; the overlapping probability of the target key segments corresponding to all the candidate key information is less than a preset probability threshold; The retrieval module is used to perform retrieval according to the target key fragments corresponding to each of the candidate key information to obtain the retrieval results.
8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.
9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.
10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.