-
1.发明授权Relational database query optimization to perform query evaluation plan, pruning based on the partition properties 失效关系数据库查询优化执行查询评估计划，根据分区属性进行修剪
公开(公告)号：US6092062A
公开(公告)日：2000-07-18
申请号：US885073
申请日：1997-06-30
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99944
摘要： A relational data base management system includes a query processor that uses a query operator partition property to perform QEP pruning and to ensure that data input to a query operator is partitioned appropriately for the operation. The partition property indicates the group of network nodes across which a table is distributed. The query processor also makes use of partition classes that are designated "interesting classes" to perform preoptimization planning and query pruning, and to perform look-ahead partitioning based on partition classes that are identified as being of interest to future operations, thereby more efficiently evaluating complex query statements in an MPP, shared-nothing environment.
摘要翻译： 关系数据库管理系统包括一个查询处理器，该查询处理器使用查询运算符分区属性执行QEP修剪，并确保输入到查询运算符的数据被适当地分配给操作。 分区属性指示分配表的网络节点组。 查询处理器还利用被指定为“有趣类”的分区类来执行优化前规划和查询修剪，并且基于被识别为未来操作感兴趣的分区类执行先行分区，从而更有效地评估 MPP中的复杂查询语句，无共享环境。
-
2.发明授权Method and system for look ahead query evaluation planning based on interesting partition properties 失效基于有趣的分区属性的方法和系统，用于提前查询评估计划公开(公告)号：US06345267B1
公开(公告)日：2002-02-05
申请号：US09517355
申请日：2000-03-02
IPC分类号： G06F1730
CPC分类号： G06F17/30463 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99944
摘要： A relational data base management system includes a query processor that uses a query operator partition property to perform QEP pruning and to ensure that data input to a query operator is partitioned appropriately for the operation. The partition property indicates the group of network nodes across which a table is distributed. The query processor also makes use of partition classes that are designated “interesting classes” to perform preoptimization planning and query pruning, and to perform look-ahead partitioning based on partition classes that are identified as being of interest to future operations, thereby more efficiently evaluating complex query statements in an MPP, shared-nothing environment.
摘要翻译： 关系数据库管理系统包括一个查询处理器，该查询处理器使用查询运算符分区属性执行QEP修剪，并确保输入到查询运算符的数据被适当地分配给操作。 分区属性指示分配表的网络节点组。 查询处理器还利用被指定为“有趣类”的分区类来执行优化前规划和查询修剪，并且基于被识别为未来操作感兴趣的分区类执行先行分区，从而更有效地评估 MPP中的复杂查询语句，无共享环境。
-
公开(公告)号：US6112198A
公开(公告)日：2000-08-29
申请号：US106473
申请日：1998-06-29
申请人： Guy Maring Lohman , Mir Hamid Pirahesh , Eugene Jon Shekita , David E. Simmen , Monica Sachiye Urata
发明人： Guy Maring Lohman , Mir Hamid Pirahesh , Eugene Jon Shekita , David E. Simmen , Monica Sachiye Urata
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30498 , Y10S707/99933
摘要： Query evaluation is optimized using parallel optimization techniques to make repartitioning more efficient. Efficiency is improved by recognizing the possible partitioning requirements for achieving parallelism for a query operation, and by recognizing when the partitioning property of data satisfies the partitioning requirements of a query operation. A data base management system in accordance with the invention uses parallel query processing techniques to optimize data repartitioning, or to avoid it altogether.
摘要翻译： 使用并行优化技术优化查询评估，使重新分区更有效率。 通过识别实现查询操作的并行性的可能的分区要求，以及通过识别数据的分区属性何时满足查询操作的分区要求，可以提高效率。 根据本发明的数据库管理系统使用并行查询处理技术来优化数据重新分区，或者完全避免它们。
-
公开(公告)号：US5960428A
公开(公告)日：1999-09-28
申请号：US919739
申请日：1997-08-28
申请人： Bruce Gilbert Lindsay , Guy Maring Lohman , Mir Hamid Pirahesh , Eugene Jon Shekita , David Everett Simmen , Monica Sachiye Urata
发明人： Bruce Gilbert Lindsay , Guy Maring Lohman , Mir Hamid Pirahesh , Eugene Jon Shekita , David Everett Simmen , Monica Sachiye Urata
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： Unwieldy star/join queries are performed more efficiently using a filtered fact table. Suitable queries include star/join queries with a large fact table joined with multiple subsidiary dimension tables, where indices exist over fact table join columns. The query is analyzed to prepare a query plan for the dimension table accesses. This plan is supplemented by adding nested loop join operations, where the inner table is a dimension table plan and the outer table is an index scan performed over a fact table index of the join column with the dimension table. The plan is also supplemented by filtering records resulting from the nested loop joins using a sequence of dynamic bit vectors, ultimately yielding a list of probable fact table records. The plan is further supplemented by fetching these records to construct a distilled fact which is used, instead of the large original table, to execute the query in considerably less time. If desired, the supplemented query plan and other competing approaches may studied to provide cost estimates, with the least costly approach being actually implemented.
摘要翻译： 使用已过滤的事实表，更有效地执行无故障的星号/连接查询。 合适的查询包括带有多个附属维度表的大型事实表的星号/连接查询，其中索引存在于事实表连接列上。 分析查询以准备维度表访问的查询计划。 此计划通过添加嵌套循环连接操作来补充，其中内部表是维度表计划，外部表是在具有维度表的连接列的事实表索引上执行的索引扫描。 该计划还补充了使用一系列动态位向量的嵌套循环连接过滤记录，最终产生可能的事实表记录的列表。 该计划进一步补充了通过获取这些记录来构建一个使用的蒸馏事实，而不是大的原始表，在相当短的时间内执行查询。 如果需要，可以研究补充的查询计划和其他竞争方法，以提供成本估算，最低成本的方法正在实际实施。
-
5.发明授权公开(公告)号：US06738755B1
公开(公告)日：2004-05-18
申请号：US09516446
申请日：2000-02-29
IPC分类号： G06F1730
CPC分类号： G06F17/30469 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935
摘要： A method, apparatus, and article of manufacture for incrementally estimating the cardinality of a derived relation when statistically correlated predicates are applied. A plurality of query execution plans (QEPs) are generated for the query. During the generation of the QEPs, a cardinality is computed for any of the QEPs in which two or more predicates are correlated to each other. The cardinality comprises a number of rows expected to be returned by the QEP and is computed in an incremental fashion for each operator of the QEP. The computations include calculations that may be done prior to the generation of the QEPs and calculations that are necessarily done as each operator of a QEP is added to that QEP. Thereafter, one of the QEPs is chosen to satisfy the query in a manner that minimizes an estimated cost metric, wherein the cost metric is computed using the cardinality.
摘要翻译： 当应用统计相关谓词时，用于递增地估计派生关系的基数的方法，装置和制品。 为查询生成多个查询执行计划（QEP）。 在QEP的生成期间，对于其中两个或更多个谓词彼此相关联的任何QEP计算基数。 基数包括预期由QEP返回的多行，并且以递增的方式对QEP的每个运算符进行计算。 计算包括在生成QEP之前可以进行的计算以及当QEP的每个运算符被添加到该QEP时必须完成的计算。 此后，选择一个QEP以使估计成本度量最小化的方式满足查询，其中使用基数来计算成本度量。
-
公开(公告)号：US07925646B2
公开(公告)日：2011-04-12
申请号：US12032838
申请日：2008-02-18
申请人： Dengfeng Gao , Ihab F. Ilyas , Eileen Tien Lin , Guy Maring Lohman , Jun Rao
发明人： Dengfeng Gao , Ihab F. Ilyas , Eileen Tien Lin , Guy Maring Lohman , Jun Rao
CPC分类号： G06F17/30471 , Y10S707/99934 , Y10S707/99935
摘要： A compilation time estimator provides a quantified estimate of the optimizer compilation time for a given query optimizer. The estimator automates the optimizer to choose the right level of optimization in commercial database systems. The estimator reuses an optimizer's join enumerator to obtain actual number of joins, but bypasses plan generation to save estimation overhead, and maintains a small number of interesting physical properties to estimate the number of plans by using a linear regression model. The estimator uses the number of generated plans to estimate query compilation time.
摘要翻译： 编译时间估计器提供给定查询优化器的优化器编译时间的量化估计。 估计器自动优化器在商业数据库系统中选择合适的优化级别。 估计器重用优化器的连接枚举器来获取实际的连接数，但绕过计划生成以节省估计开销，并保留少量有趣的物理属性以通过使用线性回归模型来估计计划数。 估计器使用生成计划的数量来估计查询编译时间。
-
公开(公告)号：US20100257151A1
公开(公告)日：2010-10-07
申请号：US12416208
申请日：2009-04-01
申请人： Guy Maring Lohman , Lin Qiao , Sandeep Tata
发明人： Guy Maring Lohman , Lin Qiao , Sandeep Tata
IPC分类号： G06F17/30
CPC分类号： G06Q10/06 , G06F17/30321 , G06F17/3056
摘要： A common interface to manage heterogeneous databases and develop enterprise class applications is provided. In particular, it is shown that a client-based system and method can: (a) provide a uniform interface for the DBA or the application developer to use across all the database deployments, (b) provide flexibility in the number and kinds of scenarios it can be used, and finally (c) reduce the total cost of ownership for the enterprise.
摘要翻译： 提供了管理异构数据库和开发企业级应用程序的通用界面。 特别地，显示基于客户端的系统和方法可以：（a）为DBA或应用程序开发人员提供统一的接口，以便在所有数据库部署中使用，（b）在场景数量和种类方面提供灵活性 可以使用，最后（c）降低企业的总体拥有成本。
-
公开(公告)号：US07636735B2
公开(公告)日：2009-12-22
申请号：US11206978
申请日：2005-08-19
IPC分类号： G06F17/30
CPC分类号： G06F17/30935 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935 , Y10S707/99945 , Y10S707/99948
摘要： Provided is a method for modeling the cost of XML as well as relational operators. As with traditional relational cost estimation, a set of system catalog statistics that summarizes the XML data is exploited; however, the novel use of a set of simple path statistics is also proposed. A new statistical learning technique called transform regression is utilized instead of detailed analytical models to predict the overall cost of an operator. Additionally, a query optimizer in a database is enabled to be self-tuning, automatically adapting to changes over time in the query workload and in the system environment.
摘要翻译： 提供了一种用于建模XML成本以及关系运算符的方法。 与传统的关系成本估算一样，利用了一套总结XML数据的系统目录统计数据; 然而，还提出了一组简单路径统计学的新颖使用。 使用称为变换回归的新的统计学习技术，而不是详细的分析模型来预测运营商的整体成本。 另外，数据库中的查询优化器可以自我调整，自动适应查询工作负载和系统环境中随时间的变化。
-
9.发明申请SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT FOR PROGRESSIVE QUERY PROCESSING 失效系统，方法和计算机程序产品进行查询处理公开(公告)号：US20080177722A1
公开(公告)日：2008-07-24
申请号：US11940185
申请日：2007-11-14
申请人： Guy Maring Lohman , Marki Volker , Mir Hamid Pirahesh , Vijayshankar Raman , David Everett Simmen
发明人： Guy Maring Lohman , Marki Volker , Mir Hamid Pirahesh , Vijayshankar Raman , David Everett Simmen
IPC分类号： G06F17/30
CPC分类号： G06F17/30979 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method, system, and computer program product to make query processing more robust in the face of optimization errors. The invention validates the statistics and assumptions used for compiling a query as the query is executed and, when necessary, progressively re-optimizes the query in mid-execution based on the knowledge learned during its partial execution. The invention selectively places a number of CHECK operators in a query execution plan to validate the optimizer's cardinality estimates against actual cardinalities. Errors beyond a threshold trigger re-optimization, and the optimizer decides whether the old plan is still optimal and whether to re-use previously computed results. The invention addresses arbitrary SQL queries whose plans can contain sub-queries, updates, trigger checking, and view maintenance operations. The invention can handle concurrent update transactions or updates of common sub-expressions in a query execution plan without compromising consistency and isolation as locking information is tied to the record ID.
摘要翻译： 一种方法，系统和计算机程序产品，使查询处理在面对优化错误时更加鲁棒。 本发明验证了在执行查询时用于编译查询的统计和假设，并且在必要时，根据在其部分执行期间学到的知识，在中间执行中逐渐重新优化查询。 本发明选择性地将多个CHECK运算符放置在查询执行计划中以根据实际基数验证优化器的基数估计。 超出阈值的错误触发重新优化，优化器决定旧计划是否仍然最优，以及是否重新使用先前计算的结果。 本发明解决任意SQL查询，其计划可以包含子查询，更新，触发器检查和查看维护操作。 本发明可以处理查询执行计划中的并发更新事务或公用子表达式的更新，而不会在锁定信息与记录ID相关联的情况下不影响一致性和隔离。
-
10.发明授权System, method, and computer program product for progressive query processing 失效系统，方法和计算机程序产品，用于逐行查询处理公开(公告)号：US07716215B2
公开(公告)日：2010-05-11
申请号：US11940185
申请日：2007-11-14
申请人： Guy Maring Lohman , Marki Volker , Mir Hamid Pirahesh , Vijayshankar Raman , David Everett Simmen
发明人： Guy Maring Lohman , Marki Volker , Mir Hamid Pirahesh , Vijayshankar Raman , David Everett Simmen
IPC分类号： G06F7/00
CPC分类号： G06F17/30979 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method, system, and computer program product to make query processing more robust in the face of optimization errors. The invention validates the statistics and assumptions used for compiling a query as the query is executed and, when necessary, progressively re-optimizes the query in mid-execution based on the knowledge learned during its partial execution. The invention selectively places a number of CHECK operators in a query execution plan to validate the optimizer's cardinality estimates against actual cardinalities. Errors beyond a threshold trigger re-optimization, and the optimizer decides whether the old plan is still optimal and whether to re-use previously computed results. The invention addresses arbitrary SQL queries whose plans can contain sub-queries, updates, trigger checking, and view maintenance operations. The invention can handle concurrent update transactions or updates of common sub-expressions in a query execution plan without compromising consistency and isolation as locking information is tied to the record ID.
摘要翻译： 一种方法，系统和计算机程序产品，使查询处理在面对优化错误时更加鲁棒。 本发明验证了在执行查询时用于编译查询的统计和假设，并且在必要时，根据在其部分执行期间学到的知识逐渐重新优化中间执行中的查询。 本发明选择性地将多个CHECK运算符放置在查询执行计划中以根据实际基数验证优化器的基数估计。 超出阈值的错误触发重新优化，优化器决定旧计划是否仍然最优，以及是否重新使用先前计算的结果。 本发明解决任意SQL查询，其计划可以包含子查询，更新，触发器检查和查看维护操作。 本发明可以处理查询执行计划中的并发更新事务或公用子表达式的更新，而不会在锁定信息与记录ID相关联的情况下不影响一致性和隔离。
-
-
-
-
-
-
-
-
-
搜索结果
33 条记录 (耗时 0.027 秒)