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

1. 发明申请

US20140279945A1 MATCHING TRANSACTIONS IN MULTI-LEVEL RECORDS 有权
标题翻译：多级记录中的匹配交易
公开(公告)号：US20140279945A1
公开(公告)日：2014-09-18
申请号：US14293385
申请日：2014-06-02
申请人： International Business Machines Corporation
发明人： Manoj K. Agarwal , Curt L. Cotner , Amitava Kundu , Prasan Roy , Rajesh Sambandhan
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , G06F17/30008 , G06F17/303
摘要： Identifying matching transactions. First and second log files contain operation records of transactions in a transaction workload, each file recording a respective execution of the transaction workload, the method comprising. A first record location in the first file and an associated window of a defined number of sequential second record locations in the second file are advanced one record location at a time. Whether each operation record of a complete transaction at a first record location has a matching operation record at one of the record locations in the associated window of second record locations is determined. If so, the complete transaction in the first file and the transaction that includes the matching operation records in the second file are identified as matching transactions.
摘要翻译：识别匹配事务。第一和第二日志文件包含事务工作负载中的事务的操作记录，每个文件记录事务工作负载的相应执行，该方法包括。第一文件中的第一记录位置和第二文件中定义数目的连续第二记录位置的关联窗口一次被提前一个记录位置。确定在第一记录位置处的完整交易的每个操作记录是否具有在第二记录位置的关联窗口中的记录位置之一处的匹配操作记录。如果是，第一个文件中的完整事务和包含第二个文件中的匹配操作记录的事务被标识为匹配事务。

2. 发明申请

US20130254237A1 DECLARATIVE SPECIFICATION OF DATA INTEGRATON WORKFLOWS FOR EXECUTION ON PARALLEL PROCESSING PLATFORMS 有权
公开(公告)号：US20130254237A1
公开(公告)日：2013-09-26
申请号：US13872388
申请日：2013-04-29
申请人： International Business Machines Corporation
发明人： Manoj K. Agarwal , Himanshu Gupta , Rajeev Gupta , Sanjeev K. Gupta , Mukesh K. Mohania , Sriram K. Padmanabhan , Prasan Roy
IPC分类号： G06F17/30
CPC分类号： G06F17/30292 , G06F7/00 , G06F8/314 , G06F8/456 , G06F17/30
摘要： A method for receiving a declarative specification including a plurality of stages. Each stage specifies an atomic operation, a data input to the atomic operation, and a data output from the atomic operation. The data input is characterized by a data type. Links between at least two of the stages are generated to create a data integration workflow. The data integration workflow is compiled to generate computer code for execution on a parallel processing platform. The computer code configured to perform at least one of data preparation and data analysis.

3. 发明授权

US09244950B2 Method for synthetic data generation for query workloads 有权
标题翻译：用于查询工作负载的合成数据生成方法
公开(公告)号：US09244950B2
公开(公告)日：2016-01-26
申请号：US13934232
申请日：2013-07-03
申请人： International Business Machines Corporation
发明人： Atreyee Dey , Prasan Roy
IPC分类号： G06F17/30 , G06F11/36
CPC分类号： G06F17/30289 , G06F11/36
摘要： Generation of synthetic database data includes annotated query subplans for a multiple table query workload that includes a desired cardinality for nodes (v) in the subplans. The subplans may be merged and represented by a direct acyclic graph (DAG). The maximum entropy joint probability distribution for each attribute (x) for each node (v) is determined as: p ⁡ ( x ) = exp ( ∑ v ⁢ ⁢ w v ⁢ f v ⁡ ( x ) Z ) for each node ν, where wv is a weight of node v, fv is a conjunct of predicates in a subplan rooted at node v, and Z is a normalization factor. This distribution is determined such that the desired cardinality, and selectivities for each node v determined from the desired cardinality, are satisfied. The data for a plurality of tables are generated by sampling the maximum entropy joint probability distribution for a domain of attributes (x) of a plurality of tables. Data may be efficiently generated for multiple table queries and for DAGs.
摘要翻译：生成合成数据库数据包括用于多表查询工作负荷的注释查询子计划，其包括子计划中节点（v）的期望基数。子程序可以由直接非循环图（DAG）合并和表示。每个节点（v）的每个属性（x）的最大熵联合概率分布被确定为：对于每个节点＆ngr，p（⁡（x）= exp（Σv∞wv fv⁡（x）Z） wv是节点v的权重，fv是根据节点v的子规划中谓词的连接，Z是归一化因子。确定这种分布，使得满足从所需基数确定的每个节点v的期望基数和选择性。通过对多个表的属性（x）的域的最大熵联合概率分布进行采样来生成多个表的数据。可以为多个表查询和DAG有效地生成数据。

4. 发明授权

US09135289B2 Matching transactions in multi-level records 有权
标题翻译：在多级记录中匹配交易
公开(公告)号：US09135289B2
公开(公告)日：2015-09-15
申请号：US14293385
申请日：2014-06-02
申请人： International Business Machines Corporation
发明人： Manoj K. Agarwal , Curt L. Cotner , Amitava Kundu , Prasan Roy , Rajesh Sambandhan
IPC分类号： G06F17/30
CPC分类号： G06F17/30371 , G06F17/30008 , G06F17/303
摘要： Identifying matching transactions. First and second log files contain operation records of transactions in a transaction workload, each file recording a respective execution of the transaction workload, the method comprising. A first record location in the first file and an associated window of a defined number of sequential second record locations in the second file are advanced one record location at a time. Whether each operation record of a complete transaction at a first record location has a matching operation record at one of the record locations in the associated window of second record locations is determined. If so, the complete transaction in the first file and the transaction that includes the matching operation records in the second file are identified as matching transactions.
摘要翻译：识别匹配事务。第一和第二日志文件包含事务工作负载中事务的操作记录，每个文件记录事务工作负载的相应执行，该方法包括。第一文件中的第一记录位置和第二文件中定义数目的连续第二记录位置的关联窗口一次被提前一个记录位置。确定在第一记录位置处的完整交易的每个操作记录是否具有在第二记录位置的关联窗口中的记录位置之一处的匹配操作记录。如果是，第一个文件中的完整事务和包含第二个文件中的匹配操作记录的事务被标识为匹配事务。

5. 发明授权

US08984516B2 System and method for shared execution of mixed data flows 有权
标题翻译：用于共享执行混合数据流的系统和方法
公开(公告)号：US08984516B2
公开(公告)日：2015-03-17
申请号：US13891331
申请日：2013-05-10
申请人： International Business Machines Corporation
发明人： Rajeev Gupta , Padmashree Ravindra , Prasan Roy
IPC分类号： G06F9/46 , G06F7/00 , G06F9/50
CPC分类号： G06F9/50 , G06F9/5066
摘要： A method, computer program product, and computer system for shared execution of mixed data flows, performed by one or more computing devices, comprises identifying one or more resource sharing opportunities across a plurality of parallel tasks. The plurality of parallel tasks includes zero or more relational operations and at least one non-relational operation. The plurality of parallel tasks relative to the relational operations and the at least one non-relational operation are executed. In response to executing the plurality of parallel tasks, one or more resources of the identified resource sharing opportunities is shared across the relational operations and the at least one non-relational operation.
摘要翻译：一种由一个或多个计算设备执行的用于共享执行混合数据流的方法，计算机程序产品和计算机系统包括：识别跨多个并行任务的一个或多个资源共享机会。多个并行任务包括零个或多个关系操作和至少一个非关系操作。执行相对于关系操作和至少一个非关系操作的多个并行任务。响应于执行多个并行任务，所识别的资源共享机会中的一个或多个资源跨越关系操作和至少一个非关系操作共享。

6. 发明申请

US20140236976A1 MATCH WINDOW SIZE FOR MATCHING MULTI-LEVEL TRANSACTIONS BETWEEN LOG FILES 有权
标题翻译：匹配窗口大小，用于匹配日志文件之间的多级交易
公开(公告)号：US20140236976A1
公开(公告)日：2014-08-21
申请号：US13772386
申请日：2013-02-21
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Manoj K. Agarwal , Curt L. Cotner , Amitava Kundu , Prasan Roy , Rajesh Sambandhan
IPC分类号： G06F17/30
CPC分类号： G06F17/30106 , G06F9/466 , G06F17/30368
摘要： A predefined number of matches is identified between records in a first file and records in a second file. For the matches, determine the span of the actual range of record positions in the second file relative to the positions of the operation records in the first file within which all matches were found. If the actual span is smaller than the span of a current defined range of record positions by at least a first threshold value, decrease the span of the current defined range. If the actual span is within a second threshold value of the span of the current defined range, increase the span of the current defined range. If an amount above a third threshold value of operation records in the first file are not matched to operation records in the second file, increasing the span of the current defined range.
摘要翻译：在第一个文件中的记录之间识别预定义数量的匹配，并记录在第二个文件中。对于匹配，确定第二个文件中相对于找到所有匹配的第一个文件中的操作记录的位置的实际记录位置范围的跨度。如果实际跨度小于当前定义的记录位置范围至少第一阈值的跨度，则减小当前限定范围的跨度。如果实际跨度在当前限定范围的跨度的第二个阈值内，则增加当前定义范围的跨度。如果第一文件中的操作记录的第三阈值以上的量与第二文件中的操作记录不匹配，则增加当前定义范围的跨度。

7. 发明授权

US09317542B2 Declarative specification of data integration workflows for execution on parallel processing platforms 有权
标题翻译：用于并行处理平台执行的数据集成工作流的声明性规范
公开(公告)号：US09317542B2
公开(公告)日：2016-04-19
申请号：US13872388
申请日：2013-04-29
申请人： International Business Machines Corporation
发明人： Manoj K. Agarwal , Himanshu Gupta , Rajeev Gupta , Sanjeev K. Gupta , Mukesh K. Mohania , Sriram K. Padmanabhan , Prasan Roy
IPC分类号： G06F7/00 , G06F17/30 , G06F9/44 , G06F9/45
CPC分类号： G06F17/30292 , G06F7/00 , G06F8/314 , G06F8/456 , G06F17/30
摘要： A method for receiving a declarative specification including a plurality of stages. Each stage specifies an atomic operation, a data input to the atomic operation, and a data output from the atomic operation. The data input is characterized by a data type. Links between at least two of the stages are generated to create a data integration workflow. The data integration workflow is compiled to generate computer code for execution on a parallel processing platform. The computer code configured to perform at least one of data preparation and data analysis.
摘要翻译：一种用于接收包括多个级的声明性规范的方法。每个阶段都指定一个原子操作，一个数据输入到原子操作，以及一个从原子操作输出的数据。数据输入的特征在于数据类型。生成至少两个阶段之间的链接以创建数据集成工作流。数据集成工作流被编译成生成用于在并行处理平台上执行的计算机代码。被配置为执行数据准备和数据分析中的至少一个的计算机代码。

8. 发明授权

US09063944B2 Match window size for matching multi-level transactions between log files 有权
标题翻译：匹配窗口大小，用于在日志文件之间匹配多级事务
公开(公告)号：US09063944B2
公开(公告)日：2015-06-23
申请号：US13772386
申请日：2013-02-21
申请人： International Business Machines Corporation
发明人： Manoj K. Agarwal , Curt L. Cotner , Amitava Kundu , Prasan Roy , Rajesh Sambandhan
IPC分类号： G06F17/30 , G06F9/46
CPC分类号： G06F17/30106 , G06F9/466 , G06F17/30368
摘要： A predefined number of matches is identified between records in a first file and records in a second file. For the matches, determine the span of the actual range of record positions in the second file relative to the positions of the operation records in the first file within which all matches were found. If the actual span is smaller than the span of a current defined range of record positions by at least a first threshold value, decrease the span of the current defined range. If the actual span is within a second threshold value of the span of the current defined range, increase the span of the current defined range. If an amount above a third threshold value of operation records in the first file are not matched to operation records in the second file, increasing the span of the current defined range.
摘要翻译：在第一个文件中的记录之间识别预定义数量的匹配，并记录在第二个文件中。对于匹配，确定第二个文件中相对于找到所有匹配的第一个文件中的操作记录的位置的实际记录位置范围的跨度。如果实际跨度小于当前定义的记录位置范围至少第一阈值的跨度，则减小当前限定范围的跨度。如果实际跨度在当前限定范围的跨度的第二个阈值内，则增加当前定义范围的跨度。如果第一文件中的操作记录的第三阈值以上的量与第二文件中的操作记录不匹配，则增加当前定义范围的跨度。

9. 发明申请

US20130326534A1 SYSTEM AND METHOD FOR SHARED EXECUTION OF MIXED DATA FLOWS 有权
公开(公告)号：US20130326534A1
公开(公告)日：2013-12-05
申请号：US13891331
申请日：2013-05-10
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Rajeev Gupta , Padmashree Ravindra , Prasan Roy
IPC分类号： G06F9/50
CPC分类号： G06F9/50 , G06F9/5066
摘要： A method, computer program product, and computer system for shared execution of mixed data flows, performed by one or more computing devices, comprises identifying one or more resource sharing opportunities across a plurality of parallel tasks. The plurality of parallel tasks includes zero or more relational operations and at least one non-relational operation. The plurality of parallel tasks relative to the relational operations and the at least one non-relational operation are executed. In response to executing the plurality of parallel tasks, one or more resources of the identified resource sharing opportunities is shared across the relational operations and the at least one non-relational operation.

10. 发明授权

US09785657B2 Method for synthetic data generation for query workloads 有权
公开(公告)号：US09785657B2
公开(公告)日：2017-10-10
申请号：US14485725
申请日：2014-09-13
申请人： International Business Machines Corporation
发明人： Atreyee Dey , Prasan Roy
IPC分类号： G06F17/30 , G06F11/36
CPC分类号： G06F17/30289 , G06F11/36
摘要： Generation of synthetic database data includes annotated query subplans for a multiple table query workload that includes a desired cardinality for nodes (v) in the subplans. The subplans may be merged and represented by a direct acyclic graph (DAG). The maximum entropy joint probability distribution for each attribute (x) for each node (v) is determined as: p ⁡ ( x ) = exp [ ( ∑ v ⁢ ⁢ w v ⁢ f v ⁡ ( x ) Z ] ) for each node v, where wv is a weight of node v, fv is a conjunct of predicates in a subplan rooted at node v, and Z is a normalization factor. This distribution is determined such that the desired cardinality, and selectivities for each node v determined from the desired cardinality, are satisfied. The data for a plurality of tables are generated by sampling the maximum entropy joint probability distribution for a domain of attributes (x) of a plurality of tables. Data may be efficiently generated for multiple table queries and for DAGs.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式