Abstract: Described are improved systems, computer program products, and methods for an improved approach to access small to medium size objects (MOBs) stored in LOB data type columns of a RDBMS. The approach includes receiving a SQL statement comprising a retrieval of a large object (LOB). The approach also includes determining whether to return a value of the LOB or a reference to a storage location storing the value of the LOB based on: a data dictionary property of the LOB to return the value of the LOB, a function included in the SQL statement to return the value of the LOB, or a flag derived from a SQL operator tree propagation to return the value of the LOB.

Abstract: Described are improved systems, computer program products, and methods for an improved approach to access small to medium size objects (MOBs) stored in LOB data type columns of a RDBMS. The approach includes receiving a SQL statement comprising a retrieval of a large object (LOB). The approach also includes determining whether to return a value of the LOB or a reference to a storage location storing the value of the LOB based on: a data dictionary property of the LOB to return the value of the LOB, a function included in the SQL statement to return the value of the LOB, or a flag derived from a SQL operator tree propagation to return the value of the LOB.

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.

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.