Abstract: Methods and apparatus for providing query suggestions to a user based on one or more past queries submitted by the user. Candidate query suggestions responsive to a current query may be identified. A candidate query similarity measure may be determined for a given candidate query suggestion based on matching entities related to the given candidate query suggestion and the one or more past queries. In some implementations, the similarity measure of the given candidate query suggestion may be based on a comparison of current entities of the given candidate query suggestion that match entities of one or more past queries, to a group of the current entities that includes entities that do not match the entities of one or more past queries. In some implementations a ranking of the candidate query suggestions may be determined based on the similarity measure.

Abstract: Methods and apparatus for providing query suggestions to a user based on one or more past queries submitted by the user. Candidate query suggestions responsive to a current query may be identified. A candidate query similarity measure may be determined for a given candidate query suggestion based on matching entities related to the given candidate query suggestion and the one or more past queries. In some implementations the similarity measure may be based on cumulative entity scores of the matching entities that may optionally be based on at least one of inverse popularity of the matching entities, and how recent a past query is. In some implementations a ranking of the candidate query suggestions may be adjusted based on the similarity measure. A given candidate query suggestion may be selected as a query suggestion based on at least one of the adjusted ranking and the candidate query similarity measure.

Abstract: Methods and apparatus for providing query suggestions to a user based on one or more past queries submitted by the user. Candidate query suggestions responsive to a current query may be identified. A candidate query similarity measure may be determined for a given candidate query suggestion based on matching entities related to the given candidate query suggestion and the one or more past queries. In some implementations, the similarity measure of the given candidate query suggestion may be based on a comparison of current entities of the given candidate query suggestion that match entities of one or more past queries, to a group of the current entities that includes entities that do not match the entities of one or more past queries. In some implementations a ranking of the candidate query suggestions may be determined based on the similarity measure.

Abstract: A computer-implemented method for identifying related search queries is performed on a server. The method includes receiving a search query from a user, identifying a set of ranked search results satisfying the search query, and identifying, using historical search query data, at least one last related search query in at least one chain of related search queries that is related to the search query and that includes at least one search result that was selected by users who issued the search query, each respective related search query in the at least one chain of related search queries except for the at least one last related search query in the at least one chain of related search queries violating a search result selection criterion. The method further includes returning the set of ranked search results and the at least one last related search query to the user.

Abstract: A system, computer-readable storage medium storing at least one program, and a computer-implemented method for identifying chains of related search queries is presented. Historical search query data is obtained. Chains of related search queries issued by users and search results corresponding to last related search queries in the chains of related search queries that were selected by the users are identified from the historical search query data, where each related search query in a chain of related search queries except for a last related search query in the chain of related search queries violates a search result selection criterion. The chains of related search queries are aggregated into groups, where a respective group has a common first search query and a common search result corresponding to at least one last related search query that was selected by the users. Aggregate data for the groups are stored in a query database.

Abstract: Methods and apparatus for providing query suggestions to a user based on one or more past queries submitted by the user. Candidate query suggestions responsive to a current query may be identified. A candidate query similarity measure may be determined for a given candidate query suggestion based on matching entities related to the given candidate query suggestion and the one or more past queries. In some implementations, the similarity measure of the given candidate query suggestion may be based on a comparison of current entities of the given candidate query suggestion that match entities of one or more past queries, to a group of the current entities that includes entities that do not match the entities of one or more past queries. In some implementations a ranking of the candidate query suggestions may be determined based on the similarity measure.

Abstract: A computer-implemented method for identifying search results satisfying a search query received from a user includes obtaining a set of ranked search results that satisfies the search query, and identifying, using historical search query data, a search result that was selected by users who issued the search query and that corresponds to at least one related search query in at least one chain of related search queries that are related to the search query. The method further includes determining, using the historical search query data, a frequency that the search query led to a selection of the identified search result; inserting the identified search result into the set of ranked search results based on the frequency that the search query led to the selection of the identified search result; and returning the set of ranked search results to the user.

Abstract: A computer-implemented method for proving complete query suggestions, performed by a server system, includes receiving a partial search query from a client system. A database of complete search queries is searched to identify a first set of matching complete search queries. If the first set of matching complete search queries fails to satisfy predefined criteria (e.g., with respect to the quantity and/or quality of the matching complete search queries), a rewrite of the received partial search query is performed to produce a first set of rewritten partial search queries. The database of complete search queries is searched to identify a second set of complete search queries matching any of the first set of rewritten partial search queries. At least a subset of the second set of matching complete queries are sent to the client system.

Abstract: Methods for ranking search suggestions are provided. In one aspect, a method includes receiving a search input and identifying at least one suggestion responsive to the search input from each of a plurality of suggestion sources. Each suggestion has an associated probability ranking value based on a likelihood that the search input is for a query or a likelihood that the search input is for an address. The method also includes providing, for display, each of the suggestions according to the associated probability ranking value of the suggestion. Systems and machine-readable media are also provided.

Abstract: A method and system for answering set-expression cardinality queries while lowering data communication costs by utilizing a coordinator site to provide global knowledge of the distribution of certain frequently occurring stream elements to significantly reduce the transmission of element state information to the central site and, optionally, capturing the semantics of the input set expression in a Boolean logic formula and using models of the formula to determine whether an element state change at a remote site can affect the set expression result.