IP Library Granted Patent US 11,055,027
Granted Patent B1
US 11,055,027 · App. 16/685,633 · Granted Jul 6, 2021

Dynamic queue management

Inventor: Austin Formosa Lee (Burbank, CA)
Assignee: Rapid7, Inc.
G06F3/0659G06F3/0604G06F3/0673
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,055,027
App. No.
16/685,633
Granted
Jul 6, 2021
Kind
B1
Abstract

Methods and systems for managing queues are disclosed. The disclosed methods involve receiving, at an interface, a request to store a message in a queue, storing the message as a row in a key-value data store, extracting at least one attribute from the message; and selecting the message for processing based on the at least one extracted attribute.

Claims (37)

1. A method of managing queues, the method comprising:

receiving, at an interface, a request to store a message in a queue;

storing the message as a row in a key-value data store that includes at least one primary key that is composed of a first partition key and a first sort key, wherein the queue is associated with a partition in the data store and the data store includes a plurality of partitions that are each associated with a queue;

elevating the queue storing the message for analysis based on a number of messages within the queue and an existence duration of the queue;

deprioritizing at least a second queue based on a number of messages within the second queue and existence duration of the second queue;

extracting, using a processor executing instructions stored on memory, at least one attribute from the message; and

selecting, using the processor, the message for processing based on the at least one extracted attribute.

2. The method of claim 1 wherein the at least one attribute includes at least one of age of the message and sensitivity of the message.

3. The method of claim 1 wherein the partition includes a plurality of messages, and the method further includes:

performing, using the processor, an attribute analysis on each of the plurality of messages, and

elevating for processing a message within the partition based on the attribute analysis.

4. The method of claim 1 further comprising associating a unique identifier of the message to the first sort key of the queue.

5. The method of claim 1 wherein the at least one primary key is unique to the queue.

6. The method of claim 5 wherein the primary key is composed of:

an organization and a name;

an organization and a sub-division;

a country and a state; or

a country and a city.

7. A system for managing queues, the system comprising:

an interface for at least receiving a request to store a message in a queue;

a key-value data store that includes at least one primary key that is composed of a first partition key and a first sort key, wherein the queue is associated with a partition in the data store and the data store includes a plurality of partitions that are each associated with a queue; and

a processor executing instructions stored in memory configured to:

elevate the queue storing the message for analysis based on a number of messages within the queue and an existence duration of the queue,

deprioritize at least a second queue based on a number of messages within the second queue and existence duration of the second queue,

extract at least one attribute from the message, and

select the message for processing based on the at least one extracted attribute.

8. The system of claim 7 wherein the at least one attribute includes at least one of age of the message and sensitivity of the message.

9. The system of claim 7 wherein the partition includes a plurality of messages and the processor is further configured to:

perform an attribute analysis on each of the plurality of messages; and

elevate for processing a message within the partition based on the attribute analysis.

10. The system of claim 7 wherein a unique identifier of the message is associated with the first sort key of the queue.

11. The system of claim 7 wherein the processor is further configured to associate the message with a primary key that is unique to the queue.

12. The system of claim 11 wherein the primary key is composed of:

an organization and a name;

an organization and a sub-division;

a country and a state; or

a country and a city.

Assignments (4)
SECURITY INTEREST Recorded Jun 26, 2025
From: RAPID7, INC.; RAPID7 LLC
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 071743/0537 →
RELEASE OF SECURITY INTEREST Recorded Dec 27, 2024
From: KEYBANK NATIONAL ASSOCIATION, AS ADMINISTRATIVE AGENT
To: RAPID7, INC.
Reel/Frame 069785/0328 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 4, 2020
From: LEE, AUSTIN
To: RAPID7, INC.
Reel/Frame 054594/0720 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Apr 24, 2020
From: RAPID7, INC.
To: KEYBANK NATIONAL ASSOCIATION
Reel/Frame 052489/0939 →
Cited By (33)
US 12,190,069 US 12,210,841 US 12,210,843 US 12,217,009 US 12,217,010 US 12,223,285 US 12,223,286 US 12,223,287 US 12,236,199 US 12,242,812 US 12,242,813 US 12,242,814 US 12,254,277 US 12,254,278 US 12,260,181 US 12,260,182 US 12,314,660 US 12,321,697 US 12,340,180 US 12,353,827 US 12,393,777 US 12,400,085 US 12,406,146 US 12,430,503 US 12,430,504 US 12,430,505 US 12,456,008 US 12,499,320 US 12,518,107 US 12,524,619 US 12,554,935 US 12,585,883 US 12,596,881