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

1. 发明申请

US20090064147A1 TRANSACTION AGGREGATION TO INCREASE TRANSACTION PROCESSING THROUGHOUT 失效
标题翻译：交易累积以增加交易处理
公开(公告)号：US20090064147A1
公开(公告)日：2009-03-05
申请号：US11848115
申请日：2007-08-30
申请人： Michael James BECKERLE , Michael John CARNEY
发明人： Michael James BECKERLE , Michael John CARNEY
IPC分类号： G06F9/46
CPC分类号： G06F9/466 , G06F9/5038 , G06F2209/5017 , G06F2209/506
摘要： Provided are techniques for increasing transaction processing throughput. A transaction item with a message identifier and a session identifier is obtained. The transaction item is added to an earliest aggregated transaction in a list of aggregated transactions in which no other transaction item as the same session identifier. A first aggregated transaction in the list of aggregated transactions that has met execution criteria is executed. In response to determining that the aggregated transaction is not committing, the aggregated transaction is broken up into multiple smaller aggregated transactions and a target size of each aggregated transaction is adjusted based on measurements of system throughput.
摘要翻译：提供了用于增加事务处理吞吐量的技术。获得具有消息标识符和会话标识符的事务项目。交易项目被添加到聚合事务列表中的最早的聚合事务，其中没有其他事务项目作为相同的会话标识符。执行符合执行标准的聚合事务列表中的第一个聚合事务。响应于确定聚合事务不提交，聚合事务被分解成多个较小的聚合事务，并且基于系统吞吐量的测量来调整每个聚合事务的目标大小。

2. 发明申请

US20090327870A1 PIPELINE OPTIMIZATION BASED ON POLYMORPHIC SCHEMA KNOWLEDGE 失效
标题翻译：基于多边形方法知识的管道优化
公开(公告)号：US20090327870A1
公开(公告)日：2009-12-31
申请号：US12147408
申请日：2008-06-26
申请人： Amir BAR-OR , Michael James BECKERLE
发明人： Amir BAR-OR , Michael James BECKERLE
IPC分类号： G06F17/00
CPC分类号： G06F17/227 , G06F17/2247
摘要： Provided are techniques for pipeline optimization based on polymorphic schema knowledge. A hierarchical document to be processed by a pipeline of transformations is received. It is determined whether a next downstream transformation accesses content of each schema node in an associated input schema, wherein the input schema is a polymorphic schema. In response to determining that the next downstream transformation is not accessing the content of each schema node in the associated input schema, data items corresponding to each schema node that the next downstream transformation is not accessing are collected into a single compressed event. The collected items are passed to the next downstream transformation as the single compressed event.
摘要翻译：提供了基于多态模式知识的管道优化技术。接收要由转换流水线处理的分层文档。确定下一个下游变换是否访问相关联的输入模式中的每个模式节点的内容，其中输入模式是多态模式。响应于确定下一个下游转换未访问相关联的输入模式中的每个模式节点的内容，对应于下一个下游转换未访问的每个模式节点的数据项被收集到单个压缩事件中。收集的项目作为单个压缩事件传递到下一个下游转换。

3. 发明授权

US07941460B2 Compilation model for processing hierarchical data in stream systems 失效
标题翻译：用于处理流系统中分层数据的编译模型
公开(公告)号：US07941460B2
公开(公告)日：2011-05-10
申请号：US11850589
申请日：2007-09-05
申请人： Amir Bar-Or , Michael James Beckerle
发明人： Amir Bar-Or , Michael James Beckerle
IPC分类号： G06F7/00
CPC分类号： G06F8/44
摘要： Provided are techniques for compilation of hierarchical data processing. A data flow diagram including one or more operators, wherein each operator includes at least one of an incoming arc and an outgoing arc, is received. For each operator, for each incoming arc, it is validated that an arc input formal schema is compatible with a schema rooted in a context node in an arc input actual schema, and, for each outgoing arc, an arc output formal schema is computed based on operator logic and operator inputs and an arc output actual schema is computed from the arc input actual schema by replacing the context node of the arc input actual schema with the arc output formal schema.
摘要翻译：提供了用于编译分级数据处理的技术。包括一个或多个运算符的数据流图，其中每个运算符包括进入的弧和输出的弧中的至少一个。对于每个运算符，对于每个输入弧，验证了弧输入形式模式与在弧输入实际模式中的上下文节点中存在的模式兼容，并且对于每个输出弧，基于计算的弧输出形式模式通过用弧输出正式模式替换弧输入实际模式的上下文节点，从弧输入实际模式计算运算符逻辑和运算符输入，并且弧输出实际模式。

4. 发明授权

US07774189B2 System and method for simulating data flow using dataflow computing system 有权
标题翻译：使用数据流计算系统模拟数据流的系统和方法
公开(公告)号：US07774189B2
公开(公告)日：2010-08-10
申请号：US11566193
申请日：2006-12-01
申请人： Amir Bar-Or , Michael James Beckerle
发明人： Amir Bar-Or , Michael James Beckerle
IPC分类号： G06F9/44 , G06F9/45 , G06F15/00
CPC分类号： G06F8/34 , G06F8/433
摘要： A system and method for implementing a unified model for integration systems is presented. A user provides inputs to an integrated language engine for placing operator components and arc components onto a dataflow diagram. Operator components include data ports for expressing data flow, and also include meta-ports for expressing control flow. Arc components connect operator components together for data and control information to flow between the operator components. The dataflow diagram is a directed acyclic graph that expresses an application without including artificial boundaries during the application design process. Once the integrated language engine generates the dataflow diagram, the integrated language engine compiles the dataflow diagram to generated application code.
摘要翻译：介绍了一种实现集成系统统一模型的系统和方法。用户向集成语言引擎提供输入，以将操作员组件和弧组件放置在数据流图上。运营商组件包括用于表达数据流的数据端口，还包括表示控制流的元端口。 Arc组件将操作员组件连接在一起，以便数据和控制信息在操作员组件之间流动。数据流图是在应用程序设计过程中表示应用程序而不包括人工边界的有向非循环图。一旦集成语言引擎生成数据流图，集成语言引擎会将数据流图编译成生成的应用程序代码。

5. 发明申请

US20090063583A1 COMPILATION MODEL FOR PROCESSING HIERARCHICAL DATA IN STREAM SYSTEMS 失效
标题翻译：用于处理流域系统中分层数据的编译模型
公开(公告)号：US20090063583A1
公开(公告)日：2009-03-05
申请号：US11850589
申请日：2007-09-05
申请人： Amir BAR-OR , Michael James BECKERLE
发明人： Amir BAR-OR , Michael James BECKERLE
IPC分类号： G06F12/00
CPC分类号： G06F8/44
摘要： Provided are techniques for compilation of hierarchical data processing. A data flow diagram including one or more operators, wherein each operator includes at least one of an incoming arc and an outgoing arc, is received. For each operator, for each incoming arc, it is validated that an arc input formal schema is compatible with a schema rooted in a context node in an arc input actual schema, and, for each outgoing arc, an arc output formal schema is computed based on operator logic and operator inputs and an arc output actual schema is computed from the arc input actual schema by replacing the context node of the arc input actual schema with the arc output formal schema.
摘要翻译：提供了用于编译分级数据处理的技术。包括一个或多个运算符的数据流图，其中每个运算符包括进入的弧和输出的弧中的至少一个。对于每个运算符，对于每个输入弧，验证了弧输入形式模式与在弧输入实际模式中的上下文节点中存在的模式兼容，并且对于每个输出弧，基于计算的弧输出形式模式通过用弧输出正式模式替换弧输入实际模式的上下文节点，从弧输入实际模式计算运算符逻辑和运算符输入，并且弧输出实际模式。

6. 发明授权

US08904393B2 Transaction aggregation to increase transaction processing throughput 有权
标题翻译：事务聚合增加事务处理吞吐量
公开(公告)号：US08904393B2
公开(公告)日：2014-12-02
申请号：US13610668
申请日：2012-09-11
申请人： Michael James Beckerle , Michael John Carney
发明人： Michael James Beckerle , Michael John Carney
IPC分类号： G06F9/46 , G06F9/50
CPC分类号： G06F9/466 , G06F9/5038 , G06F2209/5017 , G06F2209/506
摘要： Provided are techniques for increasing transaction processing throughput. A transaction item with a message identifier and a session identifier is obtained. The transaction item is added to an earliest aggregated transaction in a list of aggregated transactions in which no other transaction item as the same session identifier. A first aggregated transaction in the list of aggregated transactions that has met execution criteria is executed. In response to determining that the aggregated transaction is not committing, the aggregated transaction is broken up into multiple smaller aggregated transactions and a target size of each aggregated transaction is adjusted based on measurements of system throughput.
摘要翻译：提供了用于增加事务处理吞吐量的技术。获得具有消息标识符和会话标识符的事务项目。交易项目被添加到聚合事务列表中的最早的聚合事务，其中没有其他事务项目作为相同的会话标识符。执行符合执行标准的聚合事务列表中的第一个聚合事务。响应于确定聚合事务不提交，聚合事务被分解成多个较小的聚合事务，并且基于系统吞吐量的测量来调整每个聚合事务的目标大小。

7. 发明授权

US07860863B2 Optimization model for processing hierarchical data in stream systems 有权
标题翻译：在流系统中处理分层数据的优化模型
公开(公告)号：US07860863B2
公开(公告)日：2010-12-28
申请号：US11850588
申请日：2007-09-05
申请人： Amir Bar-Or , Michael James Beckerle
发明人： Amir Bar-Or , Michael James Beckerle
IPC分类号： G06F7/00
CPC分类号： G06F8/433
摘要： Provided are techniques for optimizing the processing of hierarchical data. A linear processing graph is received, wherein the linear processing graph includes a plurality of operators, wherein each operator in the plurality is connected to at least one other operator by an arc, wherein hierarchical data flows on arcs, wherein the operators read and replace identified subregions within the hierarchical data flowing into the operators on the arcs, and wherein the operators do not modify the hierarchical data outside of these identified subregions. For each operator in the linear processing graph, a minimal set of dependent upstream operators on which that operator depends is found by examining how the identified subregions are created in the linear processing graph through obtaining a set of operators on which that operator depends, by analyzing dependencies carried by a set of vector nodes of the hierarchical data in an input schema of the operator, and, for each of the vector nodes, by analyzing an associated set of scalar nodes, wherein finding the minimum set of operators includes taking into consideration data preservation characteristics of the plurality of operators and taking into consideration structural-order preservation characteristics of the plurality of operators. The linear processing graph is rewritten to create a new graph that expresses dependencies based on the minimal set of dependent upstream operators for each operator.
摘要翻译：提供了用于优化分层数据的处理的技术。接收线性处理图，其中线性处理图包括多个运算符，其中多个运算符中的每个运算符通过弧连接到至少一个其他运算符，其中分层数据在弧上流动，其中运算符读取并替换识别出的分层数据中的子区域流入弧中的运算符，并且其中运算符不修改在这些确定的子区域之外的分层数据。对于线性处理图中的每个运算符，通过检查在线性处理图中如何创建识别的子区域，找到操作符所依赖的最小的依赖上游运算符集，通过分析获得运算符所依赖的一组运算符由运算符的输入模式中的分层数据的一组矢量节点携带的依赖关系，以及通过分析相关联的一组标量节点，对于每个向量节点，其中找到最小的运算符组包括考虑数据并考虑到多个操作者的结构顺序保存特性。线性处理图被重写以创建一个基于每个运算符的依赖上游运算符的最小集合来表示依赖关系的新图。

8. 发明授权

US07565349B2 Method for computing frequency distribution for many fields in one pass in parallel 失效
标题翻译：并行计算一次通过多个场的频率分布的方法
公开(公告)号：US07565349B2
公开(公告)日：2009-07-21
申请号：US11271047
申请日：2005-11-10
申请人： Michael James Beckerle , Jerry Lee Callen
发明人： Michael James Beckerle , Jerry Lee Callen
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30575 , Y10S707/99937
摘要： Provided are a techniques for determining a frequency distribution for a set of records. A count table of frequency distributions is built in memory for each field in the set of records, wherein each record of each count table includes a field identifier, a field value, and a count of a number of times the field value occurs in the set of records, and wherein the field identifier concatenated with the field value comprises a composite key value. It is determined that at least one count table of frequency distributions is approaching a maximum amount of memory allocated to that count table. The records of the at least one count table that is approaching the maximum amount of memory are sent for sorting and additional counting, wherein the records include composite key values.
摘要翻译：提供了一种用于确定一组记录的频率分布的技术。频率分布的计数表内置在记录集合中的每个场的存储器中，其中每个计数表的每个记录包括字段标识符，字段值和字段值在集合中发生的次数的计数的记录，并且其中与字段值连接的字段标识符包括复合键值。确定频率分布的至少一个计数表接近分配给该计数表的最大存储量。发送接近最大存储量的至少一个计数表的记录用于排序和附加计数，其中记录包括复合密钥值。

9. 发明申请

US20090064157A1 ASYNCHRONOUS DATA STRUCTURE PULL APPLICATION PROGRAMMING INTERFACE (API) FOR STREAM SYSTEMS 失效
标题翻译：异步数据结构应用编程接口（API）用于流系统
公开(公告)号：US20090064157A1
公开(公告)日：2009-03-05
申请号：US11848098
申请日：2007-08-30
申请人： Amir BAR-OR , Michael James BECKERLE
发明人： Amir BAR-OR , Michael James BECKERLE
IPC分类号： G06F9/50
CPC分类号： G06F9/4881
摘要： Provided are techniques for processing data items. A limit on the number of dequeue operations allowed in a current step of processing for a queue-like data structure is set, wherein the number of allowed dequeue operations limit at least one of an amount of CPU resources and an amount of memory resources to be used by an operator. The operator to perform processing is selected and the operator is activated by passing control to the operator, which then dequeues data constrained by the limits set. In response to receiving control back from the operator, the data structure size is examined to determine whether the operator made forward progress in that the operator enqueued or dequeued at least one data item.
摘要翻译：提供了用于处理数据项的技术。设置当前对队列状数据结构进行处理的允许出队次数的限制，其中允许出队次数的操作将CPU资源量和存储器资源量中的至少一个限制为由运营商使用选择执行处理的操作者，并且通过将控制传递给操作者来激活操作者，然后操作者将限制的数据排队。响应于从操作员接收到控制，检查数据结构大小以确定操作者是否已经取得进展，因为操作员将至少一个数据项排队或出队。

10. 发明申请

US20090063515A1 OPTIMIZATION MODEL FOR PROCESSING HIERARCHICAL DATA IN STREAM SYSTEMS 有权
标题翻译：用于处理流域系统中分层数据的优化模型
公开(公告)号：US20090063515A1
公开(公告)日：2009-03-05
申请号：US11850588
申请日：2007-09-05
申请人： Amir BAR-OR , Michael James BECKERLE
发明人： Amir BAR-OR , Michael James BECKERLE
IPC分类号： G06F7/00
CPC分类号： G06F8/433
摘要： Provided are techniques for optimizing the processing of hierarchical data. A linear processing graph is received, wherein the linear processing graph includes a plurality of operators, wherein each operator in the plurality is connected to at least one other operator by an arc, wherein hierarchical data flows on arcs, wherein the operators read and replace identified subregions within the hierarchical data flowing into the operators on the arcs, and wherein the operators do not modify the hierarchical data outside of these identified subregions. For each operator in the linear processing graph, a minimal set of dependent upstream operators on which that operator depends is found by examining how the identified subregions are created in the linear processing graph through obtaining a set of operators on which that operator depends, by analyzing dependencies carried by a set of vector nodes of the hierarchical data in an input schema of the operator, and, for each of the vector nodes, by analyzing an associated set of scalar nodes, wherein finding the minimum set of operators includes taking into consideration data preservation characteristics of the plurality of operators and taking into consideration structural-order preservation characteristics of the plurality of operators. The linear processing graph is rewritten to create a new graph that expresses dependencies based on the minimal set of dependent upstream operators for each operator.
摘要翻译：提供了用于优化分层数据的处理的技术。接收线性处理图，其中线性处理图包括多个运算符，其中多个运算符中的每个运算符通过弧连接到至少一个其他运算符，其中分层数据在弧上流动，其中运算符读取并替换识别出的分层数据中的子区域流入弧中的运算符，并且其中运算符不修改在这些确定的子区域之外的分层数据。对于线性处理图中的每个运算符，通过检查在线性处理图中如何创建识别的子区域，找到操作符所依赖的最小的依赖上游运算符集，通过分析获得运算符所依赖的一组运算符由运算符的输入模式中的分层数据的一组矢量节点携带的依赖关系，以及通过分析相关联的一组标量节点，对于每个向量节点，其中找到最小的运算符组包括考虑数据并考虑到多个操作者的结构顺序保存特性。线性处理图被重写以创建一个基于每个运算符的依赖上游运算符的最小集合来表示依赖关系的新图。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式