Handling memory pressure in an in-database sharded queue
AssigneeOracle International Corporation
InventorsSunitha Subramanyam, Shubha Bose, Anil Madan, Devendra Singh, James W. Stamos, Mukesh Jaiswal
Life of this patent
Estimating the term…
Loading patent…
AssigneeOracle International Corporation
InventorsSunitha Subramanyam, Shubha Bose, Anil Madan, Devendra Singh, James W. Stamos, Mukesh Jaiswal
Estimating the term…
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.
A method comprising:
A method comprising:
A non-transitory computer-readable medium storing instructions which, when executed by one or more processors, cause the one or more processors to carry out the steps of:
A non-transitory computer-readable medium storing instructions which, when executed by one or more processors, cause the one or more processors to carry out the steps of:
Dependencies are inferred from the claim text.