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

1. 发明申请

US20140095250A1 INNOVATION MANAGEMENT 审中-公开
标题翻译：创新管理
公开(公告)号：US20140095250A1
公开(公告)日：2014-04-03
申请号：US13843522
申请日：2013-03-15
申请人： ORACLE INTERNATIONAL CORPORATION
发明人： Gayle Hayes , Andre Guldi , David Wolfmueller , Brett Shane Goodwin , John Kelley , Shankar Muthane , Charu Roy , Devendra Singh
IPC分类号： G06Q10/06
CPC分类号： G06Q10/0637
摘要： A system and method for facilitating facilitating management of innovations and accompanying constituent concepts. An example method includes providing a first user option to define one or more alternate solution categories for one or more concepts, wherein each alternate solution category is associated with an innovation comprising a structure of concepts, and wherein an alternate solution category is associated with an alternate solution structure; providing a second user option to define a concept as an alternate solution concept belonging to an alternate solution category; and associating one or more metric attributes with an alternate solution concept. The user options may be provided via a user interface display screen with additional user interface controls for generating analysis pertaining to alternative concept structures in association with one or more metrics, such as supply chain risk, cost, compliance, fulfillment, and/or other product objectives or metrics.
摘要翻译：促进促进创新管理和伴随组成概念的系统和方法。示例性方法包括提供第一用户选项以为一个或多个概念定义一个或多个备选解决方案类别，其中每个替代解决方案类别与包括概念结构的创新相关联，并且其中替代解决方案类别与备选解决方案类别相关联解决方案结构; 提供第二用户选项以将概念定义为属于备选解决方案类别的替代解决方案概念; 以及将一个或多个度量属性与替代解决方案概念相关联。用户选项可以经由用户界面显示屏幕提供，附加的用户界面控制用于产生与一个或多个指标（例如供应链风险，成本，合规性，履行和/或其他产品）相关联的替代概念结构的分析目标或指标。

2. 发明申请

US20190163545A1 MESSAGES WITH DELAYED DELIVERY IN AN IN-DATABASE SHARDED QUEUE 审中-公开
公开(公告)号：US20190163545A1
公开(公告)日：2019-05-30
申请号：US15827839
申请日：2017-11-30
申请人： Oracle International Corporation
发明人： Devendra Singh , Mukesh Jaiswal , Shubha Bose , Abhilash Tomar
IPC分类号： G06F9/54 , G06F17/30 , G06F12/0868
摘要： A DBMS maintains delayed and non-delayed messages within a non-delay shard and a delay shard that function as a pair. The DBMS stages non-delayed messages in enqueue-time order within the non-delay shard, and maintains a non-delay dequeue pointer that moves in physical order of the enqueued non-delay messages. The DBMS stages delayed messages in enqueue-time order within bucket shards of the delay shard. Each bucket shard, of a delay shard, represents a time span of delivery times, and messages are assigned thereto based on message delivery time. The delay dequeue pointer comprises a sub-routine to determine the message with the minimum delivery time within a current bucket shard with a time span that includes the current time. The DBMS delivers the next available message out of the delayed and non-delayed shards by comparing the delivery time of the next available message from each shard and delivering the earliest available message.

3. 发明授权

US09792349B2 In-database sharded queue 有权
公开(公告)号：US09792349B2
公开(公告)日：2017-10-17
申请号：US14095543
申请日：2013-12-03
申请人： Oracle International Corporation
发明人： Shubha Bose , Devendra Singh , Neerja Bhatt , Sujatha Janardhanan , Gaurav Garg , Yang Seok Ki , Abhishek Saxena , Alan Downing
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , G06F9/546 , G06F17/30575 , G06F17/30607
摘要： A method and apparatus for an in-database sharded queue that supports JMS session ordering is provided. Messages from a plurality of enqueuers are stored in a plurality of shards of a particular queue. For each enqueuer, all messages are stored in only one of the shards. Each shard includes one or more subshards, each subshard having one or more partitions of a queue table maintained by a relational database system. All messages from a first enqueuer are stored in partitions of the queue table that are assigned to a first shard of the plurality of shards. All messages from a second enqueuer are stored in partitions of the queue table that are assigned to a second shard of the plurality of shards. Subscribers of the particular queue are caused to dequeue messages from the plurality of shards.

4. 发明申请

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.
摘要翻译：描述处理数据库内的分片队列中的内存压力。来自多个入站者的消息被存储在分片队列的多个分片中。来自第一个进入者的消息存储在第一个分片中。维护与分片队列对应的队列表。在易失性存储器中，维护多个消息高速缓存，每个消息高速缓存对应于多个分片中的分片。基于易失性存储器的存储器使用来检测存储器压力。要从进入者存储特定消息，特定消息存储在分配给第一个分片的队列表的行中。当未检测到存储器压力时，特定消息存储在与第一分片对应的第一消息高速缓存中。导致分片队列的订阅者从多个分片中发出消息。

5. 发明申请

US20190179613A1 AVOIDING HOT SPOTS DURING INGEST WHERE INGEST ORDERING MUST BE PRESERVED 审中-公开
公开(公告)号：US20190179613A1
公开(公告)日：2019-06-13
申请号：US15841149
申请日：2017-12-13
申请人： Oracle International Corporation
发明人： James W. Stamos , Devendra Singh
IPC分类号： G06F5/06 , G06F17/30
摘要： Techniques are described herein for achieving physically dispersed item-dispersal patterns in queue tables that are used as circular buffers in a FIFO system. The techniques achieve the physically dispersed item-dispersal patterns while retaining FIFO semantics, efficient data ingest, efficient data access, and low latency for both fixed and variable-size ingest data. Because consecutively inserted rows are written to physically dispersed locations on persistent storage, lock contention between concurrent ingest sessions is significantly reduced. Once a physically dispersed item-dispersal pattern is established for a first set of inserted rows, subsequent rows are added by overwriting the existing rows. The physical dispersal of the initial rows may be accomplished by setting values in a slot number column such that updates that are made in a sequence that is based on the slot number column exhibit a desired physical dispersal pattern.

6. 发明申请

US20180060145A1 MESSAGE CACHE MANAGEMENT FOR MESSAGE QUEUES 有权
公开(公告)号：US20180060145A1
公开(公告)日：2018-03-01
申请号：US15254278
申请日：2016-09-01
申请人： Oracle International Corporation
发明人： Mukesh Jaiswal , Shubha Bose , James W. Stamos , Alan R. Downing , Devendra Singh
IPC分类号： G06F9/54 , G06F12/0875
CPC分类号： G06F9/546 , G06F12/0875 , G06F2209/548 , G06F2212/453
摘要： 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.

7. 发明授权

US09495296B2 Handling memory pressure in an in-database sharded queue 有权
标题翻译：处理数据库内的分片队列中的内存压力
公开(公告)号：US09495296B2
公开(公告)日：2016-11-15
申请号：US14165974
申请日：2014-01-28
申请人： Oracle International Corporation
发明人： Sunitha Subramanyam , Shubha Bose , Anil Madan , Devendra Singh , James W. Stamos , Mukesh Jaiswal
IPC分类号： G06F17/30 , 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.
摘要翻译：描述处理数据库内的分片队列中的内存压力。来自多个入站者的消息被存储在分片队列的多个分片中。来自第一个进入者的消息存储在第一个分片中。维护与分片队列对应的队列表。在易失性存储器中，维护多个消息高速缓存，每个消息高速缓存对应于多个分片中的分片。基于易失性存储器的存储器使用来检测存储器压力。要从进入者存储特定消息，特定消息存储在分配给第一个分片的队列表的行中。当未检测到存储器压力时，特定消息存储在与第一分片对应的第一消息高速缓存中。导致分片队列的订阅者从多个分片中发出消息。

8. 发明授权

US10678614B2 Messages with delayed delivery in an in-database sharded queue 有权
公开(公告)号：US10678614B2
公开(公告)日：2020-06-09
申请号：US15827839
申请日：2017-11-30
申请人： Oracle International Corporation
发明人： Devendra Singh , Mukesh Jaiswal , Shubha Bose , Abhilash Tomar
IPC分类号： G06F9/54 , G06F12/0868 , G06F16/22 , G06F16/27 , G06F16/2455
摘要： A DBMS maintains delayed and non-delayed messages within a non-delay shard and a delay shard that function as a pair. The DBMS stages non-delayed messages in enqueue-time order within the non-delay shard, and maintains a non-delay dequeue pointer that moves in physical order of the enqueued non-delay messages. The DBMS stages delayed messages in enqueue-time order within bucket shards of the delay shard. Each bucket shard, of a delay shard, represents a time span of delivery times, and messages are assigned thereto based on message delivery time. The delay dequeue pointer comprises a sub-routine to determine the message with the minimum delivery time within a current bucket shard with a time span that includes the current time. The DBMS delivers the next available message out of the delayed and non-delayed shards by comparing the delivery time of the next available message from each shard and delivering the earliest available message.

9. 发明授权

US09996404B2 Message cache management for message queues 有权
公开(公告)号：US09996404B2
公开(公告)日：2018-06-12
申请号：US15254278
申请日：2016-09-01
申请人： Oracle International Corporation
发明人： Mukesh Jaiswal , Shubha Bose , James W. Stamos , Alan R. Downing , Devendra Singh
IPC分类号： G06F3/00 , G06F9/44 , G06F9/48 , G06F13/00 , G06F9/54 , G06F12/0875
CPC分类号： G06F9/546 , G06F12/0875 , G06F2209/548 , G06F2212/453
摘要： 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.

10. 发明申请

US20140372486A1 In-Database Sharded Queue 有权
标题翻译：数据库内分片队列
公开(公告)号：US20140372486A1
公开(公告)日：2014-12-18
申请号：US14095543
申请日：2013-12-03
申请人： Oracle International Corporation
发明人： Shubha Bose , Devendra Singh , Neerja Bhatt , Sujatha Janardhanan , Gaurav Garg , Yang Seok Ki , Abhishek Saxena , Alan Downing
IPC分类号： G06F17/30
CPC分类号： G06F17/30595 , G06F9/546 , G06F17/30575 , G06F17/30607
摘要： A method and apparatus for an in-database sharded queue that supports JMS session ordering is provided. Messages from a plurality of enqueuers are stored in a plurality of shards of a particular queue. For each enqueuer, all messages are stored in only one of the shards. Each shard includes one or more subshards, each subshard having one or more partitions of a queue table maintained by a relational database system. All messages from a first enqueuer are stored in partitions of the queue table that are assigned to a first shard of the plurality of shards. All messages from a second enqueuer are stored in partitions of the queue table that are assigned to a second shard of the plurality of shards. Subscribers of the particular queue are caused to dequeue messages from the plurality of shards.
摘要翻译：提供了一种支持JMS会话排序的数据库内分片队列的方法和装置。来自多个入站者的消息被存储在特定队列的多个分片中。对于每个进入者，所有消息都只存储在其中一个分片中。每个分片包括一个或多个子硬件，每个子硬件具有由关系数据库系统维护的队列表的一个或多个分区。来自第一入站者的所有消息都存储在分配给多个分片的第一分片的队列表的分区中。来自第二进入者的所有消息都存储在分配给多个分片的第二分片的队列表的分区中。导致特定队列的订阅者从多个分片中出现消息。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式