MANAGING CROSS-CORRELATED DATA
First Claim
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.
1 Assignment
0 Petitions
Accused Products
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.
51 Citations
27 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
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. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
-
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. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27)
-
Specification