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

1. 发明授权

US08762322B2 Distributed order orchestration system with extensible flex field support 有权
标题翻译：分布式订单编排系统，具有可扩展的弹性支持
公开(公告)号：US08762322B2
公开(公告)日：2014-06-24
申请号：US13477591
申请日：2012-05-22
申请人： Sarita Sridharan , Venkatesh Malapati , Srinivasan Vasudevan , Maitrayee Bhoumik , Lalitha Kavuri , Nikhilkumar Parikh , Alok Singh , Sumeet Rijhsinghani , Balaji Parthasarathy Iyengar , Sasi Kala Erla , Raveesh Yadav , Krishna Raju Addala , Sunita Datti , Nagaveena Raju , Gary Hallmark
发明人： Sarita Sridharan , Venkatesh Malapati , Srinivasan Vasudevan , Maitrayee Bhoumik , Lalitha Kavuri , Nikhilkumar Parikh , Alok Singh , Sumeet Rijhsinghani , Balaji Parthasarathy Iyengar , Sasi Kala Erla , Raveesh Yadav , Krishna Raju Addala , Sunita Datti , Nagaveena Raju , Gary Hallmark
IPC分类号： G06F17/00 , G06N7/00 , G06N7/08
CPC分类号： G06Q10/10
摘要： A distributed order orchestration system publishes one or more newly generated artifacts that are generated as a result of generating one or more extensible flex fields to a rule dictionary. The distributed order orchestration system then imports the one or more newly generated artifacts within the rule dictionary as one or more facts. The distributed order orchestration system then creates one or more rules for the rule dictionary that references the one or more facts.
摘要翻译：分布式订单编排系统发布由生成一个或多个可扩展的柔性字段到规则字典的结果生成的一个或多个新生成的工件。然后，分布式订单编排系统将规则字典中的一个或多个新生成的工件导入为一个或多个事实。分布式订单编排系统然后为引用一个或多个事实的规则字典创建一个或多个规则。

2. 发明授权

US5956704A Method and apparatus for parallelizing operations that insert data into an existing data container 失效
标题翻译：用于并行化将数据插入现有数据容器的操作的方法和装置
公开(公告)号：US5956704A
公开(公告)日：1999-09-21
申请号：US870147
申请日：1997-06-05
申请人： Jyotin Gautam , William H. Waddington , Leng Leng Tan , Gary Hallmark , Jonathan Klein , Allen Brumm
发明人： Jyotin Gautam , William H. Waddington , Leng Leng Tan , Gary Hallmark , Jonathan Klein , Allen Brumm
IPC分类号： G06F17/30
CPC分类号： G06F17/30377 , Y10S707/99931 , Y10S707/99938
摘要： A method and apparatus for parallelizing operations that change a database is provided. A coordinator process receives a statement that requires data to be written into the database. In response to the statement, the coordinator process assigns granules of work to multiple processes. Each of the multiple processes executes the granule of work by writing to the database a distinct portion of the set of data that is to be added to the database. The various portions of data are then merged to update the set of data to be added to the database.
摘要翻译：提供了一种用于并行化改变数据库的操作的方法和装置。协调器进程接收需要将数据写入数据库的语句。响应该声明，协调程序将工作颗粒分配给多个进程。多个进程中的每一个通过向数据库写入要添加到数据库的数据集的不同部分来执行工作颗粒。然后将各种数据部分合并，以更新要添加到数据库的数据集。

3. 发明授权

US5857180A Method and apparatus for implementing parallel operations in a database management system 失效
标题翻译：在数据库管理系统中实现并行操作的方法和装置
公开(公告)号：US5857180A
公开(公告)日：1999-01-05
申请号：US898080
申请日：1997-07-21
申请人： Gary Hallmark , Daniel Leary
发明人： Gary Hallmark , Daniel Leary
IPC分类号： G06F9/46 , G06F17/30
CPC分类号： G06F9/466 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： The present invention implements parallel processing in a Database Management System. The present invention provides the ability to locate transaction and recovery information at one location and eliminates the need for read locks and two-phased commits. The present invention provides the ability to dynamically partition row sources for parallel processing. Parallelism is based on the ability to parallelize a row source, the partitioning requirements of consecutive row sources and the entire row source tree, and any specification in the SQL statement. A Query Coordinator assumes control of the processing of a entire query and can execute serial row sources. Additional threads of control, Query Server, execute a parallel operators. Parallel operators are called data flow operators (DFOs). A DFO is represented as structured query language (SQL) statements and can be executed concurrently by multiple processes, or query slaves. A central scheduling mechanism, a data flow scheduler, controls a parallelized portion of an execution plan, and can become invisible for serial execution. Table queues are used to partition and transport rows between sets of processes. Node linkages provide the ability to divide the plan into independent lists that can each be executed by a set of query slaves. The present invention maintains a bit vector that is used by a subsequent producer to determine whether any rows need to be produced to its consumers. The present uses states and a count of the slaves that have reached these states to perform its scheduling tasks.
摘要翻译：本发明在数据库管理系统中实现并行处理。本发明提供了在一个位置定位事务和恢复信息的能力，并且消除了对读锁定和两阶段提交的需要。本发明提供了动态分割用于并行处理的行源的能力。并行性基于并行化源的能力，连续行源和整行行树的分区要求以及SQL语句中的任何规范。查询协调器假定对整个查询的处理进行控制，并且可以执行串行源。控制的附加线程，Query Server，执行一个并行运算符。并行运算符称为数据流操作符（DFO）。 DFO表示为结构化查询语言（SQL）语句，可以由多个进程或查询从属并发执行。中央调度机制，数据流调度器，控制执行计划的并行化部分，并且可以变得不可见用于串行执行。表队列用于在进程集之间分区和传输行。节点链接提供将计划划分为独立列表的能力，每个列表可以由一组查询从属单元执行。本发明保持由后续生产者使用的位向量，以确定是否需要向其消费者生产任何行。目前使用状态和已经到达这些状态的从站的计数来执行其调度任务。

4. 再颁专利

USRE42664E1 Method and apparatus for implementing parallel operations in a database management system 有权
标题翻译：在数据库管理系统中实现并行操作的方法和装置
公开(公告)号：USRE42664E1
公开(公告)日：2011-08-30
申请号：US09757399
申请日：2001-01-05
申请人： Gary Hallmark , Daniel Leary
发明人： Gary Hallmark , Daniel Leary
IPC分类号： G06F17/00 , G06F15/16
CPC分类号： G06F9/466 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： The present invention implements parallel processing in a Database Management System. The present invention provides the ability to locate transaction and recovery information at one location and eliminates the need for read locks and two-phased commits. The present invention provides the ability to dynamically partition row sources for parallel processing. Parallelism is based on the ability to parallelize a row source, the partitioning requirements of consecutive row sources and the entire row source tree, and any specification in the SQL statement. A Query Coordinator assumes control of the processing of a entire query and can execute serial row sources. Additional threads of control, Query Server, execute a parallel operators. Parallel operators are called data flow operators (DFOs). A DFO is represented as structured query language (SQL) statements and can be executed concurrently by multiple processes, or query slaves. A central scheduling mechanism, a data flow scheduler, controls a parallelized portion of an execution plan, and can become invisible for serial execution. Table queues are used to partition and transport rows between sets of processes. Node linkages provide the ability to divide the plan into independent lists that can each be executed by a set of query slaves. The present invention maintains a bit vector that is used by a subsequent producer to determine whether any rows need to be produced to its consumers. The present uses states and a count of the slaves that have reached these states to perform its scheduling tasks.
摘要翻译：本发明在数据库管理系统中实现并行处理。本发明提供了在一个位置定位事务和恢复信息的能力，并且消除了对读锁定和两阶段提交的需要。本发明提供了动态分割用于并行处理的行源的能力。并行性基于并行化源的能力，连续行源和整行行树的分区要求以及SQL语句中的任何规范。查询协调器假定对整个查询的处理进行控制，并且可以执行串行源。控制的附加线程，Query Server，执行一个并行运算符。并行运算符称为数据流操作符（DFO）。 DFO表示为结构化查询语言（SQL）语句，可以由多个进程或查询从属并发执行。中央调度机制，数据流调度器，控制执行计划的并行化部分，并且可以变得不可见用于串行执行。表队列用于在进程集之间分区和传输行。节点链接提供将计划划分为独立列表的能力，每个列表可以由一组查询从属单元执行。本发明保持由后续生产者使用的位向量，以确定是否需要向其消费者生产任何行。目前使用状态和已经到达这些状态的从站的计数来执行其调度任务。

5. 发明授权

US06574750B1 Preserving consistency of passively-replicated non-deterministic objects 有权
标题翻译：保持被动复制非确定性对象的一致性
公开(公告)号：US06574750B1
公开(公告)日：2003-06-03
申请号：US09478946
申请日：2000-01-06
申请人： Pascal Felber , Gary Hallmark
发明人： Pascal Felber , Gary Hallmark
IPC分类号： G06F1100
CPC分类号： G06F11/1474 , G06F11/202 , G06F11/2097 , Y10S707/99953
摘要： Techniques are provided for executing an operation in which a client invokes a replicated object. According to one technique, a primary replica of a replicated object receives a first request from a client, wherein the first request includes a request identifier. Rather than immediately attempting to process the request, the primary replica determines whether a record exists that corresponds to the request identifier. If a record exists that corresponds to the request identifier, then the primary replica responds to the first request with a reply associated with the record. If no record exists that corresponds to the request identifier, then the primary replica performs the steps of: starting a transaction; as part of the transaction, processing the request; as part of the transaction, storing a record associated with the request identifier and a reply to the request; committing the transaction; and delivering the reply to the client. The client may itself be a replicated object. If the client is nondeterministic, then the transaction initiated by the primary replica may be a nested transaction relative to a transaction executed by the client, or be executed as part of the same transaction as the client. If the transaction executed by the primary replica is executed as part of the same transaction as the client, then a savepoint may be established before the primary replica processes the request, so that a failure will not necessarily require all processing performed by the client to be rolled back.
摘要翻译：提供了用于执行客户端调用复制对象的操作的技术。根据一种技术，复制对象的主要副本从客户端接收第一请求，其中第一请求包括请求标识符。主副本不是立即尝试处理请求，而是确定是否存在与请求标识符相对应的记录。如果存在与请求标识符相对应的记录，则主副本使用与记录相关联的回复来响应第一请求。如果没有与请求标识符相对应的记录，则主副本执行以下步骤：启动事务; 作为交易的一部分，处理请求; 作为交易的一部分，存储与请求标识符相关联的记录和对请求的回复; 交易交易; 并将答复交给客户。客户端本身可能是一个复制对象。如果客户端是非确定性的，则由主副本发起的事务可能是相对于由客户端执行的事务的嵌套事务，或者作为与客户端相同事务的一部分执行。如果主副本执行的事务作为与客户端相同的事务的一部分执行，则可以在主副本处理该请求之前建立保存点，从而不一定要求客户端执行的所有处理回滚。

6. 发明申请

US20130318029A1 DISTRIBUTED ORDER ORCHESTRATION SYSTEM WITH EXTENSIBLE FLEX FIELD SUPPORT 有权
标题翻译：具有可扩展的FLEX现场支持的分布式订单管理系统
公开(公告)号：US20130318029A1
公开(公告)日：2013-11-28
申请号：US13477591
申请日：2012-05-22
申请人： Sarita SRIDHARAN , Venkatesh MALAPATI , Srinivasan VASUDEVAN , Maitrayee BHOUMIK , Lalitha KAVURI , Nikhilkumar PARIKH , Alok SINGH , Sumeet RIJHSINGHANI , Balaji Parthasarathy IYENGAR , Sasi Kala ERLA , Raveesh YADAV , Krishna Raju ADDALA , Sunita DATTI , Nagaveena RAJU , Gary HALLMARK
发明人： Sarita SRIDHARAN , Venkatesh MALAPATI , Srinivasan VASUDEVAN , Maitrayee BHOUMIK , Lalitha KAVURI , Nikhilkumar PARIKH , Alok SINGH , Sumeet RIJHSINGHANI , Balaji Parthasarathy IYENGAR , Sasi Kala ERLA , Raveesh YADAV , Krishna Raju ADDALA , Sunita DATTI , Nagaveena RAJU , Gary HALLMARK
IPC分类号： G06N5/02
CPC分类号： G06Q10/10
摘要： A distributed order orchestration system publishes one or more newly generated artifacts that are generated as a result of generating one or more extensible flex fields to a rule dictionary. The distributed order orchestration system then imports the one or more newly generated artifacts within the rule dictionary as one or more facts. The distributed order orchestration system then creates one or more rules for the rule dictionary that references the one or more facts.
摘要翻译：分布式订单编排系统发布由生成一个或多个可扩展的柔性字段到规则字典的结果生成的一个或多个新生成的工件。然后，分布式订单编排系统将规则字典中的一个或多个新生成的工件导入为一个或多个事实。分布式订单编排系统然后为引用一个或多个事实的规则字典创建一个或多个规则。

7. 发明授权

US6014656A Using overlapping partitions of data for query optimization 失效
标题翻译：使用重叠的数据分区进行查询优化
公开(公告)号：US6014656A
公开(公告)日：2000-01-11
申请号：US673714
申请日：1996-06-21
申请人： Gary Hallmark , Robert J. Jenkins
发明人： Gary Hallmark , Robert J. Jenkins
IPC分类号： G06F17/30
CPC分类号： G06F17/30486 , G06F17/30492 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99938
摘要： A method and apparatus for executing queries on a set of data that has been partitioned into a plurality of partitions based on a partitioning key is provided. A query is received that includes a reference to a second key. The second key is not part of the partitioning key but has a predetermined correlation with the partitioning key. This second key is referred to as an overlapping partition key. A subset of the plurality of partitions is selected to be scanned based on the reference to the second key and the predetermined correlation with the partitioning key. The query is then executed by scanning only those partitions of the plurality of partitions that belong to the subset of partitions. The overlapping partition key provides for reduced query execution time even when the partitioning key is not directly involved in the query. Specifically, the overlapping partition key permits a partial table scan in situations that would require a fill table scan with partitioning alone.
摘要翻译：提供了一种用于基于划分键对已经被分割成多个分区的一组数据执行查询的方法和装置。接收到包含对第二个键的引用的查询。第二个键不是分区键的一部分，而是与分区键具有预定的相关性。该第二个键被称为重叠的分区键。基于对第二密钥的引用和与分区密钥的预定相关性，选择多个分区的子集进行扫描。然后通过仅扫描属于分区子集的多个分区的那些分区来执行查询。即使分区键不直接涉及查询，重叠的分区键也可减少查询执行时间。具体来说，重叠分区键允许在需要单独分区的填充表扫描的情况下进行部分表扫描。

8. 发明授权

US5892945A Method and apparatus for distributing work granules among processes based on the location of data accessed in the work granules 失效
公开(公告)号：US5892945A
公开(公告)日：1999-04-06
申请号：US620002
申请日：1996-03-21
申请人： Ravi Prem Mirchandaney , Gary Hallmark
发明人： Ravi Prem Mirchandaney , Gary Hallmark
IPC分类号： G06F9/50 , G06F9/00
CPC分类号： G06F9/5027
摘要： A method and apparatus for distributing work granules of a parent task among processes running on various nodes in a multi-processing computer system is provided. The parent task is divided into work granules of varying sizes based on the location of the data that must be accessed to perform the work granules. At least one process on each of the nodes that will be assisting in the execution of the parent task is initially assigned a work granule based on efficiency considerations. Such efficiency considerations may include, for example, the location of the data to be accessed relative to the process, the current I/O load of the devices on which data to be accessed is stored, and the relative sizes of the various work granules. When a process completes the work granule assigned to it, the process is assigned one of the remaining unassigned work granules. Again the work granule assignment is made based on efficiency considerations. This process continues until all of the work granules have been completed.

9. 发明授权

US5802528A Method and apparatus for data comparisons 失效
标题翻译：用于数据比较的方法和装置
公开(公告)号：US5802528A
公开(公告)日：1998-09-01
申请号：US655321
申请日：1996-05-24
申请人： Brian M. Oki , James Stamos , Gary Hallmark
发明人： Brian M. Oki , James Stamos , Gary Hallmark
IPC分类号： G06F17/30
CPC分类号： G06F17/30575 , Y10S707/99932 , Y10S707/99933 , Y10S707/99952
摘要： A method and apparatus for comparing a first set of data and a second set of data are disclosed. A subset of base data is compared to a subset of replicated data to determine discrepancies. These discrepancies are then used to modify the replicated set of data, and the replicated set of data thus becomes identical to the base set of data. Alternately, the base data is compared directly to the replicated data and differences between the base data and the replicated data are obtained. These differences are then used to modify the replicated data to become identical to the base data.
摘要翻译：公开了一种用于比较第一组数据和第二组数据的方法和装置。将基础数据的子集与复制数据的子集进行比较以确定差异。然后使用这些差异来修改复制的数据集，并且复制的数据集合因此变得与基本数据集相同。或者，将基本数据直接与复制数据进行比较，并获得基本数据和复制数据之间的差异。然后使用这些差异来修改复制数据，使其与基本数据相同。

10. 发明授权

US06505227B1 Method and apparatus for distributing work granules among processes based on the location of data accessed in the work granules 有权
标题翻译：基于在工作颗粒中访问的数据的位置，在工艺中分配工作颗粒的方法和装置
公开(公告)号：US06505227B1
公开(公告)日：2003-01-07
申请号：US09238670
申请日：1999-01-26
申请人： Ravi Prem Mirchandaney , Gary Hallmark
发明人： Ravi Prem Mirchandaney , Gary Hallmark
IPC分类号： G06F900
CPC分类号： G06F9/5027
摘要： A method and apparatus for distributing work granules of a parent task among processes running on various nodes in a multi-processing computer system is provided. The parent task is divided into work granules of varying sizes based on the location of the data that must be accessed to perform the work granules. At least one process on each of the nodes that will be assisting in the execution of the parent task is initially assigned a work granule based on efficiency considerations. Such efficiency considerations may include, for example, the location of the data to be accessed relative to the process, the current I/O load of the devices on which data to be accessed is stored, and the relative sizes of the various work granules. When a process completes the work granule assigned to it, the process is assigned one of the remaining unassigned work granules. Again the work granule assignment is made based on efficiency considerations. This process continues until all of the work granules have been completed.
摘要翻译：提供了一种用于在多处理计算机系统中的各种节点上运行的进程中分派父任务的工作颗粒的方法和装置。基于必须访问的数据的位置来执行工作颗粒，父任务被划分成不同大小的工作颗粒。在协助执行父任务的每个节点上的至少一个进程最初基于效率考虑分配工作颗粒。这样的效率考虑可以包括例如要访问的数据相对于过程的位置，存储要访问的数据的设备的当前I / O负载以及各种工作颗粒的相对大小。当一个过程完成分配给它的工作颗粒时，该过程被分配剩余的未分配的工作颗粒之一。再次，工作颗粒分配是基于效率考虑。该过程一直持续到所有的工作颗粒已经完成。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式