Handling memory pressure in an in-database sharded queue
US9495296B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 28, 2014 |
| Grant date | Nov 15, 2016 |
| Priority date | — |
| Expiry date | Apr 25, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2212/465
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Handling memory pressure in an in-database sharded queue is described. Messages from a plurality of enqueuers are stored in a plurality of shards of a sharded queue. Messages from a first enqueuer are stored in a first shard. A queue table corresponding to the sharded queue is maintained. In volatile memory, a plurality of message caches is maintained, each message cache corresponding to a shard of the plurality of shards. Memory pressure is detected based on memory usage of the volatile memory. To store a specific message from the enqueuer, the specific message is stored in rows of the queue table that are assigned to the first shard. When memory pressure is not detected, the specific message is stored in a first message cache corresponding to the first shard. Subscribers of the sharded queue are caused to dequeue messages from the plurality of shards.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.