公开(公告)号：US20180336244A1

公开(公告)日：2018-11-22

申请号：US15600461

申请日：2017-05-19

Applicant: International Business Machines Corporation

Inventor： Eric L. BARSNESS ,  Daniel E. BEUCH ,  Alexander COOK ,  John M. SANTOSUOSSO

IPC: G06F17/30

CPC classification number: G06F17/30433 ,  G06F9/50 ,  G06F17/30442 ,  G06F17/30466 ,  G06F17/30469 ,  G06F17/30474

Abstract: Systems, methods, and computer program products to perform an operation comprising receiving, by a database management system (DBMS), a query for execution, computing, by a query governor, a first resource consumption value for executing a first portion of the received query against a plurality of data tuples in an operator graph of a distributed application, and upon determining that the first resource consumption value does not exceed a first threshold value, executing the query by operation of one or more computer processors.

公开(公告)号：US20180329973A1

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

申请号：US15796288

申请日：2017-10-27

Applicant: SAP SE

Inventor： Reza Sherkat ,  Anisoara Nica ,  Xun Cheng ,  Prabhas Kumar Samanta ,  Mihnea Andrei

IPC: G06F17/30

CPC classification number: G06F17/30584 ,  G06F17/30292 ,  G06F17/30306 ,  G06F17/30339 ,  G06F17/30371 ,  G06F17/30469 ,  G06F17/30536

Abstract: Disclosed herein are system, method, and computer program product embodiments for performing dynamic partition pruning using data statistic objects as data integrity constraints. An embodiment operates by partitioning a database table into a plurality of partitions based on a partition criterion. The embodiment creates a data statistics object for a partition in the plurality of partitions. The embodiment receives a query for the database table. The embodiment determines the data statistics object is consistent with data in the partition. The embodiment processes the query for the partition based on the data statistics object.

公开(公告)号：US20180329941A1

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

申请号：US15796326

申请日：2017-10-27

Applicant: SAP SE

Inventor： Anisoara NICA ,  Reza Sherkat ,  Mihnea Andrei

IPC: G06F17/30

CPC classification number: G06F17/30584 ,  G06F17/30292 ,  G06F17/30306 ,  G06F17/30339 ,  G06F17/30371 ,  G06F17/30469 ,  G06F17/30536

Abstract: Disclosed herein are system, method, and computer program product embodiments for using a data statistic as a dynamic data integrity constraint. An embodiment operates by defining a data statistic for a column or a set of columns of a partition of a plurality of partitions of a database table. The embodiment creates a constraint data statistics object based on the data statistic. The embodiment receives a query for the database table. The embodiment determines the constraint data statistics object is consistent with a data state of the partition. The embodiment derives an implied constraint based on the constraint data statistics object. The embodiment processes the query for the partition based on the implied constraint.

公开(公告)号：US20180196849A1

公开(公告)日：2018-07-12

申请号：US15937976

申请日：2018-03-28

Applicant: International Business Machines Corporation

Inventor： Shuo Li ,  Ping Liang ,  Ke Wei Wei ,  Xin Ying Yang

IPC: G06F17/30

CPC classification number: G06F17/30442 ,  G06F17/30339 ,  G06F17/30469 ,  G06F17/30486 ,  G06F17/30584

Abstract: 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.

公开(公告)号：US09996569B2

公开(公告)日：2018-06-12

申请号：US14660948

申请日：2015-03-18

Applicant: International Business Machines Corporation

Inventor： Robert W. Lyle

IPC: G06F17/30

CPC classification number: G06F17/30336 ,  G06F17/30321 ,  G06F17/30424 ,  G06F17/30457 ,  G06F17/30469

Abstract: In searching an index in an original search structure for a database, portion(s) of the index are determined to be stored in a memory in an alternate search structure. The alternate search structure with the portion(s) is created and stored in the memory. The index is searched by traversing the alternate search structure and possibly the original search structure. The alternate search structure may be traversed more efficiently than the original search structure. The number of portions of the index may be a tunable parameter or selected based on a performance improvement/expense ratio. The search of the index begins at the alternate search structure. During traversal of the one or more portions in the alternate search structure, if traversal is to continue at a portion in the original search structure, the identity of this portion is obtained. The traversal is continued at this identified portion in the original search structure.

公开(公告)号：US09922088B2

公开(公告)日：2018-03-20

申请号：US14145777

申请日：2013-12-31

Applicant: Anisoara Nica

Inventor： Anisoara Nica

IPC: G06F17/30

CPC classification number: G06F17/30469

Abstract: A system, computer-implemented method, and computer-program product embodiments for determining a cardinality estimate for a query. A cardinality estimator identifies a predicate in a query, where the predicate is split into a plurality of equivalence classes. The cardinality estimator then generates a plurality of equivalence graphs from the plurality of equivalence classes, one equivalence graph for an equivalence class. Spanning trees are identified from the plurality of equivalence graphs, and the cardinality estimator then determines the cardinality estimate for the query from the spanning trees.

公开(公告)号：US09852142B2

公开(公告)日：2017-12-26

申请号：US15040009

申请日：2016-02-10

Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

Inventor： Michael Reichert ,  Torsten Steinbach ,  Matthias Tschaffler

IPC: G06F17/30 ,  G06F11/34 ,  G06F11/30

CPC classification number: G06F17/30144 ,  G06F11/3034 ,  G06F11/3414 ,  G06F17/30433 ,  G06F17/30463 ,  G06F17/30469 ,  G06F17/30474 ,  G06F17/30595

Abstract: Embodiments of the present invention provide systems, methods, and computer program products for detecting shifts in types of workloads handled by a relational database management system. Embodiments of the present invention can afford relational database administrators with the ability to leverage information pertinent to the current type of workload being handled by the relational database management system. Furthermore, embodiments of the present invention provide relational database administrators with information in regard to system workload states and workload transitions.

公开(公告)号：US09785673B2

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

申请号：US15196237

申请日：2016-06-29

Applicant: International Business Machines Corporation

Inventor： Mihaela A. Bornea ,  Julian Dolby ,  Achille B. Fokoue-Nkoutche ,  Anastasios Kementsietsidis ,  Kavitha Srinivas

IPC: G06F17/30 ,  G06F7/00

CPC classification number: G06F17/30469 ,  G06F17/30442 ,  G06F17/30477 ,  G06F17/3053 ,  G06F17/30935 ,  G06F17/30958

Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.

公开(公告)号：US09734202B2

公开(公告)日：2017-08-15

申请号：US15077800

申请日：2016-03-22

Applicant: Interana, Inc.

Inventor： Robert Johnson ,  Lior Abraham ,  Ann Johnson ,  Boris Dimitrov ,  Don Fossgreen

IPC: G06F17/30

CPC classification number: G06F17/30395 ,  G06F17/30469 ,  G06F17/30486 ,  G06F17/30536 ,  G06F17/30545 ,  G06F17/30584

Abstract: A method for rapid data analysis comprising receiving and interpreting a query, collecting a first data sample from the first set of data shards, calculating an intermediate result to the query based on analysis of the first data sample, identifying a second set of data shards based on the intermediate result, collecting a second data sample from the second set of data shards, and calculating a final result to the query based on analysis of the second data sample.

公开(公告)号：US09727612B2

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

申请号：US14507912

申请日：2014-10-07

Applicant: James M Plasek ,  Jennifer J Smith

Inventor： James M Plasek ,  Jennifer J Smith

IPC: G06F17/30

CPC classification number: G06F17/30495 ,  G06F17/30339 ,  G06F17/30345 ,  G06F17/30389 ,  G06F17/30427 ,  G06F17/30448 ,  G06F17/30469 ,  G06F17/30498

Abstract: Systems and methods for evaluating analytic queries comprising disjunctive Boolean expressions are described. A method may include receiving an analytic query comprising a first disjunctive Boolean expression. The method may further include transforming the analytic query to obtain a transformed analytic query comprising at least one nondisjunctive Boolean expression and at least a second disjunctive Boolean expression. The method may also include evaluating the transformed analytic query, wherein complete evaluation of the at least one nondisjunctive Boolean expressions and the at least a second disjunctive Boolean expressions yields the same results as evaluation of the first disjunctive Boolean expression.