Object store creation

• US 9,419,886 B2
• Filed: 03/28/2014
• Issued: 08/16/2016
• Est. Priority Date: 10/24/2013
• Status: Active Grant

• Current Assignee: SAS Institute Incorporated
• Original Assignee: SAS Institute Incorporated
• Inventors: Miles, Brian Oneal
• Primary Examiner(s): Duong, Duc
• Application Number:
  US14/228,666
• Publication Number:
  US 20150117254A1
• Time in Patent Office: 872 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 16/23 Updating
• CPC Class Codes: G06N 5/048 Fuzzy inferencing
• CPC Class Codes: H04L 41/142 using statistical or mathematical methods
• CPC Class Codes: H04L 43/04 Processing captured monitoring data, e.g. for logfile generation
• CPC Class Codes: H04L 45/02 Topology update or discovery

Abstract

A method of creating an object store is provided. Node table information reading and link table information are read. The node table information includes node information for a plurality of nodes. The link table information includes link information between pairs of nodes of the plurality of nodes. An anchored network record is created for each node of the plurality of nodes based on the node information and the link information and a defined maximum degree of separation. The anchored network record includes anchor node information associated with an anchor node of the anchored network record and a node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record. The created anchored network record is stored for each node of the plurality of nodes.

Claims

1. A non-transitory computer-readable medium having stored thereon computer-readable instructions that when executed by a computing device cause the computing device to:

read node table information, wherein the node table information includes node information for a plurality of nodes;

read link table information, wherein the link table information includes link information between pairs of nodes of the plurality of nodes;

create an anchored network record for each node of the plurality of nodes based on the node information and the link information and a defined maximum degree of separation, wherein the anchored network record includes anchor node information associated with an anchor node of the anchored network record, a node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record, and an anchor node record for the anchor node, wherein the anchor node information includes a unique identifier for the anchor node and the unique identifier is included in the anchor node record;

store the created anchored network record for each node of the plurality of nodes;

receive scoring information from a second computing device, wherein the scoring information includes a first node identifier and a factor value;

identify a stored anchored network record based on the first node identifier matching the unique identifier for the anchor node included in the stored anchored network record;

identify a first node record in the identified, stored anchored network record based on the first node identifier matching the unique identifier included in the anchor node record included in the stored anchored network record;

update a first node score value included in the identified first node record using the factor value;

update the identified first node record with the updated first node score value;

determine a likelihood of an occurrence of an event based on the updated first node score value; and

send the determined likelihood to a third computing device.

2. The computer-readable medium of claim 1, wherein the anchored network record further comprises a link record for each pair of directly linked nodes of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record.

3. The computer-readable medium of claim 2, wherein the link record for each pair of directly linked nodes of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record is stored as an array.

4. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record is stored as an array.

5. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises an indicator to indicate a number of degrees of separation between the anchor node and the respective node.

6. The computer-readable medium of claim 5, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a summed link width for all paths between the anchor node and the respective node excluding links to nodes for which the number of degrees of separation are equal.

7. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a minimum summed link width for a shortest path between the respective node and the anchor node.

8. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises an indicator to indicate whether or not the respective node is the anchor node of the anchored network record.

9. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a node score value for the respective node.

10. The computer-readable medium of claim 1, wherein the anchor node information comprises a second node score value for the anchor node that is equal to the updated first node score value.

11. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a node'"'"'s network score value for the respective node.

12. The computer-readable medium of claim 11, wherein the anchor node information comprises a network score value for the anchor node.

13. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises an overall score value for the respective node, wherein the overall score value is a combination of a node score value and a network score value.

14. The computer-readable medium of claim 13, wherein the anchor node information comprises a second overall score value for the anchor node.

15. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a number of links from the respective node within the anchored network record.

16. The computer-readable medium of claim 1, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a summed number of links for all paths between the anchor node and the respective node excluding links to nodes for which a number of degrees of separation between the anchor node and the respective node are equal.

17. The computer-readable medium of claim 1, wherein the identified first node record is further updated with a date and a time the first node score value is updated.

18. The computer-readable medium of claim 1, wherein the anchor node information comprises an identifier for the anchored network record.

19. A system comprising:

a processor; and

a non-transitory computer-readable medium operably coupled to the processor, the computer-readable medium having computer-readable instructions stored thereon that, when executed by the processor, cause the system to

read node table information, wherein the node table information includes node information for a plurality of nodes;

read link table information, wherein the link table information includes link information between pairs of nodes of the plurality of nodes;

create an anchored network record for each node of the plurality of nodes based on the node information and the link information and a defined maximum degree of separation, wherein the anchored network record includes anchor node information associated with an anchor node of the anchored network record and a node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record;

store the created anchored network record for each node of the plurality of nodes;

receive scoring information, wherein the scoring information includes a first node identifier and a factor value;

identify a stored anchored network record based on the first node identifier matching the unique identifier for the anchor node included in the stored anchored network record;

identify a first node record in the identified, stored anchored network record based on the first node identifier matching the unique identifier included in the anchor node record included in the stored anchored network record;

update a first node score value included in the identified first node record using the factor value; and

update the identified first node record with the updated first node score value;

determine a likelihood of an occurrence of an event based on the updated first node score value; and

send the determined likelihood to a third computing device.

20. The system of claim 19, wherein the anchored network record further comprises a link record for each pair of directly linked nodes of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record.

21. The system of claim 19, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises an indicator to indicate a number of degrees of separation between the anchor node and the respective node.

22. The system of claim 21, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record further comprises a summed link width for all paths between the anchor node and the respective node excluding links to nodes for which the number of degrees of separation are equal.

23. The system of claim 19, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a minimum summed link width for a shortest path between the respective node and the anchor node.

24. The system of claim 19, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a node'"'"'s network score value for the respective node.

25. The system of claim 24, wherein the anchor node information comprises a network score value for the anchor node that is equal to the node'"'"'s network score value of the first node record.

26. The system of claim 19, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises an overall score value for the respective node, wherein the overall score value is a combination of a node score value and a network score value.

27. The system of claim 26, wherein the anchor node information comprises a second overall score value for the anchor node that is equal to the node'"'"'s network score value of the first node record.

28. The system of claim 19, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a number of links from the respective node within the anchored network record.

29. The system of claim 19, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a summed number of links for all paths between the anchor node and the respective node excluding links to nodes for which a number of degrees of separation between the anchor node and the respective node are equal.

30. A method of creating an object store comprising:

reading node table information by a computing device, wherein the node table information includes node information for a plurality of nodes;

reading link table information by the computing device, wherein the link table information includes link information between pairs of nodes of the plurality of nodes;

creating, by the computing device, an anchored network record for each node of the plurality of nodes based on the node information and the link information and a defined maximum degree of separation, wherein the anchored network record includes anchor node information associated with an anchor node of the anchored network record and a node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record;

storing, by the computing device, the created anchored network record for each node of the plurality of nodes;

receiving scoring information, wherein the scoring information includes a first node identifier and a factor value;

identifying, by the computing device, a stored anchored network record based on the first node identifier matching the unique identifier for the anchor node included in the stored anchored network record;

identifying, by the computing device, a first node record in the identified, stored anchored network record based on the first node identifier matching the unique identifier included in the anchor node record included in the stored anchored network record;

updating, by the computing device, a first node score value included in the identified first node record using the factor value; and

updating, by the computing device, the identified first node record with the updated first node score value;

determining, by the computing device, a likelihood of an occurrence of an event based on the updated first node score value; and

sending, by the computing device, the determined likelihood to a third computing device.

31. The method of claim 30, wherein the anchored network record further comprises a link record for each pair of directly linked nodes of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record.

32. The method of claim 30, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises an indicator to indicate a number of degrees of separation between the anchor node and the respective node.

33. The method of claim 32, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record further comprises a summed link width for all paths between the anchor node and the respective node excluding links to nodes for which the number of degrees of separation are equal.

34. The method of claim 30, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a minimum summed link width for a shortest path between the respective node and the anchor node.

35. The method of claim 30, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a node'"'"'s network score value for the respective node.

36. The method of claim 35, wherein the anchor node information comprises a network score value for the anchor node that is equal to the node'"'"'s network score value of the first node record.

37. The method of claim 30, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises an overall score value for the respective node, wherein the overall score value is a combination of a node score value and a network score value.

38. The method of claim 37, wherein the anchor node information comprises a second overall score value for the anchor node that is equal to the node'"'"'s network score value of the first node record.

39. The method of claim 30, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a number of links from the respective node within the anchored network record.

40. The method of claim 30, wherein the node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record comprises a summed number of links for all paths between the anchor node and the respective node excluding links to nodes for which a number of degrees of separation between the anchor node and the respective node are equal.