Facebook, Inc.

Gintaras Andrius Woss

Sriram Sankar

Rajat Raina

Maxim Gubin

Kedar Dhamdhere

Kihyuk Hong

Zhongxian Chen

In one embodiment, a method including maintaining an index of a plurality of nodes of a social graph, each node being associated with an assigned value, wherein the value for each node is calculated based at least in part on one or more factors. The method further includes receiving, from a client device of a first user, a query from the first user, searching the index to identify a top N nodes having the highest assigned values that match the query, ranking the identified nodes based at least in part on the query, and sending, to the client device of the first user for display, a search-results interface responsive to the received query, the search-results interface comprising M search results corresponding to the top M ranked nodes, respectively.

Social static ranking for search

In one embodiment, a method includes receiving, from a client system of a first user, a request to post content to the online social network, identifying a plurality of second users, wherein each second user is associated with a privacy setting, and wherein a percentage of the identified second users have a privacy setting likely to make the content posted by the first user accessible to the second user, determining, for each identified second user, whether the content posted by the first user is accessible to the second user, and sending, to one or more client systems of one or more of the second users, respectively, instructions for presenting the content posted by the first user, wherein the content is sent to second users determined to be able to access the content and is not sent to second users determined to be not able to access the content.

Approximate privacy indexing for search queries on online social networks

In one embodiment, one or move computing devices receive, from a client device of a first user, a query corresponding to a first node type of a plurality of node types. The computer devices search one or more search indices to identify one or more nodes of a social graph matching the query. The search indices maintain an index of a plurality of nodes of the first node type, each node of the plurality of nodes having a static rank which is based at least in part on a pre-calculated value for each node. The computer devices send, to the client device of the first user for display, a search-results interface responsive to the received query. The search-results interface includes reference to one or more nodes each corresponding to the first node type and having a static rank greater than a threshold rank.

In one embodiment, a method includes retrieving, from one or more data stores, one or more objects requested by an application accessed by a first user of an online social network, wherein each object is associated with a privacy setting, and wherein a percentage of the retrieved objects have a privacy setting likely to make the object visible to the first user, determining, for each retrieved object, a visibility of the object with respect to the first user, and sending, to the application accessed by the first user, one or more of the retrieved objects, wherein each sent object has a visibility that is visible to the first user, and wherein objects having a visibility that is not visible to the first user are not sent.

In one embodiment, one or more computing devices receive, from a client device of a first user, a query from the first user. The computer devices search a social graph to identify one or more nodes of the social graph that are relevant to the query. The computer devices obtain a static rank for each identified node. The static rank is based at least in part on a number of edges of a particular edge type that are connected to the node in the graph or attributes of edges connected to the node in the graph. The computer devices send to the client device of the first user for display, a search-results page responsive to the received query. The search-results page includes reference to one or more nodes having a static rank greater than a threshold rank.

In one embodiment, a method includes receiving from a first user of an online social network a search query, searching data stores to identify objects that match the search query, where identifying the objects is also based in part on the privacy setting for each object, determining for each identified object a visibility of the object with respect to the first user, and generating one or more search results corresponding to the search query.

In one embodiment, one or more computing devices assign each of a plurality of nodes of a graph of a social-networking system to one of a plurality of search indices. Each search index corresponds to a node type, and each node assigned to a search index is of the node type that the search index corresponds to. For each search index, the one or more computing devices determine a value for each node assigned to the search index based at least in part on edges connected to the node in the graph and rank the nodes assigned to the search index based at least in part on their values. The one or more computing devices provide the search indices for storage to facilitate responding to queries encompassing objects represented by the nodes assigned to the search indices.

Growing community of inventors

Austin, TX, United States of America

Gintaras Andrius Woss