Patent application number | Description | Published |
20100161661 | PERFORMING AN ORDERED SEARCH OF DIFFERENT DATABASES - Providing a speculative search result for a search query prior to completion of the search query. In response to receiving a search query from a client node, a speculative search result is provided to the client node for the search query prior to receiving an indication from the client node that said search query is completely formed. The speculative search result may be displayed on the same web page on the client node as the search query, while the search query is being entered by the user. As the user further enters the search query, a new speculative search result may be provided to the user. | 06-24-2010 |
20110238656 | SPECULATIVE SEARCH RESULT ON A NOT-YET-SUBMITTED SEARCH QUERY - Providing a speculative search result for a search query prior to completion of the search query. In response to receiving a search query from a client node, a speculative search result is provided to the client node for the search query prior to receiving an indication from the client node that said search query is completely formed. The speculative search result may be displayed on the same web page on the client node as the search query, while the search query is being entered by the user. As the user further enters the search query, a new speculative search result may be provided to the user. | 09-29-2011 |
20130254213 | TECHNIQUES FOR IDENTIFYING AND PRESENTING CONNECTION PATHS - Techniques for analyzing a social graph of a social network service to identify and then present connection paths connecting various entities are described. With some embodiments, subsequent to a user selecting or otherwise identifying two entities represented as nodes in a social graph, the social graph is analyzed to identify connection paths connecting the nodes representing the two entities. The social graph is implemented with a graph data structure having nodes and edges representing entities and associations between entities, respectively. With some embodiments, the nodes represent people, companies, educational institutions (e.g., schools, universities, etc.), and groups. After identifying the connection paths, the connection path or paths having the highest path scores, as derived by aggregating edge scores assigned to the edges, may be presented. | 09-26-2013 |
20130254303 | LEVERAGING A SOCIAL GRAPH FOR USE WITH ELECTRONIC MESSAGING - Techniques for analyzing a social graph of a social network service to identify and then present connection paths connecting various entities are described. With some embodiments, subsequent to a user selecting or otherwise identifying a person to whom a message is to be communicated, a social graph is analyzed to identify connection paths connecting the message sender, or an entity on whose behalf the message sender is acting, to the message recipient. The social graph is implemented with a graph data structure having nodes and edges representing entities and associations between entities, respectively. With some embodiments, the nodes represent people, companies, educational institutions (e.g., schools, universities, etc.), and groups. After identifying the connection paths, the connection path having the highest path score, as derived by aggregating edge scores assigned to the edges, may be presented. | 09-26-2013 |
20130254305 | TECHNIQUES FOR IDENTIFYING AND PRESENTING CONNECTION PATHS - Techniques for analyzing a social graph of a social network service to identify and then present connection paths connecting various entities are described. With some embodiments, subsequent to a user selecting or otherwise identifying two entities represented as nodes in a social graph, the social graph is analyzed to identify connection paths connecting the nodes representing the two entities. The social graph is implemented with a graph data structure having nodes and edges representing entities and associations between entities, respectively. With some embodiments, the nodes represent people, companies, educational institutions (e.g., schools, universities, etc.), and groups. After identifying the connection paths, the connection path or paths having the highest path scores, as derived by aggregating edge scores assigned to the edges, may be presented. | 09-26-2013 |
20140101143 | METHODS AND SYSTEMS FOR OBTAINING AND PRESENTING ALUMNI DATA - Obtaining alumni data from a database includes storing standardized alumni data in alumni data profiles, receiving a selected data entity representing an institution, searching the alumni data profiles to locate the profiles of alumni of the institution, determining a plurality of ranked sets of data by searching the profiles of alumni of the institution, and displaying each of the elements of the plurality of ranked sets of data respectively as elements in a plurality of facets. The elements in the plurality of facets may be displayed visually as a graphics display. A further operation may include receiving a selected data entity representing an element of a first facet and, responsive to receiving the selected data entity, displaying, at each of the facets of the plurality of facets other than the first facet, the elements of the facet ranked in order of the number of alumni in each element of the facet. | 04-10-2014 |
20140181069 | SPECULATIVE SEARCH RESULT ON A NOT-YET-SUBMITTED SEARCH QUERY - Providing a speculative search result for a search query prior to completion of the search query is described. In response to receiving a search query from a client node, a speculative search result is provided to the client node for the search query prior to receiving an indication from the client node that said search query is completely formed. The speculative search result may be displayed on the same web page on the client node as the search query, while the search query is being entered by the user. As the user further enters the search query, a new speculative search result may be provided to the user. | 06-26-2014 |
20140214815 | DISPLAYING RESULTS OF QUERIES FOR INFORMATION WITHIN SOCIAL NETWORKS - Systems and methods for searching for information within social networks are described. In some examples embodiments, a search assist system receives a query, such as a partial query, identifies two or more categories of data that include information satisfying the query, ranks the identified categories of data based on various selection criteria, and presents suggested search terms based on the rankings. | 07-31-2014 |
20140214822 | SEARCHING FOR INFORMATION WITHIN SOCIAL NETWORKS - Systems and methods for searching for information within social networks are described. In some examples embodiments, a search assist system receives a query, such as a partial query, identifies two or more categories of data that include information satisfying the query, ranks the identified categories of data based on various selection criteria, and presents suggested search terms based on the rankings. | 07-31-2014 |