Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: Targeting information (also referred to as ad “serving constraints”) or candidate targeting information for an advertisement is identified. Targeting information may be identified by extracting topics or concepts from, and/or generating topics or concepts based on, ad information, such as information from a Web page to which an ad is linked (or some other Web page of interest to the ad or advertiser). The topics or concepts may be relevant queries associated with the Web page of interest, clusters, etc.

Abstract: Systems and methods for handling messages in which a list comprising a plurality of conversations is provided. A first conversation in the plurality of conversations is identified. The first conversation is configurable to occupy a single line in the list and comprises a plurality of messages. This plurality of messages shares a common set of characteristics that meets a predefined criterion. Responsive to receiving a designation of a predefined user action, the predefined user action is applied, without human intervention, to each message in the plurality of messages.

Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: Methods and systems for searching conversations are provided. At a computer system having one or more processors and memory storing programs executed by the one or more processors a search query is receive from a client. A conversation relevant to the search query is identified. The conversation has two or more messages. There is returned to the client for display a portion of a body of a message in the two or more messages responsive to the search query.

Abstract: The relevance of advertisements to a user's interests is improved. In one implementation, the content of a web page is analyzed to determine a list of one or more topics associated with that web page. An advertisement is considered to be relevant to that web page if it is associated with keywords belonging to the list of one or more topics. One or more of these relevant advertisements may be provided for rendering in conjunction with the web page or related web pages.

Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: An indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance.

Abstract: Advertisers are permitted to put targeted ads on page on the web (or some other document of any media type). The present invention may do so by (i) obtaining content that includes available spots for ads, (ii) determining ads relevant to content, and/or (iii) combining content with ads determined to be relevant to the content.

Abstract: Targeting information (also referred to as ad “serving constraints”) or candidate targeting information for an advertisement is identified. Targeting information may be identified by extracting topics or concepts from, and/or generating topics or concepts based on, ad information, such as information from a Web page to which an ad is linked (or some other Web page of interest to the ad or advertiser). The topics or concepts may be relevant queries associated with the Web page of interest, clusters, etc.

Abstract: The relevance of advertisements to a user's interests is improved. In one implementation, the content of a web page is analyzed to determine a list of one or more topics associated with that web page. An advertisement is considered to be relevant to that web page if it is associated with keywords belonging to the list of one or more topics. One or more of these relevant advertisements may be provided for rendering in conjunction with the web page or related web pages.

Abstract: A method for providing search results includes identifying a plurality of websites relevant to a search query, generating an ordered set of search results, and sending the search results to a client device. Each respective search result includes a link to a respective website, the link including a reference to a recording function that is distinct from a function of the link to send a request to the respective website, and position information identifying a position of the respective search result in the ordered set of search results. In some implementations, the search results also include the recording function. The recording function, when executed at the client device, sends data, including the position information and website location information associated with the link in a respective search result of the ordered set of search results, to a server that is distinct from the website.

Abstract: Methods and systems for searching conversations are provided. At a computer system having one or more processors and memory storing programs executed by the one or more processors a search query is receive from a client. A conversation relevant to the search query is identified. The conversation has two or more messages. There is returned to the client for display a portion of a body of a message in the two or more messages responsive to the search query.

Abstract: Methods and apparatus are described for sending completions to a client for aiding a user in completing electronic forms. The invention may identify a plurality of completions corresponding to a user; form a plurality of selected completions from the plurality of completions based, at least in part, on a use pattern of the user; and transmit the plurality of selected completions to a client associated with the user.

Abstract: A system and method are disclosed for producing a list of conversations as the result of a search query. Messages are received and associated with a conversation. Each of the conversations has a respective conversation identifier and includes one or more messages. Messages, and related message information, are indexed for text searching and information about the message is stored in a memory to associate the message to its respective conversation identifier. The index can be searched to identify one or more messages relevant to a search query. At least some of the conversations to which the one or more messages belong are identified and produced as the search result.

Abstract: Systems and methods for handling messages in which a list comprising a plurality of conversations is provided. A first conversation in the plurality of conversations is identified. The first conversation is configurable to occupy a single line in the list and comprises a plurality of messages. This plurality of messages shares a common set of characteristics that meets a predefined criterion. Responsive to receiving a designation of a predefined user action, the predefined user action is applied, without human intervention, to each message in the plurality of messages.

Abstract: System and methods of searching conversations are provided. At a computing device having one or more processors and memory storing programs executed by the one or more processors, and responsive to a search query a conversation having two or more messages is identified. Further, there is formatted for display to a user (A) information representing the identified conversation, and (B) a sorted sender list displayed as a single-line item, associated with the identified conversation. The sorted sender list includes (i) a first sender identifier identifying a first sender of a first message in the two or more messages, and (ii) a second sender identifier identifying a second sender of a second message in the two or more messages. The first sender list identifier and the second identifier are sorted.

Abstract: Advertisers are permitted to put targeted ads on page on the web (or some other document of any media type). The present invention may do so by (i) obtaining content that includes available spots for ads, (ii) determining ads relevant to content, and/or (iii) combining content with ads determined to be relevant to the content.

Abstract: A system and method are disclosed for producing a list of conversations as the result of a search query. Messages are received and associated with a conversation. Each of the conversations has a respective conversation identifier and includes one or more messages. Messages, and related message information, are indexed for text searching and information about the message is stored in a memory to associate the message to its respective conversation identifier. The index can be searched to identify one or more messages relevant to a search query. At least some of the conversations to which the one or more messages belong are identified and produced as the search result.

Abstract: An indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance.