Data storage systems and methods using a real-time messaging system

Patent metadata

Field	Value
Publication number	US-10447623-B2
Application number	US-201715442286-A
Country	US
Kind code	B2
Filing date	Feb 24, 2017
Priority date	Feb 24, 2017
Publication date	Oct 15, 2019
Grant date	Oct 15, 2019

Abstract

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for implementing key-value store functionality within a real-time messaging system. An example method includes: providing a plurality of channels, wherein each channel comprises an ordered plurality of messages, wherein each channel represents a unique key, and wherein each message comprises one or more key-value pairs; receiving a function comprising a key for identifying one of the plurality of channels and processing instructions to be applied to a subset of the key-value pairs; and applying the processing instructions based at least in part on the unique key.

First claim

What is claimed is:

1. A method of data management using a key-value structure, comprising:
providing a plurality of channels, wherein each channel comprises a plurality of messages published to the channel according to an order, wherein the plurality of messages are provided to one or more subscribers of the channel according to the order, wherein each channel is associated with a respective key, wherein at least one key is associated with a respective time-to-live, wherein the at least one key becomes unavailable when the respective time-to-live expires, and wherein each message comprises one or more key-value pairs;
receiving, by one or more computer processors, a function comprising a key for identifying one of the plurality of channels and processing instructions to be applied to a subset of the key-value pairs; and
applying the processing instructions based at least in part on the key.

2. The method of claim 1 , wherein the function is received and stored at a first processing node based at least in part on the processing instructions, and wherein the processing instructions are applied as the key-value pairs are received at the first processing node.

3. The method of claim 1 , wherein the processing instructions comprise instructions to read values from key-value pairs assigned to the one of the plurality of channels based on the key, and wherein the key is unique.

4. The method of claim 1 , wherein the function is received at a first processing node and, based at least in part on the processing instructions, forwarded to a second processing node at which the processing instructions are applied.

5. The method of claim 1 , wherein the processing instructions comprise instructions to write values as key-value pairs to the one of the plurality of channels based on the key.

6. The method of claim 1 , wherein the processing instructions comprise instructions to delete values from the one of the plurality of channels based on the key.

7. The method of claim 1 , wherein the processing instructions comprise modifications to values within the key-value pairs from a channel based on the key.

8. The method of claim 1 , wherein the subset of key-value pairs comprise a historical series of key-value pairs.

9. The method of claim 8 , wherein the historical series of key-value pairs comprises a state log for each of the plurality of channels.

10. The method of claim 9 , wherein application of the processing instructions to the historical series of key-value pairs restores the channel to a prior state.

11. A messaging system, comprising:
a memory; and
one or more computer processors to:
provide a plurality of channels of a publish-subscribe system, wherein each channel comprises a plurality of messages published to the channel according to an order, wherein the plurality of messages are provided to one or more subscribers of the channel according to the order, wherein each channel is associated with a respective key, wherein at least one key is associated with a respective time-to-live, wherein the at least one key becomes unavailable when the respective time-to-live expires, and wherein each message comprises one or more key-value pairs;
receive a function comprising a key for identifying one of the plurality of channels and processing instructions to be applied to a subset of the key-value pairs; and
apply the processing instructions based at least in part on the key.

12. The messaging system of claim 11 , wherein the function is received and stored at a first processing node based at least in part on the processing instructions, and wherein the processing instructions are applied as the key-value pairs are received at the first processing node.

13. The messaging system of claim 11 , wherein the processing instructions comprise instructions to read values from key-value pairs assigned to the one of the plurality of channels based on the key, and wherein the key is unique.

14. The messaging system of claim 11 , wherein the function is received at a first processing node and, based at least in part on the processing instructions, forwarded to a second processing node at which the processing instructions are applied.

15. The messaging system of claim 11 , wherein the processing instructions comprise instructions to write values as key-value pairs to the one of the plurality of channels based on the key.

16. The messaging system of claim 11 , wherein the processing instructions comprise instructions to delete values from the one of the plurality of channels based on the key.

17. The messaging system of claim 11 , wherein the processing instructions comprise modifications to values within the key-value pairs from a channel based on the key.

18. The messaging system of claim 11 , wherein the subset of key-value pairs comprise a historical series of key-value pairs.

19. The messaging system of claim 18 , wherein the historical series of key-value pairs comprises a state log for each of the plurality of channels, and wherein application of the processing instructions to the historical series of key-value pairs restores the channel to a prior state.

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:
provide a plurality of channels of a publish-subscribe system, wherein each channel comprises a plurality of messages published to the channel according to an order, wherein the plurality of messages are provided to one or more subscribers of the channel according to the order, wherein each channel is associated with a respective key, wherein at least one key is associated with a respective time-to-live, wherein the at least one key becomes unavailable when the respective time-to-live expires, and wherein each message comprises one or more key-value pairs;
receive, by the one or more computer processors, a function comprising a key for identifying one of the plurality of channels and processing instructions to be applied to a subset of the key-value pairs; and
apply the processing instructions based at least in part on the key.

Assignees

• Machine Zone Inc
• Satori Worldwide Llc

Inventors

• Milyakov Igor
• Linder Fredrik E
• Koinov Anton
• Orsini Francois
• Sedan Boaz
• Khabinov Oleg
• Puzon Bartlomiej

Classifications

• G06F16/2474

  Sequence data queries, e.g. querying versioned data · CPC title

• G06F16/23

  Updating · CPC title

• H04L51/04 Primary

  Real-time or near real-time messaging, e.g. instant messaging [IM] · CPC title

• H04L67/146

  Markers for unambiguous identification of a particular session, e.g. session cookie or URL-encoding · CPC title

• H04L67/26

  Electricity · mapped topic