Searching method and device for keywords in database and computer equipment

Abstract

The invention relates to a search method and device for keywords in a database and computer equipment. The method comprises the steps of obtaining a text of a structured query language of a target database; storing the text of the structured query language into a blocking queue; the text of the target structured query language in the blocking queue is read based on a thread in a preset thread pool, the text of the target structured query language is segmented into a plurality of words, a matched target keyword is searched from a dictionary tree based on the words, and the dictionary tree comprises a plurality of keywords. By adopting the method, the keyword searching efficiency can be improved.

Description

Technical Field

[0001] The present application relates to the field of database technology, and in particular to a method, device, and computer equipment for searching keywords in a database. Background Art

[0002] When performing database migration operations, it is necessary to perform compatibility analysis of the structured query language, that is, whether the keywords in the source database can correspond one-to-one with the keywords in the target database. Therefore, keyword analysis should be performed on the structured query language collected from the customer source.

[0003] In the related art, the amount of source-side structured query languages ​​collected is huge, and manual analysis of keywords for each structured query language is inefficient and cannot meet actual operational efficiency. Summary of the invention

[0004] Based on this, it is necessary to provide a method, device and computer equipment for searching keywords in a database in order to solve the above technical problems.

[0005] In a first aspect, the present application provides a method for searching keywords in a database. The method comprises:

[0006] Obtaining the text of the structured query language of the target database;

[0007] Storing the text of the structured query language in a blocking queue;

[0008] Based on the threads in the preset thread pool, the target structured query language text in the blocking queue is read, the target structured query language text is divided into multiple words, and matching target keywords are found from the dictionary tree based on the words, and the dictionary tree includes multiple keywords.

[0009] In one embodiment, after the thread in the preset thread pool reads the target structured query language text in the blocking queue, the method includes:

[0010] The target structured query language text of the target row is obtained. If the target structured query language text of the target row includes a start regular expression of a text comment, the target structured query language text of the next row of the target row is obtained until an end regular expression of the text comment is found, and the comment content is replaced with empty text.

[0011] In one embodiment, searching for a matching target keyword from a dictionary tree based on the word includes:

[0012] Acquire an object name and a directory name, wherein the object name includes a text name of the structured query language, and the directory name includes a parent text name of the structured query language;

[0013] The object name and directory name are matched with the target keyword.

[0014] In one embodiment, after finding a matching target keyword from the dictionary tree based on the word, the method includes:

[0015] The target keyword is stored in a keyword list, wherein the keyword list includes an object name, a directory name, and a target keyword.

[0016] In one embodiment, the method further comprises:

[0017] De-duplication processing is performed on the keyword list to obtain a list without repeated keywords;

[0018] The list of non-repetitive keywords is stored in the target system.

[0019] In one of the embodiments, the target system is used to store keywords of the source database and the target database;

[0020] Modify the compatibility features of the source database and the target database through the consistency of keyword features of the source database and the target database.

[0021] In a second aspect, the present application also provides a device for searching keywords in a database, the device comprising:

[0022] An acquisition module, used for acquiring a text of a structured query language of a target database;

[0023] A storage module, used for storing the text of the structured query language in a blocking queue;

[0024] The matching module is used to read the text of the target structured query language in the blocking queue based on the threads in the preset thread pool, divide the text of the target structured query language into multiple words, and search for matching target keywords from the dictionary tree based on the words, and the dictionary tree includes multiple keywords.

[0025] In one embodiment, after the thread in the preset thread pool reads the target structured query language text in the blocking queue, the device includes:

[0026] The target structured query language text of the target row is obtained. If the target structured query language text of the target row includes a start regular expression of a text comment, the target structured query language text of the next row of the target row is obtained until an end regular expression of the text comment is found, and the comment content is replaced with empty text.

[0027] In one embodiment, searching for a matching target keyword from a dictionary tree based on the word includes:

[0028] Acquire an object name and a directory name, wherein the object name includes a text name of the structured query language, and the directory name includes a parent text name of the structured query language;

[0029] The object name and directory name are matched with the target keyword.

[0030] In one embodiment, after finding a matching target keyword from a dictionary tree based on the word, the device includes:

[0031] The target keyword is stored in a keyword list, wherein the keyword list includes an object name, a directory name, and a target keyword.

[0032] In one embodiment, the device further comprises:

[0033] De-duplication processing is performed on the keyword list to obtain a list without repeated keywords;

[0034] The list of non-repetitive keywords is stored in the target system.

[0035] In one of the embodiments, the target system is used to store keywords of the source database and the target database;

[0036] Modify the compatibility features of the source database and the target database through the consistency of keyword features of the source database and the target database.

[0037] In a third aspect, the present disclosure further provides a computer device, wherein the computer device comprises a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of the method for searching keywords in a database are implemented.

[0038] In a fourth aspect, the present disclosure further provides a computer-readable storage medium having a computer program stored thereon, which implements the steps of a method for searching keywords in a database when executed by a processor.

[0039] In a fifth aspect, the present disclosure further provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the steps of the method for searching keywords in a database are implemented.

[0040] The above-mentioned method for searching keywords in the database has at least the following beneficial effects:

[0041] The embodiment scheme provided by the present disclosure uses a dictionary tree as a storage structure for keywords. When searching for keywords corresponding to each structured query language text, a blocking queue is used to store each line of data read from the structured query language text, and a thread pool is used to take each line from the blocking queue and split it into words, and the words are searched from the dictionary tree to improve the efficiency of keyword search.

[0042] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure or the conventional technology, the drawings required for use in the embodiments or the conventional technology descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0044] Figure 1 An application environment diagram of a method for searching keywords in a database in one embodiment;

[0045] Figure 2 A schematic diagram of a flow chart of a method for searching keywords in a database in one embodiment;

[0046] Figure 3 is a schematic diagram of a dictionary tree in one embodiment;

[0047] Figure 4 A schematic diagram of removing comments in an embodiment;

[0048] Figure 5 A schematic diagram of a newly added feature module in an embodiment;

[0049] Figure 6 is a schematic diagram of a compatibility relationship mapping module in one embodiment;

[0050] Figure 7 A structural block diagram of a device for searching keywords in a database in an embodiment;

[0051] Figure 8 is an internal structure diagram of a computer device in one embodiment;

[0052] Fig. 9 The figure is a diagram of the internal structure of a server in one embodiment. DETAILED DESCRIPTION

[0053] In order to enable ordinary persons in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings.

[0054] It should be noted that the terms "first", "second", etc. in the specification and claims of the present disclosure and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchanged where appropriate, so that the embodiments of the present disclosure described here can be implemented in an order other than those illustrated or described here. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. On the contrary, they are only examples of devices and methods consistent with some aspects of the present disclosure as detailed in the attached claims. The terms "include", "comprise" or any other variant thereof are intended to cover non-exclusive inclusion, so that the process, method, product or device including a series of elements includes not only those elements, but also other elements that are not explicitly listed, or also includes elements inherent to such process, method, product or device. In the absence of more restrictions, it is not excluded that there are other identical or equivalent elements in the process, method, product or device including the elements. For example, if the words first, second, etc. are used to represent the name, they do not represent any specific order.

[0055] The present disclosure provides a method for searching keywords in a database, which can be applied to Figure 1 In the application environment shown. Among them, the terminal 102 communicates with the server 104 through the network. The data storage system can store the data that the server 104 needs to process. The data storage system can be integrated on the server 104, or it can be placed on the cloud or other network servers. Among them, the terminal 102 can be but is not limited to various personal computers, laptops, smart phones, tablets, Internet of Things devices and portable wearable devices. The Internet of Things devices can be smart speakers, smart TVs, smart air conditioners, smart car-mounted devices, etc. Portable wearable devices can be smart watches, smart bracelets, head-mounted devices, etc. The server 104 can be implemented with an independent server or a server cluster consisting of multiple servers.

[0056] In some embodiments of the present disclosure, Figure 2 As shown, a method for searching keywords in a database is provided, and the method is applied to Figure 1The method is described by taking the example of a server in processing a database. It is understandable that the method can be applied to a server, and can also be applied to a system including a terminal and a server, and is implemented through the interaction between the terminal and the server. In a specific embodiment, the method can include the following steps:

[0057] S202: Acquire a text of a structured query language of a target database.

[0058] The structured query language (SQL) text of the target database is usually obtained, including database definition (DDL) statements for creating and defining database objects (such as tables, views, indexes, stored procedures, etc.).

[0059] S204: storing the structured query language text in a blocking queue.

[0060] A blocking queue is a thread-safe queue data structure. When the queue is empty, threads that try to take data out of the queue will be blocked until new data is available in the queue. When the queue is full, threads that try to add data to the queue will be blocked until space is available in the queue. Multiple threads can add or remove data from the queue at the same time without data contention or inconsistency. Producer threads and consumer threads can work in parallel without the need to set up complex synchronization mechanisms.

[0061] S206: Reading the target structured query language text in the blocking queue based on the threads in the preset thread pool, dividing the target structured query language text into multiple words, and searching for matching target keywords from a dictionary tree based on the words, wherein the dictionary tree includes multiple keywords.

[0062] A fixed number of threads are pre-created in the thread pool, and the thread pool assigns tasks to idle threads. If there are multiple tasks, the thread pool assigns tasks to different threads based on thread availability. Each thread takes a task from the queue and executes it. After execution, the thread returns to the waiting state and prepares to process the next task. The thread in the thread pool takes the target structured query language text from the blocking queue, and can split the taken target structured query language text into multiple words, using spaces, commas, semicolons, etc. as separators.

[0063] Figure 3The diagram is a diagram of a dictionary tree in an embodiment. The dictionary tree is an ordered tree data structure used to store dynamic sets or associative arrays. The dictionary tree includes multiple nodes, each node contains a character, each node may have multiple child nodes, each child node represents the next character of the current node character, and each node may have a flag indicating whether the path from the root node to the node constitutes a complete word. For each segmented word, the dictionary tree is used for search. If a word has a complete path in the dictionary tree, and the end node of the path is marked as a complete word, then the word is a matching target keyword.

[0064] In the keyword search method in the above database, a dictionary tree is used as a storage structure for keywords. When searching for keywords corresponding to each structured query language text, a blocking queue is used to store each line of data read from the structured query language text, and a thread pool is used to take each line from the blocking queue and split it into words, and the words are searched from the dictionary tree to improve the efficiency of keyword search.

[0065] In some embodiments of the present disclosure, after the thread in the preset thread pool reads the target structured query language text in the blocking queue, the method includes:

[0066] The target structured query language text of the target row is obtained. If the target structured query language text of the target row includes a start regular expression of a text comment, the target structured query language text of the next row of the target row is obtained until an end regular expression of the text comment is found, and the comment content is replaced with empty text.

[0067] There are many lines of structured query language text and a large number of comments. You can use a thread pool plus a blocking queue to read each line of structured query language text, and take each line of structured query language text from the queue at the same time to remove the comments. For comments starting with "--" or "#", you can directly use regular expressions to replace the comment content with empty. For text comments that may span multiple lines, take a line of structured query language text from the current queue to determine whether it can match the regular expressions at the beginning and end of the text comment. If both the beginning and end regular expressions are included, directly replace the beginning and end regular expressions and the comments in between with empty; if not, determine whether it can match the beginning regular expression of the text comment. If it can match, take the next line from the queue until it can match the ending regular expression of the text comment. After replacing the comment content with empty, write the structured query language text back to the original file. The regular expression can be " / \\*.*?\\* / ". Figure 4 A schematic diagram of removing comments in an embodiment.

[0068] You can also standardize the case of structured query language text. For example, if the source data definition language is ORACLE database, read the content in the structured query language text, convert it into uppercase, and then write it back to the original file. The specific implementation method is to use the readAllBytes() of the FILES class in JAVA, receive the address of the original file as a parameter, convert the read content into a String, and uppercase it, and use the FILES.write() method to write the converted content back to the original file.

[0069] In some embodiments of the present disclosure, searching for a matching target keyword from a dictionary tree based on the word includes:

[0070] Acquire an object name and a directory name, wherein the object name includes a text name of the structured query language, and the directory name includes a parent text name of the structured query language;

[0071] The object name and directory name are matched with the target keyword.

[0072] The text file name of the structured query language is the object name, and the name of the upper-level folder is the directory name. The directory name and object name are taken out separately, and the keywords matched in the dictionary tree are matched with the two and written into the file. The correspondence between the text and keywords of the structured query language is realized through the directory name and object name.

[0073] In some embodiments of the present disclosure, after searching for a matching target keyword from a dictionary tree based on the word, the method includes:

[0074] The target keyword is stored in a keyword list, wherein the keyword list includes an object name, a directory name, and a target keyword.

[0075] The processed keywords are stored in a list, where the first column is the object name, the second column is the directory name, and the third column is the matched keyword.

[0076] In some embodiments of the present disclosure, the method further includes:

[0077] De-duplication processing is performed on the keyword list to obtain a list without repeated keywords;

[0078] The list of non-repetitive keywords is stored in the target system.

[0079] The keywords in the keyword list are deduplicated to obtain a list of non-duplicate keywords, and the list of non-duplicate keywords is stored in the target system for compatibility analysis. The target system is a front-end and back-end combined system designed to facilitate users to store keywords.

[0080] In some embodiments of the present disclosure, the target system is used to store keywords of the source database and the target database;

[0081] Modify the compatibility features of the source database and the target database through the consistency of keyword features of the source database and the target database.

[0082] Figure 5 This is a schematic diagram of a newly added feature module in an embodiment. The database type can be selected and the features can be set. The newly added features can include Function, Data Type, Syntax, etc. The feature name can be filled in CREATE, SELECT, etc., and a corresponding description can be added for the feature.

[0083] Figure 6 This is a schematic diagram of a compatibility relationship mapping module in an embodiment. If the characteristics of the source database and the target database are completely consistent, compatible is selected. If they are not completely compatible and the target database needs to be modified to have the same characteristics as the source database, compatible after modification is selected. If the target database has exactly the same characteristics as the source database, incompatible is selected. A corresponding description may also be given to the compatibility characteristics.

[0084] 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.

[0085] Based on the same inventive concept, the disclosed embodiment also provides a device for searching keywords in a database for implementing the above-mentioned method for searching keywords in a database. 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 the embodiment of the device for searching keywords in a database provided below can refer to the limitations of the method for searching keywords in a database above, and will not be repeated here.

[0086] The device may include a system (including a distributed system), software (application), module, component, server, client, etc. that uses the method described in the embodiments of this specification and is combined with necessary implementation hardware. Based on the same innovative concept, the device in one or more embodiments provided in the embodiments of the present disclosure is as described in the following embodiments. Since the implementation scheme and method of the device to solve the problem are similar, the implementation of the specific device in the embodiments of this specification can refer to the implementation of the aforementioned method, and the repetitions will not be repeated. As used below, the term "unit" or "module" can be a combination of software and / or hardware that implements a predetermined function. Although the device described in the following embodiments is preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceived.

[0087] In one embodiment, Figure 7 As shown, a device 700 for searching keywords in a database is provided. The device may be the aforementioned server, or a module, component, device, unit, etc. integrated in the server. The device 700 may include:

[0088] An acquisition module 702 is used to acquire a text of a structured query language of a target database;

[0089] The storage module 704 is used to store the text of the structured query language in a blocking queue;

[0090] The matching module 706 is used to read the text of the target structured query language in the blocking queue based on the threads in the preset thread pool, divide the text of the target structured query language into multiple words, and search for matching target keywords from the dictionary tree based on the words, and the dictionary tree includes multiple keywords.

[0091] In one embodiment, after the thread in the preset thread pool reads the target structured query language text in the blocking queue, the device includes:

[0092] The target structured query language text of the target row is obtained. If the target structured query language text of the target row includes a start regular expression of a text comment, the target structured query language text of the next row of the target row is obtained until an end regular expression of the text comment is found, and the comment content is replaced with empty text.

[0093] In one embodiment, searching for a matching target keyword from a dictionary tree based on the word includes:

[0094] Acquire an object name and a directory name, wherein the object name includes a text name of the structured query language, and the directory name includes a parent text name of the structured query language;

[0095] The object name and directory name are matched with the target keyword.

[0096] In one embodiment, after finding a matching target keyword from a dictionary tree based on the word, the device includes:

[0097] The target keyword is stored in a keyword list, wherein the keyword list includes an object name, a directory name, and a target keyword.

[0098] In one embodiment, the device further comprises:

[0099] De-duplication processing is performed on the keyword list to obtain a list without repeated keywords;

[0100] The list of non-repetitive keywords is stored in the target system.

[0101] In one of the embodiments, the target system is used to store keywords of the source database and the target database;

[0102] Modify the compatibility features of the source database and the target database through the consistency of keyword features of the source database and the target database.

[0103] Regarding the device in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.

[0104] Each module in the above-mentioned device for searching keywords in a database 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 operations corresponding to each module above.

[0105] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 8 As shown. The computer device includes a processor, a memory and a network interface connected through a system bus. Among them, 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 keywords. The network 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 method for searching keywords in a database is implemented.

[0106] In one embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as follows: Fig. 9 As shown. The computer device includes a processor, a memory, a communication interface, a display screen and an input device connected through a system bus. Among them, 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 and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be achieved through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. When the computer program is executed by the processor, a method for searching keywords in a database is implemented. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covered on the display screen, or a key, trackball or touchpad set on the computer device housing, or an external keyboard, touchpad or mouse, etc.

[0107] Those skilled in the art will understand that Figure 8 , Fig. 9 The structure shown in the figure is only a block diagram of a part of the structure related to the scheme of the present disclosure, and does not constitute a limitation on the computer device to which the scheme of the present disclosure 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.

[0108] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the method described in any embodiment of the present disclosure is implemented.

[0109] In one embodiment, a computer program product is provided, including a computer program, which implements the method described in any embodiment of the present disclosure when executed by a processor.

[0110] 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 by the present disclosure can include at least one of non-volatile 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), magnetoresistive 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 by the present disclosure 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 by the present disclosure may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, etc., but are not limited to this.

[0111] 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 specification.

[0112] The above-described embodiments only express several implementation methods of the present disclosure, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present invention. It should be pointed out 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 disclosure, and these all belong to the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure shall be subject to the attached claims.

Claims

1. A method for searching keywords in a database, characterized in that: The method comprises: Obtaining the text of the structured query language of the target database; Storing the text of the structured query language in a blocking queue; Based on the threads in the preset thread pool, the target structured query language text in the blocking queue is read, the target structured query language text is divided into multiple words, and matching target keywords are found from the dictionary tree based on the words, and the dictionary tree includes multiple keywords.

2. The method according to claim 1, characterized in that After the threads in the preset thread pool read the target structured query language text in the blocking queue, the method includes: The target structured query language text of the target row is obtained. If the target structured query language text of the target row includes a start regular expression of a text comment, the target structured query language text of the next row of the target row is obtained until an end regular expression of the text comment is found, and the comment content is replaced with empty text.

3. The method according to claim 1, characterized in that The step of searching for a matching target keyword from the dictionary tree based on the word includes: Acquire an object name and a directory name, wherein the object name includes a text name of the structured query language, and the directory name includes a parent text name of the structured query language; The object name and directory name are matched with the target keyword.

4. The method according to claim 1, characterized in that After finding a matching target keyword from the dictionary tree based on the word, the method includes: The target keyword is stored in a keyword list, wherein the keyword list includes an object name, a directory name, and a target keyword.

5. The method according to claim 4, characterized in that The method further comprises: De-duplication processing is performed on the keyword list to obtain a list without repeated keywords; The list of non-repetitive keywords is stored in the target system.

6. The method according to claim 5, characterized in that The target system is used to store keywords of the source database and the target database; Modify the compatibility features of the source database and the target database through the consistency of keyword features of the source database and the target database.

7. A device for searching keywords in a database, characterized in that: The device comprises: An acquisition module, used for acquiring a text of a structured query language of a target database; A storage module, used for storing the text of the structured query language in a blocking queue; The matching module is used to read the text of the target structured query language in the blocking queue based on the threads in the preset thread pool, divide the text of the target structured query language into multiple words, and search for matching target keywords from the dictionary tree based on the words, and the dictionary tree includes multiple keywords.

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.

Images