Systems and methods for storing and transferring message data

Abstract

A method includes storing a plurality of blocks in a queue, wherein each block stores one or more respective messages and is associated with a respective time that the block was stored in the queue. The method also includes allowing, by one or more computer processors, messages to be read from inactive blocks having associated storage times between a first time and a second time that is older than the first time, and deleting from the queue one or more inactive blocks having associated storage times older than the second time.

What is claimed is: 
     
         1 . A method, comprising:
 storing a plurality of blocks in a queue,
 wherein each block stores one or more respective messages and is associated with a respective time that the block was stored in the queue; 
   allowing, by one or more computer processors, messages to be read from inactive blocks having associated storage times between a first time and a second time that is older than the first time; and   deleting from the queue one or more inactive blocks having associated storage times older than the second time.   
     
     
         2 . The method of  claim 1 , wherein the storage times get older from a block designating a tail of the queue to a block designating a head of the queue. 
     
     
         3 . The method of  claim 2 , wherein new blocks are stored at the tail of the queue. 
     
     
         4 . The method of  claim 1 , wherein an active portion of the queue is associated with storage times newer than the first time, wherein an inactive portion of the queue is associated with storage times between the first time and second time, and wherein an inaccessible portion of the queue is associated with storage times older than the second time. 
     
     
         5 . The method of  claim 1 , wherein each block is assigned a time-to-reside, and wherein a block is designated as inactive when the time-to-reside of the block expires. 
     
     
         6 . The method of  claim 1 , wherein allowing messages to be read from inactive blocks having associated storage times between the first time and the second time that is older than the first time comprises:
 providing additional time to read messages from a block after a time-to-reside for the block expires.   
     
     
         7 . The method of  claim 1 , wherein each block is assigned a time-to-live, and wherein a block is deleted when the time-to-live of the block expires. 
     
     
         8 . The method of  claim 1 , wherein each block is assigned a time-to-live, wherein each block is assigned a time-to-reside, and wherein the time-to-live of a block is greater than the time-to-reside of the block. 
     
     
         9 . The method of  claim 1 , wherein the plurality of blocks are stored in the queue according to an order. 
     
     
         10 . The method of  claim 1 , comprising:
 sending read messages to a respective subscriber.   
     
     
         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 stores one or more respective messages and is associated with a respective time that the block was stored in the queue; 
 
 allow messages to be read from inactive blocks having associated storage times between a first time and a second time that is older than the first time; and 
 delete from the queue one or more inactive blocks having associated storage times older than the second time. 
   
     
     
         12 . The system of  claim 11 , wherein the storage times get older from a block designating a tail of the queue to a block designating a head of the queue. 
     
     
         13 . The system of  claim 12 , wherein new blocks are stored at the tail of the queue. 
     
     
         14 . The system of  claim 11 , wherein an active portion of the queue is associated with storage times newer than the first time, wherein an inactive portion of the queue is associated with storage times between the first time and second time, and wherein an inaccessible portion of the queue is associated with storage times older than the second time. 
     
     
         15 . The system of  claim 11 , wherein each block is assigned a time-to-reside, and wherein a block is designated as inactive when the time-to-reside of the block expires. 
     
     
         16 . The system of  claim 11 , wherein to allow messages to be read from inactive blocks having associated storage times between the first time and the second time that is older than the first time the one or more computer processors are further to:
 provide additional time to read messages from a block after a time-to-reside for the block expires.   
     
     
         17 . The system of  claim 11 , wherein each block is assigned a time-to-live, and wherein a block is deleted when the time-to-live of the block expires. 
     
     
         18 . The system of  claim 11 , wherein each block is assigned a time-to-live, wherein each block is assigned a time-to-reside, and wherein the time-to-live of a block is greater than the time-to-reside of the block. 
     
     
         19 . The system of  claim 11 , wherein the plurality of blocks are stored in the queue according to an order. 
     
     
         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 stores one or more respective messages and is associated with a respective time that the block was stored in the queue; 
   allow, by the one or more computer processors, messages to be read from inactive blocks having associated storage times between a first time and a second time that is older than the first time; and   delete from the queue one or more inactive blocks having associated storage times older than the second time.