公开(公告)号：US20070250517A1

公开(公告)日：2007-10-25

申请号：US11379503

申请日：2006-04-20

申请人： Robert Bestgen ,  Curtis Boger ,  David Carlson ,  Robert Downer ,  Steven Hoeschen ,  Kevin Kathmann ,  Shantan Kethireddy

发明人： Robert Bestgen ,  Curtis Boger ,  David Carlson ,  Robert Downer ,  Steven Hoeschen ,  Kevin Kathmann ,  Shantan Kethireddy

IPC分类号： G06F7/00

CPC分类号： G06F16/24539 ,  G06F16/22 ,  G06F16/2454 ,  G06F16/24561

摘要： A latent auxiliary database structure constructed for executing a query is automatically saved for reuse in subsequent query execution instances. The latent auxiliary database structure is not maintained concurrently with changes to records in the database tables. If a query execution strategy is subsequently invoked which uses the latent auxiliary database structure, a determination is made dynamically whether to update the previously saved latent structure from database changes recorded in one or more change logs, or to rebuild the latent structure from scratch. Where the cost of updating from the change log is deemed less than the cost of a rebuild from scratch, the previously saved latent structure is updated from the log.

摘要翻译： 构建用于执行查询的潜在辅助数据库结构将自动保存，以便在后续查询执行实例中重用。 潜在辅助数据库结构与数据库表中记录的更改不同时维护。 如果随后调用使用潜在辅助数据库结构的查询执行策略，则动态确定是否从先前保存的潜在结构更新记录在一个或多个更改日志中的数据库更改，或从头重新构建潜在结构。 在从更改日志更新成本被认为小于从头开始重建的成本的情况下，先前保存的潜在结构将从日志中更新。

公开(公告)号：US20070226176A1

公开(公告)日：2007-09-27

申请号：US11388004

申请日：2006-03-23

申请人： Robert Bestgen ,  Robert Downer ,  Shantan Kethireddy

发明人： Robert Bestgen ,  Robert Downer ,  Shantan Kethireddy

IPC分类号： G06F17/30

CPC分类号： G06F16/2246

摘要： A query optimizer optimizes a query to a partitioned database table by determining common characteristics of the partitions and generating a virtual maintained temporary index that spans multiple partitions. Using the virtual maintained temporary index allows the query optimizer to generate an access plan based on the virtual maintained temporary index, which relieves the optimizer from having to individually optimize access to each partition for partitions that share common characteristics.

摘要翻译： 查询优化器通过确定分区的共同特征并生成跨多个分区的虚拟维护临时索引来优化对分区数据库表的查询。 使用虚拟维护的临时索引允许查询优化器基于虚拟维护的临时索引生成访问计划，这减轻了优化器必须单独优化对共享共同特征的分区的每个分区的访问。

公开(公告)号：US20070016558A1

公开(公告)日：2007-01-18

申请号：US11181713

申请日：2005-07-14

申请人： Robert Bestgen ,  Shantan Kethireddy ,  Jeffrey Tenner

发明人： Robert Bestgen ,  Shantan Kethireddy ,  Jeffrey Tenner

IPC分类号： G06F17/30

CPC分类号： G06F17/3053 ,  G06F17/30545

摘要： A query facility for database queries dynamically determines whether selective portions of a database table are likely to benefit from separate query execution strategies, and constructs an appropriate separate execution strategies accordingly. Preferably, the database contains at least one relatively large table comprising multiple partitions, each sharing the definitional structure of the table and containing a different respective discrete subset of the table records. The query facility compares metadata for different partitions to determine whether sufficiently large differences exist among the partitions, and in appropriate cases selects one or more partitions for separate execution strategies. Preferably, partitions are ranked for separate evaluation using a weighting formula which takes into account: (a) the number of indexes for the partition, (b) recency of change activity, and (c) the size of the partition.

摘要翻译： 用于数据库查询的查询工具动态地确定数据库表的选择性部分是否可能受益于单独的查询执行策略，并相应地构建适当的单独的执行策略。 优选地，数据库包含至少一个包括多个分区的相对较大的表，每个分区共享表的定义结构，并且包含表记录的不同相应离散子集。 查询设施比较不同分区的元数据，以确定分区之间是否存在足够大的差异，并且在适当的情况下选择一个或多个分区用于单独的执行策略。 优选地，使用考虑到的加权公式对分区进行分级评估：（a）分区的索引的数量，（b）更改活动的新近度，以及（c）分区的大小。

公开(公告)号：US20060095406A1

公开(公告)日：2006-05-04

申请号：US10977801

申请日：2004-10-29

申请人： Robert Bestgen ,  Shantan Kethireddy ,  Michael Pfeifer

发明人： Robert Bestgen ,  Shantan Kethireddy ,  Michael Pfeifer

IPC分类号： G06F17/30

CPC分类号： G06F16/217 ,  G06F16/24547

摘要： Enabling a user to obtain and view graphic explain data with no need to activate a monitor and no need to wait for a job to complete before the explain data for a query may be viewed. Displaying explain data for an SQL query of a database that include executing an SQL query and displaying explain data for the SQL query while executing the SQL query. Displaying explain data includes identifying an access plan associated with the SQL query and generating explain data in dependence upon the access plan. Identifying an access plan may be carried out by retrieving an access plan identification from a cursor of a job control block and retrieving an access plan from an access plan cache in dependence upon the access plan identification.

摘要翻译： 允许用户获取和查看图形说明数据，无需激活监视器，无需等待作业完成，才能查看查询的说明数据。 显示数据库的SQL查询的解释数据，其中包括执行SQL查询并在执行SQL查询时显示SQL查询的说明数据。 显示说明数据包括识别与SQL查询相关联的访问计划，并根据访问计划生成说明数据。 识别访问计划可以通过从作业控制块的光标检索访问计划标识并且根据访问计划标识从访问计划高速缓存检索访问计划来执行访问计划。

公开(公告)号：US20060173852A1

公开(公告)日：2006-08-03

申请号：US11047533

申请日：2005-01-31

申请人： Robert Bestgen ,  Shantan Kethireddy

发明人： Robert Bestgen ,  Shantan Kethireddy

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

CPC分类号： G06F16/20

摘要： A visual query explain mechanism displays a query to the user in a graphical tree format. A user may execute a query, and the actual performance from executing the query is imported into the visual query explain mechanism. The visual query explain mechanism adds the actual performance to the nodes in the query tree, and compares the actual performance to the estimates of performance that were generated prior to executing the query. The visual query explain mechanism then looks at a predefined threshold value, and determines whether actual performance exceeds the estimated performance by the predefined threshold value. If so, the corresponding node in the query graph is highlighted in some way, thereby providing a visual indication to the user of problem areas in the query.

摘要翻译： 视觉查询解释机制以图形树形式向用户显示查询。 用户可以执行查询，并将执行查询的实际性能导入到视觉查询解释机制中。 视觉查询解释机制将实际性能添加到查询树中的节点，并将实际性能与执行查询之前生成的性能估计进行比较。 视觉查询解释机制然后查看预定义的阈值，并且确定实际性能是否超过预定阈值的估计性能。 如果是这样，查询图中的对应节点以某种方式突出显示，从而向用户提供查询中的问题区域的可视指示。

公开(公告)号：US20070027860A1

公开(公告)日：2007-02-01

申请号：US11191470

申请日：2005-07-28

申请人： Robert Bestgen ,  Shantan Kethireddy ,  Jeffrey Tenner

发明人： Robert Bestgen ,  Shantan Kethireddy ,  Jeffrey Tenner

IPC分类号： G06F17/30

CPC分类号： G06F16/24544 ,  G06F16/24524

摘要： A database facility supports database join queries in a database environment having at least one database table divided into multiple partitions based on a partition key value. The facility determines whether the values in a table joined to the partitioned table place an implicit limitation on the partition key, and eliminates from query evaluation any partitions which do not satisfy the implicit limitation. Preferably, the database uses a star schema organization, in which implicit limitations in a relatively small dimension table are used to eliminate partitions in a relatively large fact table.

摘要翻译： 数据库设施支持数据库环境中的数据库连接查询，其中至少有一个基于分区键值划分成多个分区的数据库表。 该设施确定连接到分区表的表中的值是否对分区关键字产生隐式限制，并且从查询评估中排除不满足隐式限制的任何分区。 优选地，数据库使用星型模式组织，其中使用相对较小维度表中的隐含限制来消除较大事实表中的分区。

公开(公告)号：US20070156736A1

公开(公告)日：2007-07-05

申请号：US11326564

申请日：2006-01-05

申请人： Robert Bestgen ,  Shantan Kethireddy ,  Michael Pfeifer

发明人： Robert Bestgen ,  Shantan Kethireddy ,  Michael Pfeifer

IPC分类号： G06F7/00

CPC分类号： G06F16/24542

摘要： In one aspect, a database analytical tool or function analyzes join queries to detect queries which could be reduced if a referential integrity relationship were known. In another aspect, a probable latent referential integrity relationship is detected using one or more heuristics. Preferably, a join query is analyzed to detect a joined table which has no other conditions placed on it, and no referential integrity relationship already defined. For any such query, the analysis attempts to verify a probable latent referential integrity relationship using at least one heuristic, such as comparing cardinality of the potential primary key with the size of the table and/or with the cardinality of the foreign key. It is further possible to execute the join for some sample of records, and determine whether any records were found which did not conform to referential integrity constraints.

摘要翻译： 在一方面，数据库分析工具或功能分析连接查询以检测可以减少参考完整性关系的查询。 在另一方面，使用一个或多个启发式检测可能的潜在参照完整性关系。 优选地，分析联接查询以检测没有其上放置其他条件的联接表，并且没有定义参照完整性关系。 对于任何这样的查询，分析尝试使用至少一个启发式来验证可能的潜在引用完整性关系，例如将潜在主键的基数与表的大小和/或与外键的基数相比较。 还可以对某些记录样本执行连接，并确定是否找到不符合引用完整性约束的记录。

公开(公告)号：US20070143246A1

公开(公告)日：2007-06-21

申请号：US11304134

申请日：2005-12-15

申请人： Robert Bestgen ,  Michael Cain ,  Shantan Kethireddy ,  Michael Pfeifer

发明人： Robert Bestgen ,  Michael Cain ,  Shantan Kethireddy ,  Michael Pfeifer

IPC分类号： G06F17/30

CPC分类号： G06F16/217 ,  G06F16/24524 ,  G06F16/24547

摘要： A database application re-uses one or more query execution strategies for a given logical query, and saves historical data concerning query execution performance under differing execution parameters. The historical data is analyzed to identify environmental variables and/or imported variables which significantly affect execution performance. Preferably, an auxiliary data structure includes, for each of multiple execution strategies, a respective set of imported and environmental variables and respective average cost measure, such as execution time. An analytical tool compares multiple different strategies to identify imported and/or environmental variables which caused a different strategy to be used, and resultant average cost. Preferably, the tool can also compare variation within the same strategy.

摘要翻译： 数据库应用程序重新使用给定逻辑查询的一个或多个查询执行策略，并在不同的执行参数下保存有关查询执行性能的历史数据。 分析历史数据，以识别显着影响执行绩效的环境变量和/或导入变量。 优选地，对于多个执行策略中的每一个，辅助数据结构包括相应的一组导入和环境变量以及相应的平均成本度量，诸如执行时间。 分析工具比较了多种不同的策略来识别导致使用不同策略的进口和/或环境变量，从而导致平均成本。 优选地，该工具还可以比较相同策略中的变化。

公开(公告)号：US20060271504A1

公开(公告)日：2006-11-30

申请号：US11138832

申请日：2005-05-26

申请人： Mark Anderson ,  Robert Bestgen ,  Shantan Kethireddy ,  Jeffrey Tenner

发明人： Mark Anderson ,  Robert Bestgen ,  Shantan Kethireddy ,  Jeffrey Tenner

IPC分类号： G06F17/30

CPC分类号： G06F17/30312

摘要： A method, apparatus, system, and signal-bearing medium that, in an embodiment, determine performance data for query optimization of a query directed to a database table having multiple partitions. The performance data for the query optimization is presented in a user interface, and an option is provided in the user interface to create a non-spanning index for any of the partitions mentioned in the performance data. In various embodiments, determining the performance data may include: determining the partitions that were unexpanded by the query optimization, determining the partitions that had a runtime estimate that was different from an actual query runtime by a threshold, determining whether any of the partitions had expansion forced by a client request, determining whether the query performed partition elimination, determining whether any of the partitions has an associated index that is unused by the query and that also has a key that is not present in all of the partitions, and determining a constraint for partition elimination.

摘要翻译： 一种方法，装置，系统和信号承载介质，其在一个实施例中确定用于针对具有多个分区的数据库表的查询的查询优化的性能数据。 查询优化的性能数据在用户界面中呈现，并且在用户界面中提供了一个选项，以便为演奏数据中提到的任何分区创建非跨度索引。 在各种实施例中，确定性能数据可以包括：确定由查询优化未展开的分区，将具有与实际查询运行时间不同的运行时间估计的分区确定为阈值，确定是否有任何分区具有扩展 通过客户端请求强制，确定查询是否执行分区消除，确定任何分区是否具有由查询未使用的关联索引，并且还具有不存在于所有分区中的密钥，以及确定约束 用于分区消除。

公开(公告)号：US08935231B2

公开(公告)日：2015-01-13

申请号：US12120582

申请日：2008-05-14

申请人： Robert Joseph Bestgen ,  Robert Victor Downer ,  Shantan Kethireddy

发明人： Robert Joseph Bestgen ,  Robert Victor Downer ,  Shantan Kethireddy

IPC分类号： G06F17/30

CPC分类号： G06F17/30327

摘要： A query optimizer optimizes a query to a partitioned database table by determining common characteristics of the partitions and generating a virtual maintained temporary index that spans multiple partitions. Using the virtual maintained temporary index allows the query optimizer to generate an access plan based on the virtual maintained temporary index, which relieves the optimizer from having to individually optimize access to each partition for partitions that share common characteristics.

摘要翻译： 查询优化器通过确定分区的共同特征并生成跨多个分区的虚拟维护临时索引来优化对分区数据库表的查询。 使用虚拟维护的临时索引允许查询优化器基于虚拟维护的临时索引生成访问计划，这减轻了优化器必须单独优化对共享共同特征的分区的每个分区的访问。