Systems and methods for storing and transferring message data
First Claim
1. A method, comprising:
- storing, by one or more computer processors, a plurality of blocks in a queue,wherein each block includes at least one received message, andwherein each block is associated with a time that the block was stored in the queue;
designating, by the one or more computer processors, as inactive one or more blocks having associated storage times that are older than a first time;
reading, by the one or more computer processors, messages from inactive blocks until a second time that is older than the first time; and
deleting, by the one or more computer processors, one or more inactive blocks from the queue having associated storage times that are older than the second time.
2 Assignments
0 Petitions
Accused Products
Abstract
A method includes storing, by one or more computer processors, a plurality of blocks in a queue, wherein each block includes at least one received message, and wherein each block is associated with a time that the block was stored in the queue. The method further includes designating, by the one or more computer processors, as inactive one or more blocks having associated storage times that are older than a first time. The method further includes reading, by the one or more computer processors, messages from inactive blocks until a second time that is older than the first time. The method further includes deleting, by the one or more computer processors, one or more inactive blocks from the queue having associated storage times that are older than the second time.
-
Citations
20 Claims
-
1. A method, comprising:
-
storing, by one or more computer processors, a plurality of blocks in a queue, wherein each block includes at least one received message, and wherein each block is associated with a time that the block was stored in the queue; designating, by the one or more computer processors, as inactive one or more blocks having associated storage times that are older than a first time; reading, by the one or more computer processors, messages from inactive blocks until a second time that is older than the first time; and deleting, by the one or more computer processors, one or more inactive blocks from the queue having associated storage times that are older than the second time. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A system, comprising:
one or more computer processors programmed to perform operations to store a plurality of blocks in a queue, wherein each block includes at least one received message, and wherein each block is associated with a time that the block was stored in the queue; designate as inactive one or more blocks having associated storage times that are older than a first time; read messages from inactive blocks until a second time that is older than the first time; and delete one or more inactive blocks from the queue having associated storage times that are older than the second time. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
20. A non-transitory computer-readable medium having instructions stored thereon that, when executed by one or more computer processors, cause the one or more computer processors to:
-
store a plurality of blocks in a queue, wherein each block includes at least one received message, and wherein each block is associated with a time that the block was stored in the queue; designate as inactive one or more blocks having associated storage times that are older than a first time; read messages from inactive blocks a second time that is older than the first time; and delete one or more inactive blocks from the queue having associated storage times that are older than the second time.
-
Specification