A search statement processing method

Abstract

The present invention relates to a search statement processing method, the method comprising: S1: extracting a search word queue from a search statement; S2: obtaining a user search word queue based on a user search log; S3: supplementing the search word queue to obtain a supplementary search word queue for searching. The present invention can improve the search efficiency starting from the search statement itself, perform personalized processing on the original search statement, and consider the characteristics of the user itself in multiple dimensions during the personalized processing process, so as to obtain an optimized search statement, which can truly reflect the needs of the user itself, greatly improve the search efficiency, and reduce the consumption of system resources.

Description

[Technical field]

[0001] The invention belongs to the field of search engines, and in particular relates to a search statement processing method. [Background technology]

[0002] When searching for information, after the search engine retrieves the search results in the form of a page from the database based on the search terms, it does not immediately display the search results to the user. Instead, it sorts the search results in descending order based on the correlation between the search results and the search terms, and displays the sorted search results to the user. This operation of using the correlation with the search terms as the basis for sorting is called sorting based on basic weights. However, the search schemes in the prior art cannot reflect the search needs of users, and there are still problems such as low search efficiency and excessive system resources occupied by the search process. Based on the above problems, there is an urgent need for a new search statement processing method. The present invention can improve the search efficiency based on the search statement itself, personalize the original search statement, and consider the characteristics of the user itself in multiple dimensions during the personalization process, so as to obtain an optimized search statement, which can truly reflect the needs of the user itself, greatly improve the search efficiency, and reduce the consumption of system resources. [Summary of the invention]

[0003] In order to solve the above problems in the prior art, the present invention proposes a search statement processing method, which includes the following steps:

[0004] S1: extract search term queue from search statement;

[0005] S2: Obtain user search term queue based on user search log;

[0006] S3: Supplement the search term queue to obtain a supplementary search term queue for searching.

[0007] Furthermore, the step S2 is specifically to determine the agreed time length based on the user parameters, and obtain the user search word queue within the agreed time length based on the user search log.

[0008] Furthermore, determining the agreed time length based on user parameters is specifically: obtaining user parameters, obtaining a benchmark agreed time length corresponding to the first user parameters based on first user parameters; and adjusting the benchmark agreed time length based on second user parameters to obtain the agreed time length.

[0009] Furthermore, the obtaining of the benchmark agreed time length corresponding to the first user parameter based on the first user parameter is specifically: searching the association relationship based on the parameter value of the first user parameter, and obtaining the benchmark agreed time length in the association relationship entries that are consistent with all the first user parameters.

[0010] Furthermore, all the first user parameters are consistent, specifically: the parameter values ​​of all the first user parameters are completely equal or the parameter values ​​of the first user parameters are approximately equal.

[0011] Furthermore, the parameter values ​​of the first user parameters are substantially equal, specifically: a part of the first user parameters are completely equal and another part are substantially equal.

[0012] Furthermore, the substantially equal refers to that an absolute value of a difference between a parameter value of the first user parameter and a parameter value of a corresponding parameter in the association relationship entry is within a preset range.

[0013] Furthermore, the association relationship is stored in a third-party server in the form of an association relationship table.

[0014] The beneficial effects of the present invention include: being able to improve search efficiency based on the search statement itself, personalizing the original search statement, and considering the user's own characteristics in multiple dimensions during the personalization process to obtain optimized search statements that can truly reflect the user's own needs, greatly improving search efficiency, and reducing the consumption of system resources.

Brief Description of the Drawings

[0015] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of the present application, but do not constitute an improper limitation of the present invention. In the drawings:

[0016] Figure 1 It is a flowchart of the search statement processing method of the present invention. [Specific implementation method]

[0017] The present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments, wherein the illustrative embodiments and descriptions are only used to explain the present invention but are not intended to limit the present invention.

[0018] A search statement processing method used in the present invention is described in detail, and the method comprises the following steps:

[0019] S1: extracting a search term queue from a user search statement, specifically: storing one or more search terms contained in the search statement content into the search term queue in the order in which they appear in the search statement to form a search term queue;

[0020] The order of appearance in the search statement is specifically: the order of appearance in the grammatical structure specified in the search statement; for example: subject-verb-object order, etc.

[0021] S2: obtaining a user search term queue based on the user search log, specifically: determining an agreed time length based on user parameters, and obtaining a user search term queue within the agreed time length based on the user search log;

[0022] Preferably: the user search log includes multiple user search statements and their corresponding user search word queues;

[0023] The determining of the agreed time length based on the user parameters specifically comprises: obtaining the user parameters, obtaining a reference agreed time length corresponding to the first user parameters based on the first user parameters; and adjusting the reference agreed time length based on the second user parameters to obtain the agreed time length;

[0024] The acquiring, based on the first user parameter, the benchmark agreed time length corresponding to the first user parameter, specifically comprises: the first user parameter includes: age, gender, and location; pre-saving the association relationship between the first user parameter and the benchmark agreed time length; searching the association relationship based on the parameter value of the first user parameter, and acquiring the benchmark agreed time length in the association relationship entries in which all the first user parameters are consistent;

[0025] All the first user parameters are consistent, specifically: the parameter values ​​of all the first user parameters are completely equal or the parameter values ​​of the first user parameters are approximately equal;

[0026] The parameter values ​​of the first user parameters are substantially equal, specifically: a part of the first user parameters is completely equal and another part is substantially equal; preferably: the one part is gender and location, and the other part is age;

[0027] The "roughly equal" specifically means that: the absolute value of the difference between the parameter value of the first user parameter and the parameter value of the corresponding parameter in the association relationship entry is within a preset range; the preset range is specified by the user; the adjustment range is increased or decreased by adjusting the preset range; for example; the user's main parameter is 32 years old, and the corresponding parameter value in the association relationship entry is 31, and the preset range is 1 year old, then the parameter values ​​of the user's main parameter are roughly equal, and thus the parameter values ​​of the first user parameter are roughly equal;

[0028] Preferably: the association relationship is stored on a cloud server; the association relationship is obtained based on big data statistical analysis;

[0029] Preferably: the association relationship is stored in the form of an association relationship table on a third-party server;

[0030] Preferably: the association relationship is stored in a distributed database;

[0031] Preferably: the association relationship is stored on different physical servers according to the location of the user;

[0032] The adjustment of the agreed time length based on the second user parameter is specifically as follows: the second user parameter includes: the average number of user queries per day N, the average daily online time of the user T, and the user's online age A; obtaining the benchmark agreed time length BST, and calculating the agreed time length ST by the following formula;

[0033]

[0034] Among them: Bs_T is the adjustment value of the average daily Internet time, and BS_A is the adjustment value of the user's Internet age;

[0035] Preferably: the adjustment value is obtained based on the big data analysis of Internet users' Internet surfing situation in that year;

[0036] S3: Supplement the search term queue to obtain a supplementary search term queue; specifically: supplement the search term queue based on the user search term queue within an agreed time length;

[0037] The method of supplementing the search term queue based on the user search term queue within the agreed time length is specifically as follows: obtaining a user search term queue that completely includes all the search terms in the search term queue, selecting a user search term queue with the longest length from the user search term queue, and supplementing the search term queue based on the user search term queue with the longest length to generate a supplemented search queue;

[0038] The supplementing of the search word queue based on the longest user search word queue is specifically: supplementing the search words that are not included in the search word queue but included in the longest user search word queue to the tail of the search word queue;

[0039] S4: Search based on the supplementary search queue.

[0040] The above description is only a preferred embodiment of the present invention, so all equivalent changes or modifications made according to the structure, characteristics and principles described in the scope of the patent application of the present invention are included in the scope of the patent application of the present invention.

Claims

1. A search statement processing method, characterized in that: The method comprises the following steps: S1: extract search term queue from search statement; S2: Obtain user search term queue based on user search log; S3: Supplement the search term queue to obtain a supplementary search term queue for searching; The step S2 specifically includes determining the agreed time length based on the user parameters, and obtaining the user search term queue within the agreed time length based on the user search log; The determining of the agreed time length based on the user parameters specifically comprises: obtaining the user parameters, obtaining a reference agreed time length corresponding to the first user parameters based on the first user parameters; and adjusting the reference agreed time length based on the second user parameters to obtain the agreed time length; The adjusting of the benchmark agreed time length based on the second user parameter is specifically as follows: the second user parameter includes: the average number of user queries per day N, the average daily online time of the user T, and the user's online age A; obtaining the benchmark agreed time length BST, and calculating the agreed time length ST by the following formula; Among them: BS_T is the adjustment value of the average daily Internet access time, and BS_A is the adjustment value of the user's Internet age; The step S3 specifically includes: supplementing the search word queue based on the user search word queue within the agreed time length; The method of supplementing the search word queue based on the user search word queue within the agreed time length is specifically as follows: obtaining a user search word queue that completely includes all the search words in the search word queue, selecting a user search word queue with the longest length from the user search word queue, and supplementing the search word queue based on the user search word queue with the longest length to generate a supplemented search word queue; The supplementing of the search term queue based on the longest user search term queue is specifically: supplementing the search terms that are not included in the search term queue but included in the longest user search term queue to the tail of the search term queue.

2. The search statement processing method according to claim 1, characterized in that: The obtaining of the benchmark agreed time length corresponding to the first user parameter based on the first user parameter is specifically: searching for an association relationship based on the parameter value of the first user parameter, and obtaining the benchmark agreed time length in the association relationship entries that are consistent with all the first user parameters.

3. The search statement processing method according to claim 2, characterized in that: All the first user parameters are consistent, specifically: the parameter values ​​of all the first user parameters are completely equal or the parameter values ​​of the first user parameters are approximately equal; The substantially equal specifically means that the absolute value of the difference between the parameter value of the first user parameter and the parameter value of the corresponding parameter in the association relationship entry is within a preset range.

4. The search statement processing method according to claim 3, characterized in that: The parameter values ​​of the first user parameters are substantially equal, specifically: a part of the first user parameters are completely equal and another part is substantially equal.

5. The search statement processing method according to claim 3, characterized in that: The association relationship is stored in the form of an association relationship table on a third-party server.

Images