专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20210073209A1 SUPPORTING BLOCKCHAIN COLLECTIONS IN A DATABASE 有权
公开(公告)号：US20210073209A1
公开(公告)日：2021-03-11
申请号：US16923279
申请日：2020-07-08
申请人： Oracle International Corporation
发明人： Juan R. Loaiza , Wei-Ming Hu , Amrish Srivastava , Mahesh Baburao Girkar , James W. Stamos
IPC分类号： G06F16/23 , G06F16/22 , H04L9/06
摘要： 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.

2. 发明授权

US10540217B2 Message cache sizing 有权
公开(公告)号：US10540217B2
公开(公告)日：2020-01-21
申请号：US15685270
申请日：2017-08-24
申请人： Oracle International Corporation
发明人： Mukesh Jaiswal , Shubha Bose , James W. Stamos , Alan R. Downing
IPC分类号： G06F9/54 , G06F12/0811
摘要： A method and apparatus for message cache sizing are provided. A plurality of messages from one or more enqueuers are enqueued in a queue comprising at least one shard. Each shard includes one or more subshards. A message cache configured to store a plurality of cached subshards is maintained in memory. The plurality of messages is dequeued from the message cache by one or more dequeuers. An estimated enqueue rate is determined for each shard. An estimated dequeue rate is determined for each dequeuer-shard pair. Estimated restore overhead data is determined over a range of candidate message cache sizes based on the estimated enqueue rate for each shard and the estimated dequeue rate for each dequeuer-shard pair. A preferred message cache size is determined based on the estimated restore overhead data.

3. 发明申请

US20180081745A1 MESSAGE CACHE SIZING 审中-公开
公开(公告)号：US20180081745A1
公开(公告)日：2018-03-22
申请号：US15685270
申请日：2017-08-24
申请人： Oracle International Corporation
发明人： Mukesh Jaiswal , Shubha Bose , James W. Stamos , Alan R. Downing
IPC分类号： G06F9/54 , G06F12/0811
摘要： A method and apparatus for message cache sizing are provided. A plurality of messages from one or more enqueuers are enqueued in a queue comprising at least one shard. Each shard includes one or more subshards. A message cache configured to store a plurality of cached subshards is maintained in memory. The plurality of messages is dequeued from the message cache by one or more dequeuers. An estimated enqueue rate is determined for each shard. An estimated dequeue rate is determined for each dequeuer-shard pair. Estimated restore overhead data is determined over a range of candidate message cache sizes based on the estimated enqueue rate for each shard and the estimated dequeue rate for each dequeuer-shard pair. A preferred message cache size is determined based on the estimated restore overhead data.

4. 发明授权

US11494347B1 Efficient update-anywhere replication of queue operations on a replicated message queue 有权
公开(公告)号：US11494347B1
公开(公告)日：2022-11-08
申请号：US17308906
申请日：2021-05-05
申请人： Oracle International Corporation
发明人： James W. Stamos
IPC分类号： G06F16/182 , G06F16/27
摘要： Update-anywhere replication of queuing operations on a replicated message queue is performed. A dequeue ready time (“ready time”) is associated by each participating persistent storage server with a queue message to be dequeued. Unless a queue message is already locked by a distributed dequeue transaction, a participating leader PSS initiates a distributed dequeue transaction for the queue message once the ready time for the queue message is reached, subject to certain conditions. An initiator PSS is in effect designated for a queue message; the initiator PSS associates a desired ready time for the queue message. The designated PSS is referred to herein as the primary leader PSS and the ready time the primary PSS associates with queue message is referred as the primary ready time. The other participating leader PSSs are backup leader PSSs which serve as backups for dequeuing a queue message. Each backup leader PSS associates a later “backup ready time” with the queue message. In an embodiment, each backup ready time for a queue message is different. The primary ready time for a queue message together with backup ready times for the queue message form a more or less staggered set of ready times. If the primary leader PSS does not initiate dequeuing of a queue message before a successive backup ready time, the respective backup leader PSS may initiate dequeuing. This measure provides fault tolerance for dequeuing a queue message. Because the ready times are staggered, not all PSSs will initiate dequeuing at more or less the same time. Thus, initiator conflict is substantially reduced while fault tolerance is provided.

5. 发明申请

US20140040203A1 STATEMENT-LEVEL AND PROCEDURAL-LEVEL REPLICATION 有权
标题翻译：声明级和程序级别的复制
公开(公告)号：US20140040203A1
公开(公告)日：2014-02-06
申请号：US14052531
申请日：2013-10-11
申请人： Oracle International Corporation
发明人： Edwina M. Lu , James W. Stamos , Nimar S. Arora , Lik Wong , Haobo Xu , Thuvan Hoang , Byron Wang , Lakshminarayanan Chidambaran
IPC分类号： G06F17/30
CPC分类号： G06F17/30575 , G06F17/30578
摘要： Techniques for replicating data in database systems are described. In an example embodiment, a set of changes is received at a destination database, where the set of changes has been applied at a source database and is being replicated from the source database to the destination database. The set of changes is analyzed and it is determined that the set of changes includes two or more of: a subset of row-level changes, a subset of statement-level changes, and a subset of procedure-level changes. A set of dependencies is determined at least between the changes that are included in the subsets of changes. The changes, in the subsets of changes, are assigned to two or more processing elements. The set of changes is applied to the destination database by executing the two or more processing elements in parallel to each other and based on the set of dependencies.
摘要翻译：描述了在数据库系统中复制数据的技术。在示例实施例中，在目的地数据库处接收一组改变，其中该变更集合已经在源数据库处应用并且正在从源数据库复制到目的地数据库。分析一组变化，并且确定该组更改包括以下两个或多个：行级更改的子集，语句级更改的子集以及过程级更改的子集。至少在更改子集中包含的更改之间确定一组依赖关系。更改子集中的更改分配给两个或多个处理元素。通过相互并行并基于一组依赖关系执行两个或多个处理元件，将该组更改应用于目的地数据库。

6. 发明授权

US11640391B2 Supporting blockchain collections in a database 有权
公开(公告)号：US11640391B2
公开(公告)日：2023-05-02
申请号：US16923279
申请日：2020-07-08
申请人： Oracle International Corporation
发明人： Juan R. Loaiza , Wei-Ming Hu , Amrish Srivastava , Mahesh Baburao Girkar , James W. Stamos , Sachin Sonawane
IPC分类号： G06F16/23 , G06F16/2455 , H04L9/06 , G06F16/22 , H04L9/00
摘要： 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.

7. 发明申请

US20220035652A1 USING MULTIPLE BLOCKCHAINS FOR APPLYING TRANSACTIONS TO A SET OF PERSISTENT DATA OBJECTS IN PERSISTENT STORAGE SYSTEMS 有权
公开(公告)号：US20220035652A1
公开(公告)日：2022-02-03
申请号：US16944011
申请日：2020-07-30
申请人： Oracle International Corporation
发明人： James W. Stamos , Nelson Corcoran
IPC分类号： G06F9/46 , H04L9/06 , G06F16/182 , G06F9/448
摘要： A ledgered repository of persistent data objects is replicated on a network of persistent storage systems (PSSs) by transactions recorded across multiple blockchains. The blockchains are replicated on each of the PSSs. Using multiple blockchains enables greater parallelism; however, use of the multiple blockchains requires using measures that ensure that transactions distributed across multiple blockchains are applied in way that ensures a level of transactional consistency. Furthermore, the measures are efficient, thereby reducing overhead of maintaining a level of transactional consistency and increasing throughput of applying the transactions using multiple blockchains.

8. 发明授权

US09767138B2 In-database sharded queue for a shared-disk database 有权
公开(公告)号：US09767138B2
公开(公告)日：2017-09-19
申请号：US14095734
申请日：2013-12-03
申请人： Oracle International Corporation
发明人： Mukesh Jaiswal , Shubha Bose , James W. Stamos
IPC分类号： G06F17/30
CPC分类号： G06F17/30371
摘要： An in-database sharded queue for a shared-disk database is provided. First messages from at least one first enqueuer are stored on a first queue shard. The first enqueuer/s execute in a first instance of a shared-disk database system. The first shard includes a first plurality of subshards. Second messages from at least one second enqueuer are stored on a second queue shard. The second enqueuer/s execute in a second instance of the shared-disk database system. The second shard includes a second plurality of subshards. In volatile memory of the respective instances, a first message cache and a second message cache is maintained for the first shard and the second shard. The respective message caches include at least one buffer associated with the plurality of subshards.

9. 发明申请

US20140372702A1 HANDLING MEMORY PRESSURE IN AN IN-DATABASE SHARDED QUEUE 有权
标题翻译：在数据库中处理记忆压力
公开(公告)号：US20140372702A1
公开(公告)日：2014-12-18
申请号：US14165974
申请日：2014-01-28
申请人： Oracle International Corporation
发明人： Sunitha Subramanyam , Shubha Bose , Anil Madan , Devendra Singh , James W. Stamos , Mukesh Jaiswal
IPC分类号： G06F12/08
CPC分类号： G06F12/0848 , G06F12/0868 , G06F17/30067 , G06F2212/465
摘要： 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.
摘要翻译：描述处理数据库内的分片队列中的内存压力。来自多个入站者的消息被存储在分片队列的多个分片中。来自第一个进入者的消息存储在第一个分片中。维护与分片队列对应的队列表。在易失性存储器中，维护多个消息高速缓存，每个消息高速缓存对应于多个分片中的分片。基于易失性存储器的存储器使用来检测存储器压力。要从进入者存储特定消息，特定消息存储在分配给第一个分片的队列表的行中。当未检测到存储器压力时，特定消息存储在与第一分片对应的第一消息高速缓存中。导致分片队列的订阅者从多个分片中发出消息。

10. 发明申请

US20140372489A1 IN-DATABASE SHARDED QUEUE FOR A SHARED-DISK DATABASE 有权
标题翻译：用于共享磁盘数据库的数据库数据库
公开(公告)号：US20140372489A1
公开(公告)日：2014-12-18
申请号：US14095734
申请日：2013-12-03
申请人： Oracle International Corporation
发明人： Mukesh Jaiswal , Shubha Bose , James W. Stamos
IPC分类号： G06F17/30
CPC分类号： G06F17/30371
摘要： An in-database sharded queue for a shared-disk database is provided. First messages from at least one first enqueuer are stored on a first queue shard. The first enqueuer/s execute in a first instance of a shared-disk database system. The first shard includes a first plurality of subshards. Second messages from at least one second enqueuer are stored on a second queue shard. The second enqueuer/s execute in a second instance of the shared-disk database system. The second shard includes a second plurality of subshards. In volatile memory of the respective instances, a first message cache and a second message cache is maintained for the first shard and the second shard. The respective message caches include at least one buffer associated with the plurality of subshards.
摘要翻译：提供了共享磁盘数据库的数据库内分片队列。来自至少一个第一进入者的第一消息被存储在第一队列碎片上。第一个启动器在共享磁盘数据库系统的第一个实例中执行。第一分片包括第一多个子素。来自至少一个第二进入者的第二消息被存储在第二队列碎片上。第二个进入者在共享磁盘数据库系统的第二个实例中执行。第二分片包括第二多个子素。在各个实例的易失性存储器中，为第一分片和第二分片维护第一消息高速缓存和第二消息高速缓存。相应的消息高速缓存包括与多个子硬件相关联的至少一个缓冲器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式