Systems and methods for adding users to a networked computer system

Patent metadata

Field	Value
Publication number	US-9900223-B2
Application number	US-201715428068-A
Country	US
Kind code	B2
Filing date	Feb 8, 2017
Priority date	Dec 26, 2013
Publication date	Feb 20, 2018
Grant date	Feb 20, 2018

Abstract

Systems and methods are provided for adding new nodes to a computer networked system. The systems and methods may identify a first set of nodes in a networked computer system. The first set of nodes may be included in a first hash computation that clusters the first set of nodes into communities. An application shard space including a first space and a second space may be generated. The first set of nodes may be mapped to application shards in the first space based on the first hash computation. The application shards in the first space may be assigned to a first set of machines of the networked computer system. The second space may be maintained for mappings of nodes not included in the first hash computation to application shards in the second space.

First claim

What is claimed:

1. A computer implemented method comprising:
identifying, by a computing system, a first set of nodes in a networked computer system, each node of the first set of nodes being associated with a user on a social networking system, and the first set of nodes included in a first hash computation that clusters the first set of nodes into communities based on connections between the users on the social networking system;
mapping, by the computing system, the first set of nodes to application shards in a first space of an application shard space based on the first hash computation, the application shards in the first space assigned to a first set of machines of the networked computer system; and
maintaining, by the computing system, a second space of the application shard space for mappings of nodes not included in the first hash computation to application shards in the second space.

2. The computer implemented method of claim 1 , further comprising:
routing a node of the first set of nodes to a machine assigned to an application shard in the first space.

3. The computer implemented method of claim 1 , wherein the nodes not included in the first hash computation include new nodes added to the networked computer system after the first hash computation.

4. The computer implemented method of claim 1 , wherein the nodes not included in the first hash computation include existing nodes having insufficient information to be classified within a community at the time of the first hash computation.

5. The computer implemented method of claim 1 , further comprising:
identifying a node not included in the first hash computation; and
mapping the node not included in the first hash computation to an application shard in the second space.

6. The computer implemented method of claim 5 , further comprising:
routing the node not included in the first hash computation to a machine assigned to an application shard in the second space.

7. The computer implemented method of claim 1 , further comprising:
performing the first hash computation on the first set of nodes.

8. The computer implemented method of claim 1 , wherein the application shards in the first space and the application shards in the second space remain a constant size.

9. The computer implemented method of claim 1 , wherein the size of the second space is 25% or less than the size of the application shard space.

10. The computer implemented method of claim 1 , wherein the second space is reserved for users that have not yet joined the social networking system at the time of the first hash computation or users of the social networking system for which there is insufficient information to be classified into a community at the time of the first hash computation.

11. A system comprising:
at least one processor, and
a memory storing instructions configured to instruct the at least one processor to perform:
identifying a first set of nodes in a networked computer system, each node of the first set of nodes being associated with a user on a social networking system, and the first set of nodes included in a first hash computation that clusters the first set of nodes into communities based on connections between the users on the social networking system;

mapping the first set of nodes to application shards in a first space of an application shard space based on the first hash computation, the application shards in the first space assigned to a first set of machines of the networked computer system; and
maintaining second space of the application shard space for mappings of nodes not included in the first hash computation to application shards in the second space.

12. The system of claim 11 , wherein the instructions are further configured to instruct the at least one processor to perform:
routing a node of the first set of nodes to a machine assigned to an application shard in the first space.

13. The system of claim 11 , wherein the nodes not included in the first hash computation include new nodes added to the networked computer system after the first hash computation.

14. The system of claim 11 , wherein the nodes not included in the first hash computation include existing nodes having insufficient information to be classified within a community at the time of the first hash computation.

15. The system of claim 11 , wherein the instructions are further configured to instruct the at least one processor to perform:
identifying a node not included in the first hash computation; and
mapping the node not included in the first hash computation to an application shard in the second space.

16. A non-transient computer storage medium storing computer-executable instructions that, when executed, cause a computer system to perform computer-implemented method comprising:
identifying a first set of nodes in a networked computer system, each node of the first set of nodes being associated with a user on a social networking system, and the first set of nodes included in a first hash computation that clusters the first set of nodes into communities based on connections between the users on the social networking system;
mapping the first set of nodes to application shards in a first space of an application shard space based on the first hash computation, the application shards in the first space assigned to a first set of machines of the networked computer system; and
maintaining second space of the application shard space for mappings of nodes not included in the first hash computation to application shards in the second space.

17. The non-transient computer storage medium of claim 16 , wherein the instructions are further configured to cause the computer system to perform:
routing a node of the first set of nodes to a machine assigned to an application shard in the first space.

18. The non-transient computer storage medium of claim 16 , wherein the nodes not included in the first hash computation include new nodes added to the networked computer system after the first hash computation.

19. The non-transient computer storage medium of claim 16 , wherein the nodes not included in the first hash computation include existing nodes having insufficient information to be classified within a community at the time of the first hash computation.

20. The non-transient computer storage medium of claim 16 , wherein the instructions are further configured to cause the computer system to perform:
identifying a node not included in the first hash computation; and
mapping the node not included in the first hash computation to an application shard in the second space.

Assignees

• Facebook Inc

Inventors

• Shalita Alon Michael
• Sharma Arun Dattaram

Classifications

• H04L67/306

  User profiles · CPC title

• H04L41/12 Primary

  Discovery or management of network topologies · CPC title

• G06F16/28 Primary

  Databases characterised by their database models, e.g. relational or object models · CPC title

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title