MESSAGE CACHE MANAGEMENT FOR MESSAGE QUEUES
    1.
    发明申请
    MESSAGE CACHE MANAGEMENT FOR MESSAGE QUEUES 审中-公开
    消息队列管理消息队列

    公开(公告)号:WO2018044538A1

    公开(公告)日:2018-03-08

    申请号:PCT/US2017/046757

    申请日:2017-08-14

    Abstract: A method and apparatus for message cache management for message queues is provided. A plurality of messages from a plurality of enqueuers are enqueued in a queue comprising one or more shards, each shard comprising one or more subshards. A message cache is maintained in memory. Enqueuing a message includes enqueuing the message in a current subshard of a particular shard, which includes storing the message in a cached subshard corresponding to the current subshard of the particular shard. For each dequeuer-shard pair, a dequeue rate is determined. Estimated access time data is generated that includes an earliest estimated access time for each of a plurality of subshards based on the dequeuer-shard pair dequeue rates. A set of subshards is determined for storing as cached subshards in the message cache based on the earliest estimated access times for the plurality of subshards.

    Abstract translation: 提供了一种用于消息队列的消息高速缓存管理的方法和装置。 来自多个入队者的多个消息入队到包含一个或多个碎片的队列中,每个碎片包括一个或多个次要碎片。 消息缓存保存在内存中。 排队消息包括将消息排入特定分片的当前次要硬件中,其包括将消息存储在对应于特定分片的当前次要硬件的高速缓存次硬件中。 对于每个出队 - 分片对,确定出队率。 基于出队 - 分片对出列率,生成估计的存取时间数据,该存取时间数据包括多个副冷却器中的每一个的最早的估计存取时间。 基于多个子频道的最早估计访问时间,确定用于在消息高速缓存中存储为高速缓存的子频道的一组子频道。

    SUPPORTING BLOCKCHAIN COLLECTIONS IN A DATABASE

    公开(公告)号:WO2021050299A1

    公开(公告)日:2021-03-18

    申请号:PCT/US2020/048538

    申请日:2020-08-28

    Abstract: Herein are high throughput techniques for incorporating cryptographic blockchains into relational data. In an embodiment, a computer indicates, in a database dictionary in a database, that a relational table is for blockchain storage. The relational table contains application column(s). In response to that indication, the relational table is associated with system column(s) that are unmodifiable by administrators and clients of the database. The system column(s) include a cryptographic hash column. A request to store a particular value in a particular application column is received from a client. In response to receiving the request, a cryptographic hash value is calculated for a new row for the relational table. In the relational table, the computer stores the new row that contains: the particular value in the particular application column, and the cryptographic hash value in the cryptographic hash column.

    NATIVE PERSISTENT STORE SUPPORT FOR BLOCKCHAINS

    公开(公告)号:WO2021021757A1

    公开(公告)日:2021-02-04

    申请号:PCT/US2020/043779

    申请日:2020-07-27

    Abstract: Distributed ledgered data is stored within a distributed persistent storage system comprising multiple persistent storage systems as distributed ledgered participants. The distributed ledgered data is maintained using the native capabilities of a persistent storage system. The distributed ledgered data is replicated as persistent data objects in a "ledgered repository of objects" that are replicated at each of the persistent storage systems. Changes at one persistent storage system are recorded within a block in a distributed blockchain that is distributed across each of the other distributed ledgered participants. The other distributed ledgered participants read the changes from the blockchain and apply the changes to the respective replicas at each of the other distributed ledgered participants.

    MESSAGE CACHE MANAGEMENT FOR MESSAGE QUEUES
    9.
    发明公开

    公开(公告)号:EP3507694A1

    公开(公告)日:2019-07-10

    申请号:EP17757989.3

    申请日:2017-08-14

    Abstract: A method and apparatus for message cache management for message queues is provided. A plurality of messages from a plurality of enqueuers are enqueued in a queue comprising one or more shards, each shard comprising one or more subshards. A message cache is maintained in memory. Enqueuing a message includes enqueuing the message in a current subshard of a particular shard, which includes storing the message in a cached subshard corresponding to the current subshard of the particular shard. For each dequeuer-shard pair, a dequeue rate is determined. Estimated access time data is generated that includes an earliest estimated access time for each of a plurality of subshards based on the dequeuer-shard pair dequeue rates. A set of subshards is determined for storing as cached subshards in the message cache based on the earliest estimated access times for the plurality of subshards.

Patent Agency Ranking