Aggregating data from a work queue
First Claim
Patent Images
1. A method, comprising:
- identifying a first message within a first message feed of a first user;
computing a first aggregation key based upon the first message;
appending the first aggregation key to the first message as at least one of a first prefix or a first suffix;
selectively storing the first message within a first data partition, but not a second data partition, designated for storing message data associated with the first aggregation key;
identifying a second message within the first message feed of the first user, the second message corresponding to a status update with respect to the first message;
responsive to determining the second message corresponds to the status update with respect to the first message, appending the first aggregation key to the second message as at least one of a second prefix or a second suffix;
selectively storing the second message within the first data partition, but not the second data partition;
identifying a third message within a second message feed of a second user;
computing a second aggregation key based upon the third message;
appending the second aggregation key to the third message as at least one of a third prefix or a third suffix; and
selectively storing the third message within the second data partition, but not the first data partition, designated for storing message data associated with the second aggregation key.
3 Assignments
0 Petitions
Accused Products
Abstract
One or more techniques and/or systems are disclosed herein for aggregating web-based data stored in a distributed data store so that it can be retrieved in a first-in, first-out (FIFO) manner. A unique aggregation key is generated for respective one or more data generated from a web-based event, where the one or more data are added to the distributed data store, and the aggregation key corresponds merely to the data generated from the web-based event. The one or more data from the web based event is aggregated in a FIFO queue and stored in a same partition of the distributed data store, based on the aggregation key.
53 Citations
20 Claims
-
1. A method, comprising:
-
identifying a first message within a first message feed of a first user; computing a first aggregation key based upon the first message; appending the first aggregation key to the first message as at least one of a first prefix or a first suffix; selectively storing the first message within a first data partition, but not a second data partition, designated for storing message data associated with the first aggregation key; identifying a second message within the first message feed of the first user, the second message corresponding to a status update with respect to the first message; responsive to determining the second message corresponds to the status update with respect to the first message, appending the first aggregation key to the second message as at least one of a second prefix or a second suffix; selectively storing the second message within the first data partition, but not the second data partition; identifying a third message within a second message feed of a second user; computing a second aggregation key based upon the third message; appending the second aggregation key to the third message as at least one of a third prefix or a third suffix; and selectively storing the third message within the second data partition, but not the first data partition, designated for storing message data associated with the second aggregation key. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer readable storage device comprising instructions that when executed perform a method comprising:
-
identifying a first message within a first message feed of a first user; computing a first aggregation key based upon the first message; appending the first aggregation key to the first message as at least one of a first prefix or a first suffix; selectively storing the first message within a first data partition, but not a second data partition, designated for storing message data associated with the first aggregation key; identifying a second message within the first message feed of the first user, the second message corresponding to a status update with respect to the first message; responsive to determining the second message corresponds to the status update with respect to the first message, appending the first aggregation key to the second message as at least one of a second prefix or a second suffix; selectively storing the second message within the first data partition, but not the second data partition; identifying a third message within a second message feed of a second user; computing a second aggregation key based upon the third message; appending the second aggregation key to the third message as at least one of a third prefix or a third suffix; and selectively storing the third message within the second data partition, but not the first data partition, designated for storing message data associated with the second aggregation key. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A system, comprising:
a storing component configured to; identify a first message within a first message feed of a first user; compute a first aggregation key based upon the first message; append the first aggregation key to the first message as at least one of a first prefix or a first suffix; selectively store the first message within a first data partition, but not a second data partition, designated for storing message data associated with the first aggregation key; identify a second message within the first message feed of the first user, the second message corresponding to a status update with respect to the first message; responsive to determining the second message corresponds to the status update with respect to the first message, append the first aggregation key to the second message as at least one of a second prefix or a second suffix; selectively store the second message within the first data partition, but not the second data partition; identify a third message within a second message feed of a second user; compute a second aggregation key based upon the third message; append the second aggregation key to the third message as at least one of a third prefix or a third suffix; and selectively store the third message within the second data partition, but not the first data partition, designated for storing message data associated with the second aggregation key. - View Dependent Claims (18, 19, 20)
Specification