Using social networks while respecting access control lists
First Claim
Patent Images
1. A computer-implemented method for determining whether a first user and a second user of a social networking website are connected comprising:
- receiving a graph representing social networks and access information indicating which one or more of a plurality of users are allowed access to said social networks that define relationships between users, said graph including a node for each of said plurality of users, an edge between two nodes of said graph indicating a relationship between the two nodes as included in one of said social networks, said first user and said second user being represented, respectively, by a first node and a second node in said graph; and
traversing said graph to determine if there exists a path from said first node to said second node in which said first user has access to view each node in the path in accordance with said access information, said path including two or more edges.
2 Assignments
0 Petitions
Accused Products
Abstract
Techniques are described for use with social networks and associated access information, such as access control lists, indicating which users are allowed to access the social networks. The social networks represent relationships between users. The social networks and access control lists may be represented in a graph which is traversed in connection with performing different operations using the social networks.
-
Citations
20 Claims
-
1. A computer-implemented method for determining whether a first user and a second user of a social networking website are connected comprising:
-
receiving a graph representing social networks and access information indicating which one or more of a plurality of users are allowed access to said social networks that define relationships between users, said graph including a node for each of said plurality of users, an edge between two nodes of said graph indicating a relationship between the two nodes as included in one of said social networks, said first user and said second user being represented, respectively, by a first node and a second node in said graph; and traversing said graph to determine if there exists a path from said first node to said second node in which said first user has access to view each node in the path in accordance with said access information, said path including two or more edges. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A computer-implemented method for determining one or more users of a social networking website related to a first user of the social networking website comprising:
-
receiving a graph of social networks and access information indicating which of a plurality of users are allowed access to said social networks defining relationships between users, said graph including a node for each of said plurality of users, an edge between two nodes of said graph indicating a relationship between the two nodes as included in one of said social networks, said first user being represented by a first node of said graph; traversing said graph to determine any paths originating from said first node, each of said paths being within a particular distance from said first node and said first user having access to view each node in said each path in accordance with said access information; and determining a set of nodes of said graph which are included in said paths, each node of said set corresponding to a user of said social networking website related to said first node within said particular distance. - View Dependent Claims (15, 16, 17)
-
-
18. A computer readable medium comprising code stored thereon for determining whether a first user and a second user of a social networking website are related, the computer readable medium comprising code for:
-
receiving a data structure describing social networks defined for users of said social networking website and access information indicating which of said users are allowed access to said social networks defining relationships between users; and traversing said data structure to determine if there exists a relationship from said first user to said second user in which said first user has access to view all intervening relationships connecting the first user and said second user through others of said users in accordance with said access information. - View Dependent Claims (19, 20)
-
Specification