# US 2022/0191261 A1 · Processing messages based on key assignment data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0191261 A1
- Document ID: US20220191261A1
- Status: Published application
- Kind: A1
- Application number: 17/678,570
- Filed: 2022-02-23
- Published: 2022-06-16
- Earliest claimed: 2020-12-11
- Assignees: Ocient Holdings LLC
- Applicants: Ocient Holdings LLC
- Inventors: Daniel Coombs
- Web page: https://patentgrep.com/patent/US20220191261A1

## CPC

- G06F 16/24568: {Data stream processing; Continuous queries}
- G06F 16/90335: {Query processing}
- H04L 65/75: Media network packet handling
- H04L 65/756: adapting media to device capabilities
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method includes processing a plurality of incoming messages via a plurality of feed receiver modules based on key assignment data. Each feed receiver module in the plurality of feed receiver modules receives a proper subset of messages of the plurality of incoming messages with keys included in a corresponding subset of a plurality of possible keys assigned to the each feed receiver module in the key assignment data and maintains a queue that includes messages of the proper subset of messages that compare favorably to a time window. Each feed receiver module identifies owned ones of the proper subset of messages having keys included in an owned subset of keys in the corresponding subset, corresponding to keys in the corresponding subset to which the each feed receiver module is assigned as an owner in the key assignment data, and emits only the owned ones of the proper subset of messages.

## Claims

### Claim 1

A method comprising:
processing a plurality of incoming messages via a plurality of feed receiver modules based on key assignment data by, for each feed receiver module in the plurality of feed receiver modules:
receiving a proper subset of messages of the plurality of incoming messages with keys included in a corresponding subset of a plurality of possible keys assigned to the each feed receiver module in the key assignment data;
maintaining a queue that includes messages of the proper subset of messages that compare favorably to a time window;
identifying owned ones of the proper subset of messages having keys included in an owned subset of keys in the corresponding subset, corresponding to keys in the corresponding subset to which the each feed receiver module is assigned as an owner in the key assignment data; and
emitting only the owned ones of the proper subset of messages.

### Claim 2 (depends on 1)

The method of claim 1, wherein the each feed receiver module maintains the queue in accordance with a time-based ordering based on timestamps included in the proper subset of messages, and wherein the queue is maintained by the each feed receiver module to include only ones of the proper subset of messages with timestamps that compare favorably to the time window.

### Claim 3 (depends on 1)

The method of claim 1, wherein the proper subset of messages of the plurality of incoming messages includes followed ones of the proper subset of messages, based on having keys included in a followed subset of keys in the corresponding subset, corresponding to keys in the corresponding subset to which the each feed receiver module is assigned as a follower in the key assignment data, and wherein the followed ones of the proper subset of messages are not emitted by the each feed receiver module.

### Claim 4 (depends on 1)

The method of claim 1, wherein the method further comprises:
determining key reassignment data indicating assignment of a new plurality of subsets of the plurality of possible keys to a proper subset of the plurality of feed receiver modules;
processing the plurality of incoming messages via the plurality of feed receiver modules based on the key reassignment data by, for each feed receiver module in the plurality of feed receiver modules:
receiving a second proper subset of messages of the plurality of incoming messages with keys included in a new subset of the new plurality of subsets of the plurality of possible keys assigned to the each feed receiver module in the key reassignment data;
maintaining the queue to include all messages of the second proper subset of messages that compare favorably to the time window; and
emitting only owned ones of the second proper subset of messages, based on having keys included in an owned subset of keys in the new subset, corresponding to ones of the new subset of the plurality of possible keys to which the each feed receiver module is assigned as an owner in the key reassignment data.

### Claim 5 (depends on 4)

The method of claim 4, wherein a set difference between the owned subset of keys in the new subset and the owned subset of keys in the corresponding subset is non-null for at least one of the plurality of feed receiver modules.

### Claim 6 (depends on 4)

The method of claim 4, wherein the method further comprises, for each of the plurality of feed receiver modules assigned as an owner to at least one new key in the key reassignment data:
identifying newly owned messages as a subset of the proper subset of messages included in the queue, based on having keys included in a newly owned subset of keys to which the each feed receiver module is assigned as an owner in the key reassignment data; and
emitting the newly owned messages.

### Claim 7 (depends on 6)

The method of claim 6, wherein each of the proper subset of messages in the queue maintained by the each feed receiver module includes a corresponding timestamp, and wherein identifying the newly owned messages included in the queue includes identifying ones of the proper subset of messages in the queue having a key included in that newly owned subset of keys and further having timestamps that are more-recent than another timestamp associated with the key for the key reassignment data.

### Claim 8 (depends on 7)

The method of claim 7, wherein the another timestamp is generated based on at least one of: a timestamp of a most recently emitted message for the key by a prior owner for the key indicated in the key assignment data.

### Claim 9 (depends on 4)

The method of claim 4, further comprising:
determining to generate the key reassignment data based on detecting that one feed receiver in the plurality of feed receiver modules undergoes at least one of: a failure condition, or an offline condition; and
generating the key reassignment data based on assigning a new one of the plurality of feed receiver modules as the owner for each key in the owned subset of keys assigned to the one feed receiver in the key assignment data;
wherein the proper subset of the plurality of feed receiver modules is selected to not include the one feed receiver; and
wherein each new one of the plurality of feed receiver modules assigned as the owner for a corresponding key in the owned subset of keys assigned to the one feed receiver in the key assignment data is selected based on being assigned as a follower of the corresponding key in the key assignment data.

### Claim 10 (depends on 9)

The method of claim 9, wherein a set of follower feed receiver modules of a plurality of feed receiver modules are assigned to the each key of the plurality of possible keys in the key assignment data based on:
assignment of a same, predefined number of feed receiver modules of the plurality of feed receiver modules to the each key of the plurality of possible keys; and
assignment of a set of follower rankings to the set of follower feed receiver modules;
wherein the each new one of the plurality of feed receiver modules is further selected based on having a most favorably ranked one of the set of follower rankings of the set of follower feed receiver modules assigned to the corresponding key in the key assignment data.

### Claim 11 (depends on 10)

The method of claim 10, wherein a remaining subset of the set of follower feed receiver modules assigned to the corresponding key in the key assignment data are assigned new follower rankings in the key reassignment data based on preserving an original ordering of the set of follower rankings, and based on incrementing each of the set of follower rankings to generate the new follower rankings.

### Claim 12 (depends on 11)

The method of claim 11,
wherein the key reassignment data includes assignment of the same, predefined number of feed receiver modules of the plurality of feed receiver modules to the each key of the plurality of possible keys;
wherein a new one of the plurality of feed receiver modules is assigned in each new set of follower feed receiver modules for the corresponding key in the key reassignment data based on the one of the set of follower feed receiver modules assigned to the corresponding key in the key assignment data, and having favorably ranked one of the set of follower rankings, being assigned as the owner for the corresponding key in the key reassignment data; and
wherein the new one of the plurality of feed receiver modules for the corresponding key is assigned a least favorable one of the set of follower rankings in the key reassignment data based on incrementing the each of the set of follower rankings to generate the new follower rankings for the remaining subset of the set of follower feed receiver modules of the corresponding key.

### Claim 13 (depends on 9)

The method of claim 9,
wherein exactly one owner feed receiver module of the plurality of feed receiver modules is assigned to each key of the plurality of possible keys for the plurality of incoming messages in the key assignment data based on application of a consistent hashing scheme, and wherein the new one of the plurality of feed receiver modules is assigned as the owner for each key in the owned subset of keys assigned to the one feed receiver in the key reassignment data based on reapplying of the consistent hashing scheme.

### Claim 14 (depends on 1)

The method of claim 1, wherein the plurality of incoming messages are received from a streaming source that streams the plurality of incoming messages in accordance with a non-redundant scheme, and wherein a plurality of messages that includes only the owned ones of the proper subset of messages emitted via the each feed receiver module are collectively emitted by the plurality of feed receiver modules in accordance with a fault-tolerant scheme with a level of redundancy dictated by a number of feed receiver modules in a set of follower feed receiver modules assigned to the each key of the plurality of possible keys in the key assignment data.

### Claim 15 (depends on 1)

The method of claim 1, wherein the owned ones of the proper subset of messages are emitted to a central data streaming module of the data stream processing system, and wherein the method further comprises:
receiving, via the central data streaming module, a plurality of messages from the plurality of feed receiver modules that includes only the owned ones of the proper subset of messages emitted via the each feed receiver module of the plurality of feed receiver modules; and
emitting, via the central data streaming module, a single data stream that includes the plurality of messages received from the plurality of feed receiver modules.

### Claim 16 (depends on 15)

The method of claim 15, wherein the method further comprises:
receiving, via a data processing module of the data stream processing system, the single data stream from the central data streaming module;
generating, via the data processing module, a plurality of computed values generated by performing at least one function upon values included in messages received in the single data stream; and
emitting, via the data processing module, the plurality of computed values.

### Claim 17 (depends on 16)

The method of claim 16, wherein the method further includes:
receiving, via the central data streaming module, the plurality of computed values from the data processing module; and
emitting the plurality of computed values to at least one of: a database storage system for long-term storage, or a client device for display to an end user via a display device.

### Claim 18 (depends on 1)

The method of claim 1, wherein the time window is configured based on user input to an interactive interface displayed via a display device of a client device communicating with the data stream processing system.

### Claim 19

A data stream processing system includes:
at least one processor; and
a memory that stores operational instructions that, when executed by the at least one processor, cause the data stream processing system to:
process a plurality of incoming messages via a plurality of feed receiver modules based on a key assignment data by, for each feed receiver module in the plurality of feed receiver modules:
receiving a proper subset of messages of the plurality of incoming messages with keys included in a corresponding subset of a plurality of possible keys assigned to the each feed receiver module in the key assignment data;
maintaining a queue that includes messages of the proper subset of messages that compare favorably to a time window;
identifying owned ones of the proper subset of messages having keys included in an owned subset of keys in the corresponding subset, corresponding to keys in the corresponding subset to which the each feed receiver module is assigned as an owner in the key assignment data; and
emitting only the owned ones of the proper subset of messages.

### Claim 20

A method for execution by a feed receiver module, comprising:
receiving a proper subset of messages of a plurality of incoming messages with keys included in a corresponding subset of a plurality of possible keys assigned to the feed receiver module in key assignment data;
maintaining a queue that includes messages of the proper subset of messages that compare favorably to a time window;
identifying owned ones of the proper subset of messages having keys included in an owned subset of keys in the corresponding subset, corresponding to keys in the corresponding subset to which the each feed receiver module is assigned as an owner in the key assignment data; and
emitting only the owned ones of the proper subset of messages.
