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

1. 发明授权

US6081801A Shared nothing parallel execution of procedural constructs in SQL 失效
标题翻译：在SQL中并不执行任何程序结构
公开(公告)号：US6081801A
公开(公告)日：2000-06-27
申请号：US885479
申请日：1997-06-30
申请人： Roberta Jo Cochrane , George Lapis , Mir Hamid Pirahesh , Richard Sefton Sidle , David Everett Simmen , Tuong Chanh Truong , Monica Sachiye Urata
发明人： Roberta Jo Cochrane , George Lapis , Mir Hamid Pirahesh , Richard Sefton Sidle , David Everett Simmen , Tuong Chanh Truong , Monica Sachiye Urata
IPC分类号： G06F17/30 , G06Q10/04 , G06F17/00
CPC分类号： G06Q10/04 , G06F17/30433 , G06F17/30445 , Y10S707/99933 , Y10S707/99938 , Y10S707/99952
摘要： An automated methodology, and an apparatus for practicing the methodology, which enables the power and flexibility inherent in shared nothing parallel database systems (MPP) to be utilized on complex queries which have, heretofore, contained query elements requiring local computation or local coordination of data computation performed across the nodes of the distributed system. The present invention provides these features and advantages by identifying and marking the subgraphs containing these types of query elements as "no TQ zones" in the preparation phase prior to optimization. When the optimizer sees the markings, it builds a plan that will force the computation of the marked subgraphs to be in the same section. This preparation phase also provides the partitioning information for all inputs to the "no TQ zones". This allows the bottom-up optimizer to correctly plan the partitioning for the "no TQ zones". These partitionings can force the operation to a single-node, the coordinator node, the catalog node, or to a particular partition class on multiple nodes, or nodegroups.
摘要翻译：一种自动化方法和一种用于实践该方法的装置，其使得无共享并行数据库系统（MPP）中固有的功能和灵活性能够用于复杂查询，其以前包含需要本地计算或数据的本地协调的查询元素在分布式系统的节点上进行计算。本发明通过在优化之前的准备阶段中将包含这些类型的查询元素的子图识别和标记为“无TQ区”来提供这些特征和优点。当优化器看到标记时，它建立一个计划，强制计算标记的子图在同一部分。此准备阶段还提供“无TQ区域”的所有输入的分区信息。这允许自下而上优化器正确地计划“无TQ区域”的分区。这些分区可以将操作强制到单节点，协调器节点，目录节点或多个节点或节点组上的特定分区类。

2. 发明授权

US5960428A Star/join query optimization 失效
标题翻译：星号/加入查询优化
公开(公告)号：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.
摘要翻译：使用已过滤的事实表，更有效地执行无故障的星号/连接查询。合适的查询包括带有多个附属维度表的大型事实表的星号/连接查询，其中索引存在于事实表连接列上。分析查询以准备维度表访问的查询计划。此计划通过添加嵌套循环连接操作来补充，其中内部表是维度表计划，外部表是在具有维度表的连接列的事实表索引上执行的索引扫描。该计划还补充了使用一系列动态位向量的嵌套循环连接过滤记录，最终产生可能的事实表记录的列表。该计划进一步补充了通过获取这些记录来构建一个使用的蒸馏事实，而不是大的原始表，在相当短的时间内执行查询。如果需要，可以研究补充的查询计划和其他竞争方法，以提供成本估算，最低成本的方法正在实际实施。

3. 发明授权

US5873075A Synchronization of SQL actions in a relational database system 失效
标题翻译：在关系数据库系统中同步SQL操作
公开(公告)号：US5873075A
公开(公告)日：1999-02-16
申请号：US884832
申请日：1997-06-30
申请人： Roberta Jo Cochrane , George Lapis , Mir Hamid Pirahesh , Richard Sefton Sidle , David Everett Simmen , Tuong Chanh Truong , Monica Sachiye Urata
发明人： Roberta Jo Cochrane , George Lapis , Mir Hamid Pirahesh , Richard Sefton Sidle , David Everett Simmen , Tuong Chanh Truong , Monica Sachiye Urata
IPC分类号： G06F17/30
CPC分类号： G06F17/30427 , G06F17/30371 , G06F17/30436 , G06F17/30471 , G06F17/3051 , Y10S707/99932
摘要： An automated system for detecting and preventing mutating table violations of database integrity in a SQL query before generation and selection of an optimal query execution plan (QEP). This system modifies the query graph model (QGM) to restrict the choice of execution plans to those that avoid mutating table integrity (MTI) violations, thereby forcing database integrity during table mutation when executing the optimal QEP. Mutating table integrity violations are detected by evaluating the position in the QGM of each write-node referencing a particular base table with respect to each of the positions of all other read- and write-nodes referencing of the same base table. Every common-referencing node pair is tested for sequencing conflicts and a data-flow dam is inserted in the QGM where necessary or a poke query is inserted between the nodes to force the completion of the execution of one node before initiating execution of the other common-referencing node. The system of this invention allows processing of all non-cyclic and most cyclic SQL queries known to cause mutating table integrity violations, such as queries having searched and positioned inserts, deletes and updates, and row-level triggers.
摘要翻译：一种用于在生成和选择最优查询执行计划（QEP）之前，在SQL查询中检测和防止突变表违反数据库完整性的自动化系统。该系统修改查询图模型（QGM），将执行计划的选择限制为避免突变表完整性（MTI）违规的选择，从而在执行最佳QEP时强制表突变期间的数据库完整性。通过评估参考相同基准表的所有其他读 - 写节点的每个位置的引用特定基表的每个写节点的QGM中的位置来检测突变表完整性违反。每个公共参考节点对都进行排序冲突测试，并且数据流大坝插入到QGM中，如果需要，或者在节点之间插入一个戳查询，强制完成一个节点的执行，然后再启动另一个常见的执行 - 参考节点。本发明的系统允许处理已知导致突变表完整性违例的所有非循环和大多数循环SQL查询，例如具有搜索和定位的插入，删除和更新的查询以及行级触发器。

4. 发明申请

US20080177722A1 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相关联的情况下不影响一致性和隔离。

5. 发明授权

US07185004B1 System and method for reverse routing materialized query tables in a database 有权
标题翻译：数据库中反向路由物化查询表的系统和方法
公开(公告)号：US07185004B1
公开(公告)日：2007-02-27
申请号：US11298853
申请日：2005-12-09
申请人： David Everett Simmen , Mir Hamid Pirahesh
发明人： David Everett Simmen , Mir Hamid Pirahesh
IPC分类号： G06F7/00 , G06F12/00
CPC分类号： G06F17/30457 , Y10S707/99933
摘要： A reverse routing system optimizes execution of a query that accesses data stored in one or more materialized query tables in a database of a computer system. The system receives a query directly referencing the materialized query table. The system identifies the referenced materialized query tables in a catalogue of materialized query tables and a defining query associated with the referenced materialized query table. The system substitutes the defining query for the referenced materialized query table in the received query. The system adds the referenced materialized query table to the set of eligible materialized query tables that are selected using query matching algorithms so that they can be considered for routing by the query optimizer.
摘要翻译：反向路由系统优化访问存储在计算机系统的数据库中的一个或多个物化查询表中的数据的查询的执行。系统接收直接引用物化查询表的查询。系统识别物化查询表目录中的引用物化查询表以及与引用的物化查询表关联的定义查询。系统将定义查询替换为接收到的查询中的引用的实例化查询表。系统将引用的实体化查询表添加到使用查询匹配算法选择的合格物化查询表集合，以便它们可以被查询优化器考虑进行路由选择。

6. 发明授权

US06993516B2 Efficient sampling of a relational database 有权
标题翻译：关系数据库的有效抽样
公开(公告)号：US06993516B2
公开(公告)日：2006-01-31
申请号：US10329892
申请日：2002-12-26
申请人： Peter Jay Haas , Guy Maring Lohman , Mir Hamid Pirahesh , David Everett Simmen , Ashutosh Vir Vikram Singh , Michael Jeffrey Winer , Markos Zaharioudakis
发明人： Peter Jay Haas , Guy Maring Lohman , Mir Hamid Pirahesh , David Everett Simmen , Ashutosh Vir Vikram Singh , Michael Jeffrey Winer , Markos Zaharioudakis
IPC分类号： G06F17/30
CPC分类号： G06F17/30489 , G06F17/30536 , Y10S707/99932 , Y10S707/99936
摘要： A system, method and computer readable medium for sampling data from a relational database are disclosed, where an information processing system chooses rows from a table in a relational database for sampling, wherein data values are arranged into rows, rows are arranged into pages, and pages are arranged into tables. Pages are chosen for sampling according to a probability P and rows in a selected page are chosen for sampling according to a probability R, so that the overall probability of choosing a row for sampling is Q=PR. The probabilities P and R are based on the desired precision of estimates computed from a sample, as well as processing speed. The probabilities P and R are further based on either catalog statistics of the relational database or a pilot sample of rows from the relational database.
摘要翻译：公开了一种用于从关系数据库采样数据的系统，方法和计算机可读介质，其中信息处理系统从用于采样的关系数据库中的表中选择行，其中数据值被排列成行，行被排列成页，并且页面排列成表。根据概率P选择页面进行采样，并根据概率R选择所选页面中的行进行采样，以便选择采样行的总体概率为Q = PR。概率P和R基于从样本计算的估计精度以及处理速度。概率P和R进一步基于关系数据库的目录统计数据或来自关系数据库的行的导频样本。

7. 发明授权

US07716215B2 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相关联的情况下不影响一致性和隔离。

8. 发明授权

US07383246B2 System, method, and computer program product for progressive query processing 有权
标题翻译：系统，方法和计算机程序产品，用于逐行查询处理
公开(公告)号：US07383246B2
公开(公告)日：2008-06-03
申请号：US10698828
申请日：2003-10-31
申请人： 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相关联的情况下不影响一致性和隔离。

9. 发明授权

US06665663B2 Outerjoin and antijoin reordering using extended eligibility lists 失效
标题翻译：使用扩展资格清单进行外联和反连接重新排序
公开(公告)号：US06665663B2
公开(公告)日：2003-12-16
申请号：US09809846
申请日：2001-03-15
申请人： Bruce Gilbert Lindsay , Guy Maring Lohman , Mir Hamid Pirahesh , Jun Rao
发明人： Bruce Gilbert Lindsay , Guy Maring Lohman , Mir Hamid Pirahesh , Jun Rao
IPC分类号： G06F1730
CPC分类号： G06F17/30466 , G06F17/30469 , Y10S707/99934
摘要： An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The “without compensation” approach only allows join reorderings that are valid under associative rules. Thus, the optimizer will not combine subplans using a join predicate whose EEL is not covered. The “with compensation” approach allows two subplans to be combined using the join predicate, when a join predicate's EEL is not covered, as long as the join predicate's NEL is covered. Compensation is performed through nullification and best match. Multiple compensations may be merged and performed at any time.
摘要翻译：在关系数据库管理系统（RDBMS）的自下而上优化器中，通过内部联接重新排列外部联结和反联合的优化技术。每个连接谓词与正常资格列表（NEL）相关联，包括在连接谓词中引用的表以及扩展资格列表（EEL），其中包括在冲突的连接谓词中引用的其他表。 EEL包括谓词所需的所有表，以保留原始查询的语义。在连接枚举期间，优化器确定连接谓词的EEL是否是要合并的两个子计划中的所有表的子集，即其EEL被覆盖。如果是这样，则使用连接谓词组合两个子计划。否则，两个子计划不能加入。两种方法用于重新排序：无补偿和补偿。 “无补偿”方法仅允许在关联规则下有效的连接重排序。因此，优化器不会使用不包括EEL的连接谓词来组合子计划。只要连接谓词的NEL被覆盖，“附加补偿”方法允许使用连接谓词组合两个子计划，当连接谓词的EEL不被覆盖时。赔偿通过无效和最佳匹配执行。可以随时合并和执行多重补偿。

10. 发明授权

US06496828B1 Support for summary tables in a heterogeneous database environment 有权
标题翻译：支持异构数据库环境中的汇总表
公开(公告)号：US06496828B1
公开(公告)日：2002-12-17
申请号：US09466862
申请日：1999-12-17
申请人： Roberta Jo Cochrane , James C. Kleewein , Ting Yu Leung , Mir Hamid Pirahesh , Narayana Subramanian , Shivakumar Venkataraman
发明人： Roberta Jo Cochrane , James C. Kleewein , Ting Yu Leung , Mir Hamid Pirahesh , Narayana Subramanian , Shivakumar Venkataraman
IPC分类号： G06R1730
CPC分类号： G06F17/30463 , G06F17/30457 , G06F17/30545 , Y10S707/971 , Y10S707/99933
摘要： A system, method, and article of manufacture for supporting summary tables in a distributed database environment is disclosed. The system generally comprises a central program and a plurality of remote database systems that may be heterogeneous. The central program is configured to communicate with the database systems and to support summary tables (also referred to as materialized views) within the central program or within one or more of the database systems. The summary tables may contain summary data from one or more of the database systems. The central program may initiate the generation of summary tables, which may be populated local to the central program or local to one or more of the database systems. The central program may also maintain or coordinate maintenance of the summary tables. In addition, the central program may be configured to receive user queries on one or more of the database systems and to generate optimized query plans based upon the user queries, considering in so doing, the summary tables.
摘要翻译：公开了一种用于支持分布式数据库环境中的汇总表的系统，方法和制品。该系统通常包括可以是异构的中央程序和多个远程数据库系统。中央程序被配置为与数据库系统进行通信，并且支持中央程序内或在一个或多个数据库系统内的汇总表（也称为物化视图）。汇总表可能包含来自一个或多个数据库系统的汇总数据。中央程序可以启动汇总表的生成，其可以在中央程序本地填充或本地地填充到一个或多个数据库系统。中央程序还可以维护或协调汇总表的维护。此外，中央程序可以被配置为在一个或多个数据库系统上接收用户查询，并且基于用户查询来生成优化的查询计划，在这样做时，总结表。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式