Managing cross-correlated data

• US 8,825,711 B2
• Filed: 08/13/2012
• Issued: 09/02/2014
• Est. Priority Date: 08/13/2012
• Status: Active Grant

• Current Assignee: Magnet Systems Incorporated
• Original Assignee: Magnet Systems Incorporated
• Inventors: Chan, Robyn J., Morsi, Magdi
• Primary Examiner(s): MORRISON, JAY A
• Application Number:
  US13/584,732
• Publication Number:
  US 20140046982A1
• Time in Patent Office: 750 Days
• Field of Search: None
• US Class Current: 707/798
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: G06F 16/28 Databases characterised by their database models, e.g. relational or object models
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

Systems and processes for storing correlated data in a graph database are described. A first user node may be stored. In response to a request, a first event node and a second user node may be stored. The first event node may be associated with the first user node through an edge indicating participation. The first event node may be associated with the second user node through an edge indicating participation. In response to a content access, a second event node and a content node may be stored. The second event node may be associated with the first user node through an edge indicating participation. The second event node may be associated with the content node through an edge indicating usage. The first user node may be associated with the content node through an edge indicating the first user node handles the content node.

Claims

1. A computer-implemented method for storing correlated data in a graph database, the method comprising:

storing, in the graph database, a first user node;

associating the first user node with a first user profile and a first identifier, the first user profile associated with a first user, and the first user profile comprising information about the first user;

in response to detecting a first request for creating a profile associated with a second user, the first request initiated by the first user;

storing, in the graph database, a first event node and a second user node;

associating the first event node with the first user node through a first edge, the first edge indicating the first user node is a participant of the first event node;

associating the first event node with the second user node through a second edge, the second edge indicating the second user node is a participant of the first event node; and

associating the first user node with the second user node through a third edge, the third edge relating the first user node and the second user node;

in response to detecting an access of a content by the first user;

storing, in the graph database, a second event node and a first content node, the first content node associated with the content;

associating the second event node with the first user node through a fourth edge, the fourth edge indicating the first user node is a participant of the second event node;

associating the second event node with the first content node through a fifth edge, the fifth edge indicating the second event node uses the first content node; and

associating the first user node with the first content node through a sixth edge, the sixth edge indicating the first user node handles the first content node.

2. The computer-implemented method of claim 1, further comprising:

in response to detecting a change in the information about the first user;

storing, in the graph database, a third event node and a third user node;

associating the third user node with the first identifier;

associating the third event node with the third user node through a seventh edge, the seventh edge indicating the third user node is a participant of the third event node; and

associating the third user node with the first user node through an eighth edge, the eighth edge relating the third user node and the first user node.

3. The computer-implemented method of claim 2, further comprising:

in response to detecting a change in the content, the change caused by a fourth user;

storing, in the graph database, a fourth event node and a second content node;

associating the fourth event node with a fourth user node through a ninth edge, the ninth edge indicating the fourth user node is a participant of the fourth event node;

associating the fourth event node with the second content node through a tenth edge, the tenth edge indicating the fourth event node uses the second content node; and

associating the second content node with the first content node through an eleventh edge, the eleventh edge indicating the second content node references the first content node.

4. The computer-implemented method of claim 1, wherein:

further in response to detecting an access of the content by the first user;

storing, in the graph database, a second content node, the second content node associated with a workspace; and

associating the first content node with the second content node through a seventh edge indicating the second content contains the first content.

5. The computer-implemented method of claim 1, wherein:

the sixth edge further indicates the association between the first user node and the first content node, the association selected from the group comprising owner, reviewer, and modifier.

6. The computer-implemented method of claim 1, wherein:

detecting the access of the content by the first user comprises detecting an upload of the content by the first user.

7. The computer-implemented method of claim 1, wherein:

the first event node is associated with a first time information, the first time information based on the time of the first request; and

the second event node is associated with a second time information, the second time information based on the time of the access of the content.

8. The computer-implemented method of claim 2, wherein:

the third event node is associated with a third time information, the third time information based on the time the change in the information about the first user was detected.

9. The computer-implemented method of claim 3, wherein:

the fourth event node is associated with a fourth time information, the fourth time information based on the time the change in the content was detected.

10. A non-transitory computer-readable storage medium comprising computer-executable instructions for storing correlated data in a graph database, the instructions comprising:

storing, in the graph database, a first user node;

associating the first user node with a first user profile and a first identifier, the first user profile associated with a first user, and the first user profile comprising information about the first user;

in response to detecting a first request for creating a profile associated with a second user, the first request initiated by the first user;

storing, in the graph database, a first event node and a second user node;

associating the first event node with the first user node through a first edge, the first edge indicating the first user node is a participant of the first event node;

associating the first event node with the second user node through a second edge, the second edge indicating the second user node is a participant of the first event node; and

associating the first user node with the second user node through a third edge, the third edge relating the first user node and the second user node;

in response to detecting an access of a content by the first user;

storing, in the graph database, a second event node and a first content node, the first content node associated with the content;

associating the second event node with the first user node through a fourth edge, the fourth edge indicating the first user node is a participant of the second event node;

associating the second event node with the first content node through a fifth edge, the fifth edge indicating the second event node uses the first content node; and

associating the first user node with the first content node through a sixth edge, the sixth edge indicating the first user node handles the first content node.

11. The non-transitory computer-readable storage medium of claim 10, further comprising:

in response to detecting a change in the information about the first user;

storing, in the graph database, a third event node and a third user node;

associating the third user node with the first identifier;

associating the third event node with the third user node through a seventh edge, the seventh edge indicating the third user node is a participant of the third event node; and

associating the third user node with the first user node through an eighth edge, the eighth edge relating the third user node and the first user node.

12. The non-transitory computer-readable storage medium of claim 11, further comprising:

in response to detecting a change in the content, the change caused by a fourth user;

storing, in the graph database, a fourth event node and a second content node;

associating the fourth event node with a fourth user node through a ninth edge, the ninth edge indicating the fourth user node is a participant of the fourth event node;

associating the fourth event node with the second content node through a tenth edge, the tenth edge indicating the fourth event node uses the second content node; and

associating the second content node with the first content node through an eleventh edge, the eleventh edge indicating the second content node references the first content node.

13. The non-transitory computer-readable storage medium of claim 10, wherein:

further in response to detecting an access of the content by the first user;

storing, in the graph database, a second content node, the second content node associated with a workspace; and

associating the first content node with the second content node through a seventh edge indicating the second content contains the first content.

14. The non-transitory computer-readable storage medium of claim 10, wherein:

the sixth edge further indicates the association between the first user node and the first content node, the association selected from the group comprising owner, reviewer, and modifier.

15. The non-transitory computer-readable storage medium of claim 10, wherein:

detecting the access of the content by the first user comprises detecting an upload of the content by the first user.

16. The non-transitory computer-readable storage medium of claim 10, wherein:

the first event node is associated with a first time information, the first time information based on the time of the first request; and

the second event node is associated with a second time information, the second time information based on the time of the access of the content.

17. The non-transitory computer-readable storage medium of claim 11, wherein:

the third event node is associated with a third time information, the third time information based on the time the change in the information about the first user was detected.

18. The non-transitory computer-readable storage medium of claim 12, wherein:

the fourth event node is associated with a fourth time information, the fourth time information based on the time the change in the content was detected.

19. An apparatus for storing correlated data in a graph database, the apparatus comprising:

a memory configured to store data; and

a computer processor configured to;

store, in the graph database, a first user node;

associate the first user node with a first user profile and a first identifier, the first user profile associated with a first user, and the first user profile comprising information about the first user;

in response to detecting a first request for creating a profile associated with a second user, the first request initiated by the first user;

store, in the graph database, a first event node and a second user node;

associate the first event node with the first user node through a first edge, the first edge indicating the first user node is a participant of the first event node;

associate the first event node with the second user node through a second edge, the second edge indicating the second user node is a participant of the first event node; and

associate the first user node with the second user node through a third edge, the third edge relating the first user node and the second user node;

in response to detecting an access of a content by the first user;

store, in the graph database, a second event node and a first content node, the first content node associated with the content;

associate the second event node with the first user node through a fourth edge, the fourth edge indicating the first user node is a participant of the second event node;

associate the second event node with the first content node through a fifth edge, the fifth edge indicating the second event node uses the first content node; and

associate the first user node with the first content node through a sixth edge, the sixth edge indicating the first user node handles the first content node.

20. The apparatus of claim 19, further comprising:

in response to detecting a change in the information about the first user;

store, in the graph database, a third event node and a third user node;

associate the third user node with the first identifier;

associate the third event node with the third user node through a seventh edge, the seventh edge indicating the third user node is a participant of the third event node; and

associate the third user node with the first user node through an eighth edge, the eighth edge relating the third user node and the first user node.

21. The apparatus of claim 20, further comprising:

in response to detecting a change in the content, the change caused by a fourth user;

store, in the graph database, a fourth event node and a second content node;

associate the fourth event node with a fourth user node through a ninth edge, the ninth edge indicating the fourth user node is a participant of the fourth event node;

associate the fourth event node with the second content node through a tenth edge, the tenth edge indicating the fourth event node uses the second content node; and

associate the second content node with the first content node through an eleventh edge, the eleventh edge indicating the second content node references the first content node.

22. The apparatus of claim 19, wherein:

further in response to detecting an access of the content by the first user;

store, in the graph database, a second content node, the second content node associated with a workspace; and

associate the first content node with the second content node through a seventh edge indicating the second content contains the first content.

23. The apparatus of claim 19, wherein:

the sixth edge further indicates the association between the first user node and the first content node, the association selected from the group comprising owner, reviewer, and modifier.

24. The apparatus of claim 19, wherein:

detecting the access of the content by the first user comprises detecting an upload of the content by the first user.

25. The apparatus of claim 19, wherein:

the first event node is associated with a first time information, the first time information based on the time of the first request; and

the second event node is associated with a second time information, the second time information based on the time of the access of the content.

26. The apparatus of claim 20, wherein:

the third event node is associated with a third time information, the third time information based on the time the change in the information about the first user was detected.

27. The apparatus of claim 21, wherein:

the fourth event node is associated with a fourth time information, the fourth time information based on the time the change in the content was detected.