Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting controlling keywords. In one aspect, a method includes determining that two or more targeting keywords for a same content item source are matched by one or more terms in a content item request, where a first targeting keyword matches the one or more terms with a more specific type of match than the second targeting keyword. If the bid associated with the second targeting keyword does not exceed the bid associated with the first targeting keyword, the first targeting keyword and the second targeting keyword are ranked based on selection scores. The targeting keywords are ranked based at least in part on the quality scores when the bid associated with the second targeting keyword does exceed the bid associated with the first targeting keyword.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting controlling keywords. In one aspect, a method includes determining that two or more targeting keywords for a same content item source are matched by one or more terms in a content item request, where a first targeting keyword matches the one or more terms with a more specific type of match than the second targeting keyword. If the bid associated with the second targeting keyword does not exceed the bid associated with the first targeting keyword, the first targeting keyword and the second targeting keyword are ranked based on selection scores. The targeting keywords are ranked based at least in part on the quality scores when the bid associated with the second targeting keyword does exceed the bid associated with the first targeting keyword.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting controlling keywords. In one aspect, a method includes determining that two or more targeting keywords for a same content item source are matched by one or more terms in a content item request, where a first targeting keyword matches the one or more terms with a more specific type of match than the second targeting keyword. If the bid associated with the second targeting keyword does not exceed the bid associated with the first targeting keyword, the first targeting keyword and the second targeting keyword are ranked based on selection scores. The targeting keywords are ranked based at least in part on the quality scores when the bid associated with the second targeting keyword does exceed the bid associated with the first targeting keyword.

Abstract: A system and method to target advertisements to a user search query using a previously entered user search query as well as the current search query. The previously entered search query can accompanying the current search query in a query referrer, or can be determined separately from the current search query. The relevance of the previous search query is determined with respect to the current search query, and if found relevant a combination of the two query terms is used to find a set of advertising keywords from which candidate advertisements to be targeted and served to the user with search results are found. The process can be extended to additional search queries.

Abstract: Pairs of similar objects in a population of objects can be found using a process that includes identifying a comparison vector x in a set of vectors having non-zero features, determining an estimated similarity contribution of a subset of features of the comparison vector x to a similarity between the comparison vector x and each vector in the set of vectors, generating an index that includes features based on a comparison of the similarity contribution with a similarity threshold, and identifying another vector in the set that is similar to the vector x using the index.

Abstract: Pairs of similar objects in a population of objects can be found using a process that includes identifying a comparison vector x in a set of vectors having non-zero features, determining an estimated similarity contribution of a subset of features of the comparison vector x to a similarity between the comparison vector x and each vector in the set of vectors, generating an index that includes features based on a comparison of the similarity contribution with a similarity threshold, and identifying another vector in the set that is similar to the vector x using the index.

Abstract: A system to provide search query information. The system receives a request for search query information, identifies a set of search queries from a search query log that includes search queries submitted to a search service over a predetermined length of time, and provides the set of search queries. Each of the set of search queries is associated with at least a predetermined number of unique identifiers. Each of the set of search queries is matched to the request for search query information by a combination of exact matches, expanded matches, and broad matches.

Abstract: Pairs of similar vectors in a set of vectors are identified. A comparison vector x is identified, and a set of candidate vectors corresponding to the vector x is identified. For each candidate vector y in the set, a similarity estimate between the comparison vector x and the candidate vector y is determined; if the similarity estimate meets a similarity threshold, a similarity score of the comparison vector x and the candidate vector y is determined; and if the similarity score meets the similarity threshold, the pair of vectors (x, y) is included in a list of similar pairs of vectors.

Abstract: Pairs of similar objects in a population of objects can be found using a process that includes identifying a comparison vector x in a set of vectors having non-zero features, determining an estimated similarity contribution of a subset of features of the comparison vector x to a similarity between the comparison vector x and each vector in the set of vectors, generating an index that includes features based on a comparison of the similarity contribution with a similarity threshold, and identifying another vector in the set that is similar to the vector x using the index.

Abstract: Pairs of similar vectors (or objects) in a set of vectors (or objects) are identified. A comparison vector x in a set of vectors is identified; a size threshold is determined such that if a similarity between the vector x and a vector y in the set of vectors is equal to or greater than a similarity threshold, then the vector y has a size at least equal to the size threshold, the size of the candidate vector y being determined based on a number of non-zero features in the vector y. A vector having a size less than the size threshold is removed from the set of candidate vectors.

Abstract: A privacy-preserving index system addresses the problem of providing a privacy-preserving search over distributed access-controlled content. Indexed documents can be readily reconstructed from inverted indexes used in the search. The privacy-preserving index system builds a centralized privacy-preserving index in conjunction with a distributed access-control enforcing search protocol. The privacy-preserving index utilizes a randomized algorithm for constructing a privacy-preserving index. The privacy-preserving index is strongly resilient to privacy breaches. The privacy-preserving index system allows content providers to maintain complete control in defining access groups and ensuring its compliance, and further allows system implementors to retain tunable knobs to balance privacy and efficiency concerns for their particular domains.

Abstract: Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.

Abstract: Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.

Abstract: A system and method to target advertisements to a user search query using a previously entered user search query as well as the current search query. The previously entered search query can accompanying the current search query in a query referrer, or can be determined separately from the current search query. The relevance of the previous search query is determined with respect to the current search query, and if found relevant a combination of the two query terms is used to find a set of advertising keywords from which candidate advertisements to be targeted and served to the user with search results are found. The process can be extended to additional search queries.

Abstract: A system to provide search query information. The system receives a request for search query information, identifies a set of search queries from a search query log that includes search queries submitted to a search service over a predetermined length of time, and provides the set of search queries. Each of the set of search queries is associated with at least a predetermined number of unique identifiers. Each of the set of search queries is matched to the request for search query information by a combination of exact matches, expanded matches, and broad matches.

Abstract: One aspect of the subject matter described in this specification can be embodied in methods that include the actions of monitoring the performance of content items selected in response to an expanded query, identified by a query expansion rule; determining a baseline performance that represents the performance of any presented content item; and determining an expansion rule performance based on the performance of the content items relative to the baseline performance. Other implementations of this aspect include corresponding systems, apparatus, and computer program products.

Abstract: Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.

Abstract: A method and structure for identifying database association rules includes mining first database association rules, the first database association rules having ratings with respect to a plurality of metrics and population constraints, selecting second database association rules from the first database association rules, each of the second database association rules having a highest rating with respect to a different metric of the metrics, and interactively changing the metrics and repeating the selecting to identify most important ones of the databases association rules for a given set of metrics.

Abstract: A method and structure for identifying database association rules includes mining first database association rules, the first database association rules having ratings with respect to a plurality of metrics, selecting second database association rules from the first database association rules, each of the second database association rules having a highest rating with respect to a different metric of the metrics, and interactively changing the metrics and repeating the selecting to identify most important ones of the databases association rules for a given set of metrics.