公开(公告)号：US09613075B2

公开(公告)日：2017-04-04

申请号：US15066543

申请日：2016-03-10

申请人： International Business Machines Corporation

发明人： Shuo Li ,  Ping Liang ,  Xin Ying Yang ,  Jian Wei Zhang

IPC分类号： G06F17/30

CPC分类号： G06F17/30336 ,  G06F17/30315 ,  G06F17/30377

摘要： Embodiments of the present invention provide a method, computer program product, and computer system for masking indexes. The method may include masking the index if the index contention exceeds a defined threshold. The method may also include configuring the mask type for the index to insert the index without masking. In response to determining that the mask type for the index is configured to insert the index without masking, the index is masked according to a set of rules.

公开(公告)号：US20170075956A1

公开(公告)日：2017-03-16

申请号：US14854087

申请日：2015-09-15

申请人： International Business Machines Corporation

发明人： Shuo Li ,  Ke Wei Wei ,  Li Yang ,  Xin Ying Yang ,  Jian Wei Zhang

IPC分类号： G06F17/30

CPC分类号： G06F17/30469 ,  G06F17/30474 ,  G06F17/30516

摘要： A computer-implemented method includes receiving a batch processing job. The method identifies multiple access paths for the batch processing job. The method determines one or more runtime costs for each of the multiple access paths. The method determines whether the batch processing job includes comparable access paths. The method responds to the batch processing job not including comparable access paths by receiving a query and selecting a desired access, based on the one or more runtime costs. The method responds to the batch processing job including comparable access paths by determining one or more context costs for each of the one or more access paths, receiving a query, identifying a context for the query, and selecting a desired access path for the query. The desired access path is based on the one or more runtime costs, the one or more context costs, and the context for the query.

公开(公告)号：US09575916B2

公开(公告)日：2017-02-21

申请号：US14148697

申请日：2014-01-06

申请人： International Business Machines Corporation

发明人： Brian K. Caufield ,  Ron E. Liu ,  DongJie Wei ,  Xin Ying Yang

IPC分类号： G06F7/00 ,  G06F13/36

CPC分类号： G06F13/36

摘要： A system identifies a performance bottleneck status in a parallel data processing environment by examining data flow associated with the parallel data processing environment to identify at least one operator, where an operator type is associated with at least one operator, at least one buffer, and a relationship that the buffer has with the operator, where the relationship is associated with the operator type. The system monitors the buffer to determine a buffer status associated with the buffer. The system applies a set of rules to identify an operator bottleneck status associated with the operator. The set of rules is applied to the operator, based on the operator type, the buffer status, and relationship that the buffer has with the operator. The system then determines a performance bottleneck status associated with the parallel data processing environment, based on the operator bottleneck status.

摘要翻译： 系统通过检查与并行数据处理环境相关联的数据流来识别并行数据处理环境中的性能瓶颈状态，以识别至少一个运营商，其中运营商类型与至少一个运营商，至少一个缓冲区和 缓冲区与操作员的关系，其中关系与操作员类型相关联。 系统监视缓冲区以确定与缓冲区相关联的缓冲区状态。 系统应用一组规则来识别与操作员相关联的操作员瓶颈状态。 根据操作员类型，缓冲区状态以及缓冲区与操作员的关系，将一组规则应用于操作员。 然后，系统基于操作员瓶颈状态确定与并行数据处理环境相关联的性能瓶颈状态。

公开(公告)号：US09569470B2

公开(公告)日：2017-02-14

申请号：US14458313

申请日：2014-08-13

申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION

发明人： Shuo Li ,  Xin Ying Yang ,  Mai Zeng ,  Xiang Zhou

IPC分类号： G06F17/30 ,  G06F7/00

CPC分类号： G06F17/30292

摘要： Managing a sharing relationship of tables. A super schema is formed incorporating a plurality of tables in a database according to data types of respective columns of the plurality of tables. A free storage capacity of the super schema is evaluated according to holes not occupied by any table in the super schema. A sharing relationship of the plurality of tables is determined according to the free storage capacity of the super schema. The sharing relationship of a large number of tables in a database can be managed effectively, so as to design or optimize the sharing solution among the tables.

摘要翻译： 管理表的共享关系。 根据多个表的各列的数据类型，形成在数据库中并入多个表的超级模式。 超级模式的空闲存储容量根据超级模式中的任何表未占用的孔进行评估。 根据超级模式的可用存储容量来确定多个表的共享关系。 可以有效地管理数据库中大量表的共享关系，以便设计或优化表之间的共享解决方案。

公开(公告)号：US20170017686A1

公开(公告)日：2017-01-19

申请号：US14798537

申请日：2015-07-14

申请人： International Business Machines Corporation

发明人： Hao Feng ,  Shuo Li ,  ShengYan Sun ,  Xin Ying Yang

IPC分类号： G06F17/30

CPC分类号： G06F17/30469 ,  G06F17/30424 ,  G06F17/30448 ,  G06F17/30474

摘要： In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.

公开(公告)号：US09547691B1

公开(公告)日：2017-01-17

申请号：US15210094

申请日：2016-07-14

申请人： International Business Machines Corporation

发明人： Hao Feng ,  Shuo Li ,  ShengYan Sun ,  Xin Ying Yang

IPC分类号： G06F17/30

CPC分类号： G06F17/30469 ,  G06F17/30448 ,  G06F17/30474

摘要： In an approach for calculating one or more access paths during bind time, a computer receives a query. The computer identifies one or more access paths for processing the received query, wherein the one or more access paths include steps associated with retrieving data from a database based on the received query. The computer calculates resource costs associated with processing the received query on the one or more identified access paths based on one of more of: resources utilized to perform steps associated with processing the received query, and system statistics associated with the one or more identified access paths.

摘要翻译： 在绑定时间内计算一个或多个访问路径的方法中，计算机接收查询。 计算机识别用于处理所接收的查询的一个或多个访问路径，其中所述一个或多个访问路径包括与基于所接收的查询从数据库检索数据相关联的步骤。 计算机基于以下之一来计算与处理接收的查询相关联的资源成本：用于执行与处理所接收的查询相关联的步骤的资源;以及与所述一个或多个所识别的访问路径相关联的系统统计 。

公开(公告)号：US20160371328A1

公开(公告)日：2016-12-22

申请号：US14746321

申请日：2015-06-22

申请人： International Business Machines Corporation

发明人： Shuo Li ,  Ping Liang ,  Ke Wei Wei ,  Xin Ying Yang

IPC分类号： G06F17/30

CPC分类号： G06F16/2453 ,  G06F16/2282 ,  G06F16/24545 ,  G06F16/24554 ,  G06F16/278

摘要： In an approach to determining an access method for a partition in a partition table, a computer receives a query and determines if there is a partition table utilized by the query. When there is a partition table utilized by the query, then the computer determines that a partition in the partition table meets the plurality of conditions of the query. The computer collects a plurality of partition level statistics for the partition that meets the plurality of conditions of the query. Additionally, the computer determines, based, at least in part, on the plurality of partition level statistics, a cost for one or more access methods for the partition that meets the plurality of conditions of the query. Furthermore, the computer determines, based, at least in part, on the cost for each access method, an access method for the partition that meets the plurality of conditions of the query.

公开(公告)号：US09495419B1

公开(公告)日：2016-11-15

申请号：US15045522

申请日：2016-02-17

申请人： International Business Machines Corporation

发明人： Shuo Li ,  Ping Liang ,  Ke Wei Wei ,  Xin Ying Yang ,  Chen Xin Yu

IPC分类号： G06F17/30

CPC分类号： G06F17/30474 ,  G06F17/30327 ,  G06F17/30463 ,  G06F17/30471

摘要： Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and an RID results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold.

摘要翻译： 在运行时优化多索引数据库访问。 处理器接收查询。 处理器确定计划的计划和RID结果阈值，其中计划包括对索引的访问。 处理器确定静态风险阈值，访问的静态风险以及静态风险是否超过静态风险阈值。 响应于超过静态风险阈值的静态风险，处理器确定访问的风险，并将访问链接到风险限制。 处理器使用密钥访问索引。 响应于与风险限制相关联的访问，处理器确定访问的动态风险。 处理器在执行计划期间接收一个或多个RID结果。 如果RID结果的数量小于RID结果阈值，则处理器中止计划的执行。

公开(公告)号：US20160314023A1

公开(公告)日：2016-10-27

申请号：US14692098

申请日：2015-04-21

申请人： International Business Machines Corporation

发明人： Mi W. Shum ,  DongJie Wei ,  Samuel H. K. Wong ,  Xin Ying Yang ,  Xiang Zhou

IPC分类号： G06F9/50 ,  H04L29/08

CPC分类号： H04L47/125 ,  G06F9/5083 ,  H04L67/1008 ,  H04L67/1012 ,  H04L67/1031

摘要： Embodiments of the present invention provide systems and methods for dynamically allocating data to multiple nodes. The method includes determining the usage of multiple buffers and the capability factors of multiple servers. Data is then allocated to multiple buffers associated with multiple active servers, based on the determined usage and capability factors, in order to keep the processing load on the multiple servers balanced.

摘要翻译： 本发明的实施例提供了用于向多个节点动态地分配数据的系统和方法。 该方法包括确定多个缓冲区的使用和多个服务器的能力因素。 然后根据所确定的使用和能力因素将数据分配给与多个活动服务器相关联的多个缓冲器，以便使多个服务器上的处理负载保持平衡。

公开(公告)号：US20160283535A1

公开(公告)日：2016-09-29

申请号：US14976153

申请日：2015-12-21

申请人： International Business Machines Corporation

发明人： Ke Chen ,  Shuo Li ,  Ping Liang ,  Xin Ying Yang

IPC分类号： G06F17/30

CPC分类号： G06F16/2246 ,  G06F16/2272 ,  G06F16/2282

摘要： In a method for managing a data index, one or more processors inserting one or more rows of data sequentially into a data table of a database. The method further includes inserting index entries that correspond to the inserted one or more rows of data sequentially into an index of the data table, wherein an index B-tree structure is not built initially during insertion. The method further includes determining whether one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met. The method further includes responsive to determining that one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met, building an index-B-tree structure that includes the index entries inserted into the index.

摘要翻译： 在用于管理数据索引的方法中，一个或多个处理器将一行或多行数据顺序地插入到数据库的数据表中。 该方法还包括将对应于插入的一行或多行数据的索引条目顺序地插入到数据表的索引中，其中在插入期间最初不建立索引B树结构。 该方法还包括确定以下之一：（i）插入到索引中的索引条目的大小阈值和（ii）将索引条目插入到索引中的时间阈值。 该方法还包括响应于确定以下之一：（i）符合索引的索引条目的大小阈值和（ii）将索引条目插入到索引中的时间阈值，构建索引B树结构 其中包括插入到索引中的索引条目。