# US 2025/0097181 A1 · Claim check mechanism for a message payload in an enterprise messaging system

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

- Number: US 2025/0097181 A1
- Document ID: US20250097181A1
- Status: Published application
- Kind: A1
- Application number: 18/470,928
- Filed: 2023-09-20
- Published: 2025-03-20
- Earliest claimed: 2023-09-20
- Assignees: Red Hat, Inc.
- Applicants: Red Hat, Inc.
- Inventors: Andrea Cosentino; Paolo Antinori
- Web page: https://patentgrep.com/patent/US20250097181A1

## CPC

- H04L 51/21: Monitoring or handling of messages
- G06F 9/546: {Message passing systems or structures, e.g. queues}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method includes storing, by a processing device of an enterprise messaging system comprising a plurality of nodes, a message payload in a data store, wherein the data store is shared by the plurality of nodes, wherein the message payload is extracted from a message; sending, to a first node of the plurality of nodes, a metadata item associated with the message; responsive to determining that a key corresponding to the message payload has been used by the first node to retrieve the message payload, decrementing a removal counter associated with the key; and responsive to determining that the removal counter satisfies a removal threshold criterion, removing the message payload from the data store.

## Claims

### Claim 1

A method comprising:
storing, by a processing device of an enterprise messaging system comprising a plurality of nodes, a message payload in a data store, wherein the data store is shared by the plurality of nodes, wherein the message payload is extracted from a message;
sending, to a first node of the plurality of nodes, a metadata item associated with the message;
responsive to determining that a key corresponding to the message payload has been used by the first node to retrieve the message payload, decrementing a removal counter associated with the key; and
responsive to determining that the removal counter satisfies a removal threshold criterion, removing the message payload from the data store.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
receiving, from the first node, a request to retrieve the message payload;
identifying the key corresponding to the message payload; and
sending the key to the first node.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
compressing the key.

### Claim 4 (depends on 3)

The method of claim 3, further comprising:
storing, in a data structure, the compressed key corresponding to the message payload and the removal counter associated with the key.

### Claim 5 (depends on 1)

The method of claim 1, wherein removing the message payload from the data store further comprises:
placing an identifier of the message payload in a removal candidate pool;
selecting, based on a removal policy, a first message payload from the candidate pool; and
removing the first message payload from the data store.

### Claim 6 (depends on 5)

The method of claim 5, wherein the removal policy comprises one of: a least recently used (LRU) rule, a least frequently used (LFU) rule, or a first-in-first-out (FIFO) rule.

### Claim 7 (depends on 1)

The method of claim 1, wherein removing the message payload from the data store is performed responsive to detecting a triggering event, wherein the triggering event comprises at least one of: a resource of the data store satisfying a threshold criterion, or a queue associated with the data store satisfying a threshold criterion.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
determining that the key corresponding to the message payload has been borrowed by a second node of the plurality of nodes; and
responsive to determining that the key has been borrowed by the second node, decrementing a borrow counter associated with the key.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
determining that the key corresponding to the message payload has been released by a second node of the plurality of nodes; and
responsive to determining that the key has been returned by the second node, incrementing a borrow counter associated with the key.

### Claim 10 (depends on 1)

The method of claim 1, further comprising:
responsive to determining that the removal counter does not satisfy the removal threshold criterion and that a borrow counter associated with the key satisfies a borrow threshold criterion, rendering the key unavailable.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
providing an estimated time of availability of the key.

### Claim 12

A system comprising:
a memory device;
a processing device operatively coupled to the memory device, to perform operations comprising:
storing, by the processing device of an enterprise messaging system comprising a plurality of nodes, a message payload in a data store, wherein the data store is shared by the plurality of nodes, wherein the message payload is extracted from a message;
sending, to a first node of the plurality of nodes, a metadata item associated with the message;
responsive to determining that a key corresponding to the message payload has been used by the first node to retrieve the message payload, decrementing a removal counter associated with the key; and
responsive to determining that the removal counter satisfies a removal threshold criterion, removing the message payload from the data store.

### Claim 13 (depends on 12)

The system of claim 12, wherein the operations further comprise:
receiving, from the first node, a request to retrieve the message payload;
identifying the key corresponding to the message payload; and
sending the key to the first node.

### Claim 14 (depends on 12)

The system of claim 12, wherein the operations further comprise:
compressing the key.

### Claim 15 (depends on 14)

The system of claim 14, wherein the operations further comprise:
storing, in a data structure, the compressed key corresponding to the message payload and the removal counter associated with the key.

### Claim 16 (depends on 12)

The system of claim 12, wherein removing the message payload from the data store further comprises:
placing an identifier of the message payload in a removal candidate pool;
selecting, based on a removal policy, a first message payload from the candidate pool; and
removing the first message payload from the data store.

### Claim 17 (depends on 12)

The system of claim 12, wherein the operations further comprise:
determining that the key corresponding to the message payload has been borrowed by a second node of the plurality of nodes; and
responsive to determining that the key has been borrowed by the second node, decrementing a borrow counter associated with the key.

### Claim 18 (depends on 12)

The system of claim 12, wherein the operations further comprise:
determining that the key corresponding to the message payload has been returned by a second node of the plurality of nodes; and
responsive to determining that the key has been returned by the second node, incrementing a borrow counter associated with the key.

### Claim 19 (depends on 12)

The system of claim 12, wherein the operations further comprise:
responsive to determining that the removal counter does not satisfy the removal threshold criterion and that a borrow counter associated with the key satisfies a borrow threshold criterion, rendering the key unavailable.

### Claim 20

A non-transitory machine-readable storage medium including instructions that, when accessed by a processing device, cause the processing device to perform operations comprising:
storing, by the processing device of an enterprise messaging system comprising a plurality of nodes, a message payload in a data store, wherein the data store is shared by the plurality of nodes, wherein the message payload is extracted from a message;
sending, to a first node of the plurality of nodes, a metadata item associated with the message;
responsive to determining that a key corresponding to the message payload has been used by the first node to retrieve the message payload, decrementing a removal counter associated with the key; and
responsive to determining that the removal counter satisfies a removal threshold criterion, removing the message payload from the data store.
