CN108874827B

CN108874827B - Searching method and related device

Info

Publication number: CN108874827B
Application number: CN201710334175.XA
Authority: CN
Inventors: 王俊豪; 林建素
Original assignee: Beijing Sogou Technology Development Co Ltd
Current assignee: Beijing Sogou Technology Development Co Ltd
Priority date: 2017-05-12
Filing date: 2017-05-12
Publication date: 2021-04-20
Anticipated expiration: 2037-05-12
Also published as: CN108874827A

Abstract

The application provides a searching method and a related device, wherein the method comprises the following steps: acquiring a user search request, wherein the user search request comprises a current query word input by a user in the current search process; querying historical query words input by a user in at least one historical search process; determining a historical query word which meets a preset association relation with the current query word from at least one historical query word as an associated query word; and acquiring the associated search results retrieved by taking the current query word and the associated query word as the common query word so as to display the associated search results to the user on a search result page. Therefore, in the embodiment of the invention, the relevance between the current search process and the historical search process can be considered instead of considering the query words input in the search process once, so that the search result is more suitable for the user requirement, the search efficiency is improved by reducing the search times of the user, and the load on the server is reduced.

Description

Searching method and related device

Technical Field

The present application relates to the field of internet, and in particular, to a search method and related apparatus.

Background

With the rapid development of information technology, the amount of information carried by the internet is increasing. In order to enable people to quickly locate information required by users from a large amount of information, search technologies are widely developed and applied.

Currently, a common search process includes: and acquiring a query word input by a user, and searching a corresponding search result according to the query word. For example, a user enters the query word "air ticket" in a search engine and triggers a search, and the search engine searches a large amount of internet information for search results related to the "air ticket", such as websites, applications, and the like related to the "air ticket".

Since the above-mentioned search process is based on the query words input by the user in one search process, the search results cover multiple aspects, and the user may only need the search results of one of the aspects. For example, a user enters "airline tickets" in a search process, but what is actually needed is airline ticket information related to a certain location, e.g., "three". Obviously, the searching process causes that the user needs to perform one or more repeated searches to locate the information required by the user, which not only causes lower searching efficiency, but also causes greater burden to the server.

Disclosure of Invention

The technical problem to be solved by the application is to provide a searching method and a related device, which can enable a search result to better meet the user requirement, thereby improving the searching efficiency and reducing the burden of a server.

Therefore, the technical scheme for solving the technical problem is as follows:

the application provides a search method, which comprises the following steps:

acquiring a user search request, wherein the user search request comprises a current query word input by a user in the current search process;

querying historical query words input by a user in at least one historical search process;

determining a historical query word which meets a preset association relation with the current query word from at least one historical query word as an associated query word;

and acquiring the associated search results retrieved by taking the current query word and the associated query word as the common query word so as to display the associated search results to the user on a search result page.

Optionally, the method further includes:

and acquiring independent search results retrieved by taking the current query word as an independent query word so as to be displayed to a user on a search result page together with the associated search results.

Optionally, the search result items included in the associated search results and the search result items included in the independent search results are displayed in a mixed ranking manner in the search result page;

alternatively, the first and second electrodes may be,

the associated search results are displayed in preference to the independent search results.

Optionally, the determining, from the at least one historical query term, a historical query term that satisfies a preset association relationship with the current query term includes:

acquiring a preset mapping relation table, wherein the mapping relation table stores the association relation among query words; forming a query pair by each historical query term and the current query term respectively;

matching each query pair with the incidence relation in the mapping relation table respectively, and determining the query pair matched with the incidence relation in the mapping relation table;

and taking the historical query word corresponding to the matched query pair as the historical query word meeting the preset incidence relation with the current query word.

acquiring a preset mapping relation table, wherein the mapping relation table stores the association relation between the categories of the query words;

obtaining the category to which each historical query word belongs and the category to which the current query word belongs;

respectively combining the category to which each historical query word belongs and the category to which the current query word belongs to form a query pair;

Optionally, the association relationship stored in the mapping relationship table is obtained by any one or more of the following manners:

the method comprises the steps of obtaining according to related input query words in a searching process, obtaining according to successively input query words in an adjacent searching process, obtaining according to business data in webpage information, and obtaining through manual setting.

respectively acquiring each historical query word and the current query word as associated search results retrieved by a common query word;

obtaining the current query word as an independent search result retrieved by an independent query word;

and comparing the associated search results corresponding to each historical query word with the independent search results respectively, and determining the historical query word corresponding to the associated search results which are more in line with the expectation of the user as the historical query word meeting the preset association relation with the current query word.

respectively acquiring time difference between the trigger search time corresponding to each historical query word and the trigger search time corresponding to the current query word, and respectively comparing each time difference with a preset time threshold;

and determining the historical query word corresponding to the time difference smaller than the preset time threshold value as the historical query word meeting the preset association relation with the current query word.

Optionally, the user search request further includes a user identity;

the method for inquiring the historical inquiry words input by the user in at least one historical search process comprises the following steps:

and querying historical query words input by the user in at least one historical search process according to the user identity.

The application provides a search apparatus, including:

the first acquisition module is used for acquiring a user search request, wherein the user search request comprises a current query word input by a user in the current search process;

the query module is used for querying historical query words input by a user in at least one historical search process;

the determining module is used for determining a historical query word which meets a preset association relation with the current query word from at least one historical query word as an associated query word;

and the second acquisition module is used for acquiring the related search results retrieved by taking the current query term and the related query terms as common query terms so as to display the related search results to the user on a search result page.

Optionally, the apparatus further comprises:

and the third acquisition module is used for acquiring the independent search result retrieved by taking the current query word as the independent query word so as to be displayed to the user on the search result page together with the associated search result.

Optionally, the apparatus further comprises:

the first display module is used for displaying search result items included by the related search results and search result items included by the independent search results in a mixed sorting mode in the search result page;

alternatively, the first and second electrodes may be,

and the second display module is used for displaying the associated search result in preference to the independent search result.

Optionally, the determining module may include:

the device comprises a first relation table acquisition unit, a second relation table acquisition unit and a mapping relation calculation unit, wherein the first relation table acquisition unit is used for acquiring a preset mapping relation table, and the mapping relation table stores the association relation among query words;

the first matching unit is used for forming a query pair by each historical query word and the current query word respectively, matching each query pair with the incidence relation in the mapping relation table respectively and determining the query pair matched with the incidence relation in the mapping relation table;

and the first determining unit is used for taking the historical query word corresponding to the matched query pair as the historical query word meeting the preset incidence relation with the current query word.

Optionally, the determining module may include:

the second relation table acquiring unit is used for acquiring a preset mapping relation table, and the mapping relation table stores the association relation between the categories of the query words;

the attribute acquisition unit is used for acquiring the category to which each historical query word belongs and the category to which the current query word belongs;

the second matching unit is used for forming query pairs by the category to which each historical query word belongs and the category to which the current query word belongs, matching the query pairs with the incidence relation in the mapping relation table respectively, and determining the query pairs matched with the incidence relation in the mapping relation table;

and the second determining unit is used for taking the historical query word corresponding to the matched query pair as the historical query word meeting the preset incidence relation with the current query word.

Optionally, the determining module may include:

the associated result acquiring unit is used for respectively acquiring associated search results retrieved by taking each historical query word and the current query word as common query words;

the independent result acquisition unit is used for acquiring the current query word as an independent search result retrieved by the independent query word;

the first comparison unit is used for comparing the associated search results corresponding to each historical query word with the independent search results respectively;

and the third determining unit is used for determining the historical query word corresponding to the associated search result which is more in line with the expectation of the user as the historical query word which meets the preset association relation with the current query word.

Optionally, the determining module may include:

the time difference acquisition unit is used for respectively acquiring the time difference between the trigger search time corresponding to each historical query term and the trigger search time corresponding to the current query term;

the second comparison unit is used for comparing each time difference with a preset time threshold value respectively;

and the fourth determining unit is used for determining the historical query word corresponding to the time difference smaller than the preset time threshold as the historical query word meeting the preset association relation with the current query word.

Optionally, the user search request further includes a user identity;

the query module is specifically configured to query, according to the user identity, a historical query term input by the user in at least one historical search process.

An apparatus for searching is provided that includes a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:

The present application also provides a machine-readable medium having stored thereon instructions, which when executed by one or more processors, cause an apparatus to perform a search method as shown in the first aspect.

According to the technical scheme, after the user search request is obtained, the current query word input by the user in the current search process and included in the user search request is obtained, the historical query word input by the user in at least one historical search process is queried, when the historical query word meeting the preset association relation with the current query word is determined to exist, namely the historical search process relevant to the current search process is determined to exist, and the current query word and the associated search result corresponding to the historical query word meeting the preset association relation are further obtained. Therefore, in the embodiment of the invention, the relevance between the current search process and the historical search process can be considered instead of considering the query words input in the search process once, so that the search result is more suitable for the user requirement, the search efficiency is improved by reducing the search times of the user, and the load on the server is reduced.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art according to the drawings.

Fig. 1 is a schematic flow chart of an embodiment of a method provided in an embodiment of the present application;

FIG. 2 is a schematic structural diagram of an embodiment of an apparatus according to an embodiment of the present disclosure;

FIG. 3 is a block diagram illustrating an apparatus for searching in accordance with an exemplary embodiment;

fig. 4 is a schematic structural diagram of a server in an embodiment of the present invention.

Detailed Description

In the search process of the prior art, only the query words input by a user in one search process are considered, so that the search result covers multiple aspects. In practical application, multiple search processes of a user may have relevance, but the relevance is not considered in the prior art, and only a search result corresponding to a query word input in one search process is given, so that the user needs to continuously improve the input query word to locate user demand information.

For example, assuming that during the first search process, the user enters "three" in the input box of the search engine, and triggers a search by clicking the search key, the search engine will search out a large number of websites, applications, etc. related to "three" such as "three free lines", "three city encyclopedia", "three city map", etc. In the second search process, the user inputs the air ticket after deleting the third letter in the input box and triggers the search, and a large number of websites, applications and the like related to the air ticket are searched in the search engine without considering whether the previous search process and the next search process are related, such as air ticket inquiry, air ticket reservation, air ticket application and the like. However, in practice what the user may need is "three-in" related ticket information. Obviously, the searching process in the prior art cannot quickly locate the information required by the user, and the user needs to perform repeated searching once or many times, which not only results in low searching efficiency, but also causes great burden to the server.

The technical problem to be solved by the application is to provide a searching method and a related device, which can consider the relevance between the current searching process and the historical searching process, so that the searching result is more suitable for the user requirement, the searching times of the user are reduced, the searching efficiency is improved, and the burden of a server is reduced.

In order to make those skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

Referring to fig. 1, a method embodiment of a search method is provided in the present application.

The method of the embodiment comprises the following steps:

s101: the method comprises the steps of obtaining a user search request, wherein the user search request comprises current query words input by a user in the current search process.

The embodiment can be specifically applied to a server, in the current search process, a user inputs a current query word in a terminal by using input equipment such as a keyboard, a touch screen, a voice receiving device and the like and triggers search, and the terminal generates a user search request including the current query word and sends the user search request to the server. For example, when a user inputs a current query word "air ticket" in an input box of a search engine, the terminal generates a search request including the current query word "air ticket" and transmits the search request to the server.

The embodiment may also be specifically applied to a terminal, and after a user inputs a current query term and triggers a search in a current search process, the terminal may obtain a user search request including the current query term.

In this embodiment, the character or the character string input by the user in the input box of the search engine may be directly used as the current query word, or the character string input by the user may be subjected to preprocessing such as error correction or word segmentation and then used as the current query word, or a core keyword may be extracted from the character or the character string input by the user and used as the current query word, which is not limited in the embodiment of the present invention. Wherein, the current search process refers to any one search process of the user.

S102: and querying historical query words input by the user in at least one historical search process.

In the embodiment of the invention, after a server or a terminal acquires a user search request, the server or the terminal searches according to a current query word in the user search request and acquires a search result, and simultaneously inquires a historical query word input by the user in at least one historical search process so as to judge whether the historical query word is associated with the current query word, and if so, acquires an associated search result according to the associated historical query word and the current query word. The at least one historical search process refers to at least one search process occurring before the current search process, and may specifically be one or more search processes before the current search process by the user, for example, the user searches N times consecutively, the last search corresponds to the current search process, and the first N-1 searches correspond to N-1 historical search processes, where N is greater than 1.

For example, assume that during the first search, the user enters "three" in the input box of the search engine and triggers the search by clicking the search key. In the second search process, the user inputs the air ticket after deleting the third letter in the input box, and the search is triggered by clicking. It can be determined that the second search process (i.e., the process of searching by inputting "ticket" by the user) is the current search process, the current query word is "ticket", and the first search process (i.e., the process of searching by inputting "three" by the user) is the history search process, and the history query word is "three".

In order to determine whether the current search process and the historical search process are the search processes executed by the same user, the user identity may be determined according to a user identity such as a user login account or a terminal identity. Specifically, the user search request may further include a user identity; in step S102, a history query term input by the user in at least one history search process is queried according to the user identity. For example, a user performs a plurality of search processes successively at the same terminal or different terminals by using the same user login account, and can query the historical query words input by the user in the historical search process by using the user login account; for another example, the user may perform a plurality of search processes successively using the same terminal, and may query the historical query terms input by the user in the historical search process using the same terminal identifier.

S103: and determining a historical query word which meets a preset association relation with the current query word from at least one historical query word as an associated query word.

In the embodiment of the present invention, for the historical query terms input by the user in at least one historical search process obtained by querying in step S102, an association relationship between each historical query term and the current query term is obtained, and it is determined whether the association relationship between each historical query term and the current query term satisfies a preset association relationship, so that the historical query terms satisfying the preset association relationship with the current query term are determined and used as the association query terms.

S104: and acquiring the associated search results retrieved by taking the current query word and the associated query word as the common query word so as to display the associated search results to the user on a search result page.

Wherein the associated search results are for display to a user in a search results page. For example, when the present embodiment is specifically used for a terminal, after acquiring the associated search result in step S104, the terminal may directly display the associated search result in a search result page; for another example, when the present embodiment is specifically used in a server, after obtaining the associated search result in step S104, the server may send the associated search result to a display device, and the display device displays the associated search result in a search result page, where the display device may be a terminal that generates the user search request.

In the embodiment of the application, if the query word meeting the preset association relation with the current query word exists in the historical query words, namely the associated query word, the existence of the historical search process associated with the current search process is indicated, so that the associated search is triggered, namely the associated search result retrieved by taking the current query word and the associated query word as the common query word is obtained, compared with the independent search result retrieved by taking the current query word as the independent query word, the associated search result can better meet the requirements of a user, the search frequency of the user can be reduced, the search efficiency is improved, and the burden of a server is reduced.

In the embodiment of the application, if there is no query word which satisfies a preset association relationship with the current query word in the historical query words, it is indicated that there is no historical search process which has an association with the current search process, and therefore, the association search is not triggered, and only the search result retrieved by taking the current query word as a separate query word needs to be obtained and displayed in the search result page.

For example, when the current query word is "air ticket" and the historical query word is "third in", if it is determined that the "third in" and the "air ticket" satisfy the preset association relationship, the server obtains the associated search results corresponding to the "third in" and the "air ticket" at the same time and returns the associated search results to the terminal for displaying, so that the user can directly obtain the third in air ticket information. And if the fact that the historical query words meeting the preset association relation with the air tickets do not exist is determined, the server obtains search results corresponding to the air tickets independently and returns the search results to the terminal for displaying.

According to the technical scheme, after the user search request is obtained, the current query word input by the user in the current search process in the user search request is obtained, the search is carried out according to the current query word, meanwhile, the historical query word input by the user in at least one historical search process is queried, when the historical query word meeting the preset association relation with the current query word is determined to exist, namely the historical search process relevant to the current search process is determined to exist, the associated search results corresponding to the current query word and the historical query word meeting the preset association relation are further obtained, and the associated search results and the search results corresponding to the current query word are displayed to the user in a search result page. Therefore, in the embodiment of the invention, the relevance between the current search process and the historical search process can be considered instead of considering the query words input in the search process once, so that the search result is more suitable for the user requirement, the search efficiency is improved by reducing the search times of the user, and the load of the server is reduced.

Optionally, while displaying the associated search result obtained in step S104, the embodiment of the present invention may further obtain an independent search result retrieved by using the current query term as an independent query term, so that the independent search result and the associated search result are displayed together to the user on the search result page. When the associated search result and the independent search result are displayed in a search result page in a sorted manner, the search result items included in the associated search result and the search result items included in the independent search result are displayed in the search result page in a mixed manner in a sorted manner, or because the associated search result is more suitable for the user requirement, the associated search result can be displayed in a sorted manner before the independent search result.

For example, suppose a user enters "three" in an input box of a search engine and triggers a search by clicking a search key, a large number of websites, applications, etc. related to "three" are searched, such as "three free lines", "three city encyclopedia", "three city map", etc. Then, after deleting the third letter in the input box, the user inputs the air ticket and triggers the search, and the current query word can be determined to be the air ticket. The process of inputting "three" by the user for searching is the historical searching process corresponding to the current search (inputting "air ticket" for searching), and "three" is the historical query word. At this time, if it is determined that the historical query word "three" and the current query word "air ticket" satisfy the preset association relationship, the associated search result using "three" and "air ticket" as the common query word may be obtained, and the associated search result using "three" and "air ticket" as the common query word is preferentially displayed in the search result page, and then "air ticket" is displayed as the search result retrieved by the individual query word.

One implementation of causing the display of the associated search results in an order that precedes the independent search results is described below. Since the retrieval results can be displayed in a sorted manner according to the degree of association with the query term, in order to enable the associated search results to be displayed in a sorted manner prior to the independent search results, the server may set different weight values, calculate the degree of association of the associated retrieval results according to a higher weight value, calculate the degree of association of the independent retrieval results according to a lower weight value, and display in a sorted manner according to the calculated degree of association. Specifically, the method further comprises: acquiring the association degree of the association retrieval result at least according to a first weight value as a first association degree; obtaining the association degree of the independent retrieval result at least according to a second weight value as a second association degree; the first relevance degree and the second relevance degree are used for displaying the retrieval results in a sorting mode, and the first weight value is larger than the second weight value. When the embodiment is applied to the server, the server may send the calculated first relevance degree and the calculated second relevance degree to the display device, and the display device performs ranking display on the associated search result and the independent search result according to the first relevance degree and the second relevance degree.

It should be noted that, in the embodiment of the present invention, only the associated search result may be displayed in the search result page, and the independent search result retrieved by using the current query term as the independent query term is not displayed, which is not limited in this respect.

Optionally, in the embodiment of the present invention, the user may turn on or turn off the association search function, if it is determined that the user has turned on the association search function, the current query term and the association search result corresponding to the association query term are obtained, and if it is determined that the user has not turned on the association search function, the independent search result corresponding to the current query term alone is obtained without obtaining the association search result.

In the embodiment of the invention, whether the user needs to trigger the association search is determined by determining whether the historical query words comprise the association query words meeting the preset association relation with the current query word. Three specific implementations of determining whether to include an associated query term are provided below. It is to be understood that the following is only exemplary of the above-described implementations and is not intended to limit the embodiments of the present invention.

In one implementation, whether the associated query term is included may be determined through a preset mapping relation table.

In the embodiment of the invention, a mapping relation table can be stored in advance, the mapping relation table stores the association relation between the query words, and the mapping relation table is queried according to the current query word and the historical query word, so that whether the historical query word meeting the preset association relation with the current query word exists in the historical query words can be determined. In specific implementation, each historical query term and the current query term form a query pair respectively; matching each query pair with the incidence relation in the mapping relation table respectively, and determining the query pair matched with the incidence relation in the mapping relation table; and taking the historical query word corresponding to the matched query pair as the historical query word meeting the preset incidence relation with the current query word.

For example, when the current query word is "air ticket", and the historical query word is "third-in", the "air ticket" and the "third-in" form a query pair, and if the query is performed on the mapping relationship table and includes the association relationship corresponding to the "air ticket" and the "third-in", the query pair is matched with the association relationship in the mapping relationship table, and it can be determined that the "air ticket" and the "third-in" satisfy the preset association relationship.

Considering the limitations of storage capacity and query speed, it is difficult to store the association relationship between query terms in a mapping relationship table, so that the association relationship between categories to which the query terms belong can be stored in the mapping relationship table, and the mapping relationship table is queried according to the categories to which the current query term and the historical query term respectively belong, so that whether the historical query term meeting the preset association relationship with the current query term exists in the historical query terms can be determined. During specific implementation, the category to which each historical query word belongs and the category to which the current query word belongs are obtained; respectively combining the category of each historical query word with the category of the current query word to form a query pair; matching each query pair with the incidence relation in the mapping relation table respectively, and determining the query pair matched with the incidence relation in the mapping relation table; and taking the historical query word corresponding to the matched query pair as the historical query word meeting the preset incidence relation with the current query word.

For example, when the current query word is "air ticket", and the historical query word is "third in", it can be determined that the category to which the historical query word is "third in" belongs is "place name", and the category to which the current query word is "air ticket" belongs is "ticket", and the "place name" and "ticket" constitute a query pair, and if the mapping relationship table includes an association relationship corresponding to the "place name" and the "ticket", it is determined that the query pair matches with the association relationship in the mapping relationship table, and then it is determined that the "air ticket" and the "third in" satisfy the preset association relationship. Therefore, the method can greatly reduce the data amount stored in the mapping relation table, thereby improving the query speed and improving the search accuracy by increasing the search coverage.

It should be noted that, in the embodiment of the present application, the two manners may also be used in combination, and in the specific implementation, the association relationship between the query terms and the association relationship between the categories to which the query terms belong may be stored in the mapping relationship table, and when any association relationship is matched, the query terms meeting the preset association relationship may be determined.

In this embodiment, the mapping relationship table may be pre-stored in the server, and the server determines, according to the stored mapping relationship table, a query term that satisfies a preset association relationship; the mapping relation table may also be pre-stored in the terminal, for example, the server may periodically push the mapping relation table to the terminal, and the terminal determines the query term meeting the preset association relation according to the locally stored mapping relation table, thereby enabling to implement offline operation.

Several ways of obtaining the association stored in the mapping relationship table are described below, and the following ways may be used alone or in combination of any two or more.

First, it can be obtained by counting the user search behavior.

For example, in a search process, in order to obtain a search result that meets the user's expectations, a user may input multiple query terms in a correlated manner, and the correlation between the query terms may be obtained according to the query terms input in the correlated manner. For example, in one search process, a user inputs an air ticket and Beijing in a search input box simultaneously and triggers a search, which indicates that the air ticket and the Beijing meet the association relationship. Therefore, a large number of search terms which are input in a relevant manner in the search process can be counted through a machine learning mode and the like, and the relevance relation which is met among the search terms or among the categories to which the search terms belong can be obtained.

For another example, the association relationship between query terms may be obtained according to the query terms input successively in the adjacent search process. In the adjacent searching process, the searching result of the previous searching process does not meet the expectation of the user.

For example, after a user inputs a query word in a search input box and triggers a search, operations such as clicking, viewing, collecting and the like on a search result are few, for example, the number of clicks on the search result is few or even no click is made, which indicates that the search result does not meet the expectation of the user, and in order to further improve the search result, the user inputs a new query word in the search input box and triggers a search again, which indicates that the new query word input by the user and the query word input last time satisfy an association relationship. Through carrying out statistics on a large number of the search processes, the incidence relation between the query terms or the categories to which the query terms belong can be obtained.

And secondly, the method can be obtained according to the service data in the webpage information.

In some web page information, the business data can provide corresponding services or information to the user, and is generally data that the user wants to retrieve. For example, on some travel websites, service data such as "place name" + "free travel", "place name" + "and team tour" are usually given, and the above-mentioned association relationship for determining the association search can also be obtained by analyzing the service data having the association relationship.

In addition, the association relationship can be obtained by manual setting and the like, for example, the corresponding association relationship is manually input in the association mapping table by using human experience or service requirements.

In another implementation manner, whether the preset association relationship is satisfied may be determined through the search result.

In the embodiment of the present invention, it may also be possible to obtain associated search results corresponding to the current query term and the historical query term, and determine whether the associated search results are more in line with user expectations than independent search results corresponding to the current query term alone, and if so, indicate that the current query term and the historical query term satisfy a preset association relationship, thereby determining that the user needs to trigger an associated search. Specifically, obtaining associated search results retrieved by taking each historical query term and the current query term as common query terms respectively; obtaining the current query word as an independent search result retrieved by an independent query word; and comparing the associated search results corresponding to each historical query word with the independent search results respectively, determining the historical query words corresponding to the associated search results which are more in line with the expectation of the user as the historical query words meeting the preset association relation with the current query word, for example, when determining the associated search results obtained by retrieving one or more historical query words and the current query word as the common query word, comparing the independent search results with the expectation of the user, and using the one or more historical query words as the historical query words meeting the preset association relation with the current query word. The degree which is expected by the user can be calculated according to the historical occurrence frequency, the number of times of clicking by the user, the number of times of being viewed by the user, the number of times of being collected by the user and the like of the search result.

For example, when the current query word is "air ticket", and the historical query word is "third" in the past, the "air ticket" and the "third" in the past are acquired as the associated search result retrieved by the common query word, and the "air ticket" is acquired as the independent search result retrieved by the individual query word, if the historical occurrence frequency of the associated search result is 10000 times and the historical occurrence frequency of the independent search result is 3000 times, it is indicated that the associated search result is more in line with the expectation of the user than the independent search result, and it can be determined that the user needs to trigger the associated search, and the associated search result is preferentially displayed. If the historical occurrence frequency of the associated search result is 2000 times, and the historical occurrence frequency of the independent search result is 3000 times, it indicates that the associated search result is not more desirable to the user than the independent search result, and therefore, it can be determined that the user does not need to trigger the associated search at this time, and only the independent search result is displayed.

In another implementation manner, whether the preset association relationship is satisfied may be determined by a time difference for triggering the search.

When the user continuously searches for multiple times in a short time, the fact that the user is likely to need to trigger the associated search is indicated, and therefore when the fact that the time difference of the trigger search of the current query word and the historical query word is smaller than a preset time threshold is determined, the fact that the historical query word and the current query word meet a preset associated relation is indicated. During specific implementation, respectively acquiring time difference between the trigger search time corresponding to each historical query word and the trigger search time corresponding to the current query word, and respectively comparing each time difference with a preset time threshold; and when determining that the historical query word corresponding to the time difference smaller than the preset time threshold value is taken as the historical query word meeting the preset association relation with the current query word.

For example, when the current query word is "air ticket", and the historical query word is "third flight", the time for the user to input "third flight" and trigger the search is t1, the time for the user to input "air ticket" and trigger the search is t2, and if the time difference between t1 and t2 is less than a preset time threshold, for example, less than 1 second, the "third flight" and the "air ticket" satisfy the preset association relationship.

Corresponding to the above method embodiments, the present application further provides corresponding apparatus embodiments, which are specifically described below.

Referring to fig. 2, the present application provides an apparatus embodiment of a search apparatus, comprising: a first obtaining module 201, a querying module 202, a determining module 203 and a second obtaining module 204.

A first obtaining module 201, configured to obtain a user search request, where the user search request includes a current query term input by a user in a current search process;

a query module 202, configured to query a historical query term input by a user in at least one historical search process;

a determining module 203, configured to determine, from at least one historical query term, a historical query term that satisfies a preset association relationship with the current query term, as an associated query term;

a second obtaining module 204, configured to obtain an associated search result retrieved by using the current query term and the associated query term as a common query term, so as to display the associated search result to the user on a search result page.

Wherein, the searching device can be used in a server or a terminal.

Optionally, the apparatus further comprises:

the first display module is used for displaying search result items included by the related search results and search result items included by the independent search results in a mixed sorting mode in the search result page; or, the first display module is used for displaying the associated search result in preference to the independent search result.

Optionally, the determining module includes:

the second matching unit is used for forming query pairs by the category to which each historical query word belongs and the category to which the current query word belongs, and matching the query pairs with the association relation in the mapping relation table;

and the second determining unit is used for determining the query pairs matched with the incidence relation in the mapping relation table and taking the historical query words corresponding to the matched query pairs as the historical query words meeting the preset incidence relation with the current query words.

Optionally, the determining module includes:

Optionally, the user search request further includes a user identity;

With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.

Fig. 3 is a block diagram illustrating an apparatus 300 for searching according to an example embodiment. For example, the apparatus 300 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, an exercise device, a personal digital assistant, and the like.

Referring to fig. 3, the apparatus 300 may include one or more of the following components: processing component 302, memory 304, power component 306, multimedia component 308, audio component 310, input/output (I/O) interface 312, sensor component 314, and communication component 316.

The processing component 302 generally controls overall operation of the device 300, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing components 302 may include one or more processors 320 to execute instructions to perform all or a portion of the steps of the methods described above. Further, the processing component 302 can include one or more modules that facilitate interaction between the processing component 302 and other components. For example, the processing component 302 can include a multimedia module to facilitate interaction between the multimedia component 308 and the processing component 302.

The memory 304 is configured to store various types of data to support operations at the device 300. Examples of such data include instructions for any application or method operating on device 300, contact data, phonebook data, messages, pictures, videos, and so forth. The memory 304 may be implemented by any type or combination of volatile or non-volatile memory devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.

The power supply component 306 provides power to the various components of the device 300. The power components 306 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the apparatus 300.

The multimedia component 308 includes a screen that provides an output interface between the device 300 and a user. In some embodiments, the screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive an input signal from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 308 includes a front facing camera and/or a rear facing camera. The front camera and/or the rear camera may receive external multimedia data when the device 300 is in an operating mode, such as a shooting mode or a video mode. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.

The audio component 310 is configured to output and/or input audio signals. For example, audio component 310 includes a Microphone (MIC) configured to receive external audio signals when apparatus 300 is in an operating mode, such as a call mode, a recording mode, and a voice recognition mode. The received audio signals may further be stored in the memory 304 or transmitted via the communication component 316. In some embodiments, audio component 310 also includes a speaker for outputting audio signals.

The I/O interface 312 provides an interface between the processing component 302 and peripheral interface modules, which may be keyboards, click wheels, buttons, etc. These buttons may include, but are not limited to: a home button, a volume button, a start button, and a lock button.

The sensor assembly 314 includes one or more sensors for providing various aspects of status assessment for the device 300. For example, sensor assembly 314 may detect an open/closed state of device 300, the relative positioning of components, such as a display and keypad of apparatus 300, the change in position of apparatus 300 or a component of apparatus 300, the presence or absence of user contact with apparatus 300, the orientation or acceleration/deceleration of apparatus 300, and the change in temperature of apparatus 300. Sensor assembly 314 may include a proximity sensor configured to detect the presence of a nearby object without any physical contact. The sensor assembly 314 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 314 may also include an acceleration sensor, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.

The communication component 316 is configured to facilitate wired or wireless communication between the apparatus 300 and other devices. The device 300 may access a wireless network based on a communication standard, such as WiFi, 2G or 3G, or a combination thereof. In an exemplary embodiment, the communication section 316 receives a broadcast signal or broadcast-related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 316 further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.

In an exemplary embodiment, the apparatus 300 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors or other electronic components for performing the above-described methods.

In an exemplary embodiment, a non-transitory computer-readable storage medium comprising instructions, such as the memory 304 comprising instructions, executable by the processor 320 of the apparatus 300 to perform the above-described method is also provided. For example, the non-transitory computer readable storage medium may be a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.

A non-transitory computer readable storage medium having instructions therein, which when executed by a processor of a mobile terminal, enable the mobile terminal to perform a search method, the method comprising:

Optionally, the method further includes:

alternatively, the first and second electrodes may be,

Optionally, the user search request further includes a user identity;

Fig. 4 is a schematic structural diagram of a server in an embodiment of the present invention. The server 400 may vary significantly due to configuration or performance, and may include one or more Central Processing Units (CPUs) 422 (e.g., one or more processors) and memory 432, one or more storage media 430 (e.g., one or more mass storage devices) storing applications 442 or data 444. Wherein the memory 432 and storage medium 430 may be transient or persistent storage. The program stored on the storage medium 430 may include one or more modules (not shown), each of which may include a series of instruction operations for the server. Still further, the central processor 422 may be arranged to communicate with the storage medium 430, and execute a series of instruction operations in the storage medium 430 on the server 400.

The server 400 may also include one or more power supplies 426, one or more wired or wireless network interfaces 450, one or more input-output interfaces 458, one or more keyboards 456, and/or one or more operating systems 441, such as Windows Server, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM, and so forth.

Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This invention is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

It will be understood that the invention is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the invention is only limited by the appended claims

The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims

1. A method of searching, comprising:

acquiring an associated search result retrieved by taking the current query word and the associated query word as a common query word so as to display the associated search result to a user on a search result page;

the step of determining a historical query term satisfying a preset association relation with the current query term from at least one historical query term includes:

acquiring a preset mapping relation table, wherein the mapping relation table stores the association relation between query words;

forming a query pair by each historical query term and the current query term respectively;

2. The search method of claim 1, further comprising:

3. The search method according to claim 2,

search result items included in the associated search results and search result items included in the independent search results are displayed in a mixed ranking mode in the search result page;

alternatively, the first and second electrodes may be,

4. The searching method according to claim 1, wherein the determining, from at least one of the historical query terms, a historical query term that satisfies a preset association relationship with the current query term includes:

5. The searching method according to claim 1 or 4, wherein the association relationship stored in the mapping relationship table is obtained by any one or more of the following methods:

6. The searching method according to claim 1, wherein the determining, from at least one of the historical query terms, a historical query term that satisfies a preset association relationship with the current query term includes:

7. The searching method according to claim 1, wherein the determining, from at least one of the historical query terms, a historical query term that satisfies a preset association relationship with the current query term includes:

8. The searching method according to claim 1, wherein the user searching request further includes a user identity;

9. A search apparatus, comprising:

the second acquisition module is used for acquiring the related search results retrieved by taking the current query term and the related query terms as common query terms so as to display the related search results to the user on a search result page;

the determining module comprises:

10. The apparatus of claim 9, wherein the apparatus further comprises:

11. The apparatus according to claim 10, wherein said apparatus further comprises:

alternatively, the first and second electrodes may be,

12. The search apparatus of claim 9, wherein the determining module comprises:

13. The apparatus according to claim 9 or 12, wherein the association stored in the mapping relation table is obtained by any one or more of the following:

14. The search apparatus of claim 9, wherein the determining module comprises:

15. The search apparatus of claim 9, wherein the determining module comprises:

16. The apparatus according to claim 9, wherein the user search request further includes a user identity;

17. An apparatus for searching, comprising a memory, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs comprising instructions for:

18. A machine-readable medium having stored thereon instructions, which when executed by one or more processors, cause an apparatus to perform a search method as recited in one or more of claims 1-8.