Filtering Structured Search Queries Based on Privacy Settings

• US 20140025702A1
• Filed: 07/23/2012
• Published: 01/23/2014
• Est. Priority Date: 07/23/2012
• Status: Abandoned Application

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Mishra, Chaitanya, Curtiss, Michael
• Application Number:
  US13/556,017
• Publication Number:
  US 20140025702A1
• Time in Patent Office: Days
• US Class Current: 707/769
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

In particular embodiments, a method includes receiving a structured query that included references to nodes and edges from a social graph, identifying target nodes that correspond to the structured query, and then generating search results that include target nodes with privacy settings where the nodes and edges along the path connecting the target node and the querying user are all visible to the user.

Claims

1. A method comprising, by one or more computing devices:

accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising;

a first-user node corresponding to a first user associated with an online social network; and

a plurality of second nodes that each correspond to a concept or a second user associated with the online social network, wherein each second node is associated with a privacy setting defining a visibility of each edge connected to the second node;

receiving from the first user a structured query comprising references to one or more selected nodes from the one or more second nodes and one or more selected edges from the plurality of edges;

identifying one or more target nodes corresponding to the structured query, wherein each target node is a second node from the plurality of second nodes that is connected to at least one of the selected nodes by at least one of the selected edges; and

generating search results comprising references to each target node that is connected to the first-user node in the social graph by a series of selected nodes and selected edges that have a visibility that is visible to the first user, and wherein each target node is within a threshold degree of separation from the first-user node.

2. The method of claim 1, wherein the structured query comprises a first condition and one or more second conditions, wherein at least one of the second conditions is dependent on the first condition, and wherein identifying one or more target nodes corresponding to the structured query comprises identifying one or more second nodes that satisfy the first condition and applying the second nodes that satisfy the first condition to each second condition that is dependent on the first condition.

3. The method of claim 1, further comprising, for each target node, generating a sub-graph comprising the first-user node, the target node, and each selected node and each selected edge connecting the first-user node and the target node in the social graph.

4. The method of claim 3, further comprising, for each sub-graph, identifying each terminal path in the sub-graph connecting the first-user node to the target node, each terminal path comprising a series of selected nodes and selected edges connecting the first-user node to the target node.

5. The method of claim 4, further comprising, for each terminal path in the sub-graph, determining whether each selected edge in the terminal path has a visibility that is visible to the first user.

6. The method of claim 4, wherein generating search results comprises:

identifying each sub-graph having at least one terminal path wherein each selected edge in the path has a visibility that is visible to the first user; and

generating search results comprising references to each target node corresponding to each identified sub-graph.

7. The method of claim 1, wherein the privacy settings for each second node further define a visibility of the second node.

8. The method of claim 1, wherein the threshold degree of separation is one, two, three, or all.

9. The method of claim 1, further comprising accessing the privacy settings associated with each target node and each selected node.

10. A system comprising:

one or more processors; and

a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to;

access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising;

a first-user node corresponding to a first user associated with an online social network; and

a plurality of second nodes that each correspond to a concept or a second user associated with the online social network, wherein each second node is associated with a privacy setting defining a visibility of each edge connected to the second node;

receive from the first user a structured query comprising references to one or more selected nodes from the one or more second nodes and one or more selected edges from the plurality of edges;

identify one or more target nodes corresponding to the structured query, wherein each target node is a second node from the plurality of second nodes that is connected to at least one of the selected nodes by at least one of the selected edges; and

generate search results comprising references to each target node that is connected to the first-user node in the social graph by a series of selected nodes and selected edges that have a visibility that is visible to the first user, and wherein each target node is within a threshold degree of separation from the first-user node.

11. The system of claim 10, wherein the structured query comprises a first condition and one or more second conditions, wherein at least one of the second conditions is dependent on the first condition, and wherein to identify one or more target nodes corresponding to the structured query comprises to identify one or more second nodes that satisfy the first condition and applying the second nodes that satisfy the first condition to each second condition that is dependent on the first condition.

12. The system of claim 10, wherein the processors are further operable when executing the instructions to, for each target node, generate a sub-graph comprising the first-user node, the target node, and each selected node and each selected edge connecting the first-user node and the target node in the social graph.

13. The system of claim 12, wherein the processors are further operable when executing the instructions to, for each sub-graph, identify each terminal path in the sub-graph connecting the first-user node to the target node, each terminal path comprising a series of selected nodes and selected edges connecting the first-user node to the target node.

14. The system of claim 13, wherein the processors are further operable when executing the instructions to, for each terminal path in the sub-graph, determine whether each selected edge in the terminal path has a visibility that is visible to the first user.

15. The system of claim 13, wherein to generate search results comprises to:

identify each sub-graph having at least one terminal path wherein each selected edge in the path has a visibility that is visible to the first user; and

generate search results comprising references to each target node corresponding to each identified sub-graph.

16. The system of claim 10, wherein the privacy settings for each second node further define a visibility of the second node.

17. The system of claim 10, wherein the threshold degree of separation is one, two, three, or all.

18. The system of claim 10, wherein the processors are further operable when executing the instructions to access the privacy settings associated with each target node and each selected node.