Facebook, Inc.

Srinivasa Narayanan

Eyal Michael Sharon

Joshua A Redstone

Venkataramanan Nandagopal

Eric Sun

Daniel Jeng-Ping Hui

Benjamin J Gertzfield

In one embodiment, a method includes receiving a request from a first user of an online social network, the request comprising a character string of one or more characters of text entered by the first user, identifying a first set of objects associated with the online social network matching at least in part the character string of the request, calculating a score for each identified object in the first set of objects, wherein the score for each identified object is based at least in part on connections between the first user and the identified object, and sending one or more suggested queries responsive to the request, each suggested query comprising the character string of the request and one or more keywords associated with one or more of the identified objects, wherein the suggested queries are displayed in a ranked list based on the calculated scores of the associated identified objects.

Generating suggested queries based on social graph information

In one embodiment, a user of a social networking system requests to check in a place near the user's current location. The social networking system generates a list of places near the user's current location, ranks the places in the list of places near the user's current location by a distance between each place and the user's current location, as well as activity of the user and the user's social contacts for each place, and returns the ranked list to the user.

Location ranking using social graph information

In one embodiment, a method includes maintaining access to a data store of information corresponding to nodes and edges; receiving a user-generated character string comprising one or more characters of text entered by a user in an input form as they are entered by the user; searching the stored information for matches between the user-generated character string and existing nodes; determining whether or not a match between the user-generated character string and an existing node exists; and when it is determined that at least one match exists, generating an edge between the node corresponding to the user and the node for which the best match is determined; and when it is determined that no match between the user-generated character string and an existing node exists, generating a new node based on the user-generated character string, and generating an edge between the node corresponding to the user and the new node.

Automatically generating nodes and edges in an integrated social graph

In one embodiment, a user of a social networking system requests to search for a place near the user's current location. The social networking system generates a list of places near the user's current location, select a sub-set from the list of places based on visibility and activity of the user and the user's social contacts for each place in the list, and returns the sub-set to the user.

Growing community of inventors

San Francisco, CA, United States of America

Srinivasa Narayanan