SYSTEMS AND METHODS FOR CONDUCTING RELIABLE ASSESSMENTS WITH CONNECTIVITY INFORMATION

• US 20130166601A1
• Filed: 04/29/2011
• Published: 06/27/2013
• Est. Priority Date: 04/30/2010
• Status: Active Grant

• Current Assignee: www.TrustScience.com Inc.
• Original Assignee: www.TrustScience.com Inc.
• Inventors: Chrapko, Evan V., Chan, Leo M.
• Granted Patent: US 9,922,134 B2
• Time in Patent Office: Days
• US Class Current: 707/798
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06Q 10/00 Administration; Management
• CPC Class Codes: H04L 63/0823 using certificates cryptographic mechanisms or cryptographic arrangements for entity authentication involving certificates H04L9/3263
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 9/3247 involving digital signatures
• CPC Class Codes: H04W 24/00 Supervisory, monitoring or testing arrangements

Abstract

Systems and methods for social graph data analytics to determine the connectivity between nodes within a community are provided. A user may assign user connectivity values to other members of the community, or connectivity values may be automatically harvested, calculated, or assigned from third parties or based on the frequency of interactions between members of the community. Connectivity values may represent such factors as alignment, reputation, status, and/or influence within a social graph within the network community, or the degree of trust. Social graph data analytics may be used to determine a network connectivity value from all or a subset of all of the retrieved paths and/or one or more connectivity statistics value associated with the first node and/or the second node. A parallel computational framework may operate in connection with a key-value store to perform some or all of the computations related to the connectivity determinations.

Claims

1. A method for traversing a network graph with nodes and edges stored on a distributed network, the method comprising:

storing information about a first node in the graph in a first plurality of processors;

storing information about east one edge in the graph in a second plurality of processors;

identifying, by at least one processor in the first plurality of processors, at least a first edge connected to the first node; and

identifying, by at least one processor in the second plurality of processors, at least one other node connected to the first edge.

2. The method of claim 1, further comprising identifying, by at least one processor in the first plurality of processors, at least a second edge connected to the at least one other node.

3. The method of claim 1, wherein at least one of identifying at least a first edge and identifying at least one other node includes evaluating an evaluator class.

4. The method of claim 1 further comprising storing information about a second node in the graph in a third plurality of processors.

5. The method of claim 1 further comprising storing information about the first plurality of processors and information about the second plurality of processors on at least one cluster registry processor.

6. The method of claim 5, wherein the information stored on the at least one cluster registry processor is stored on at least one processor in at least one of the first plurality of processors and the second plurality of processors.

7. The method of claim 1, wherein the at least one processor that identifies the first edge is different from the at least one processor that identifies the second edge.

8. A system for traversing a network graph with nodes and edges stored on a distributed network, the system comprising:

a first plurality of processors configured to store information about a first node in the graph;

a second plurality of processors configured to store information about at least one edge in the graph;

wherein at least one processor in the first plurality of processors is configured to identify at least a first edge connected to the first node; and

wherein at least one processor in the second plurality of processors is configured to identify at least one other node connected to the first edge.

9. The system of claim 8, wherein at least one processor in the first plurality of processors is configured to identify at least a second edge connected to the at least one other node.

10. The system of claim 8, wherein at least one of identifying at least a first edge and identifying at least one other node includes evaluating an evaluator class.

11. The system of claim 8, further comprising a third plurality of processors configured to store information about a second node in the graph.

12. The system of claim 8 further comprising at least one cluster registry processor configured to store information about the first plurality of processors and information about the second plurality of processors.

13. The system of claim 12, wherein the information stored on the at least one cluster registry processor is stored on at least one processor in at least one of the first plurality of processors and the second plurality of processors.

14. The system of claim 8, wherein the at least one processor that identifies the first edge is different from the at least one processor that identifies the second edge.