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

1. 发明授权

US5797000A Method of performing a parallel relational database query in a multiprocessor environment 失效
标题翻译：在多处理器环境中执行并行关系数据库查询的方法
公开(公告)号：US5797000A
公开(公告)日：1998-08-18
申请号：US667056
申请日：1996-06-20
申请人： Partha Pratim Bhattacharya , Jen-Yao Chung , Mir Hamid Pirahesh , Patricia G. Selinger , Marisa S. Viveros , Yun Wang , Lawrence Peter Zaino
发明人： Partha Pratim Bhattacharya , Jen-Yao Chung , Mir Hamid Pirahesh , Patricia G. Selinger , Marisa S. Viveros , Yun Wang , Lawrence Peter Zaino
IPC分类号： G06F17/30
CPC分类号： G06F17/30463 , G06F17/30445 , Y10S707/99932
摘要： A method of performing a parallel join operation on a pair of relations R1 and R2 in a system containing P processors organized into Q clusters of P/Q processors each. The system contains disk storage for each cluster, shared by the processors of that cluster, together with a shared intermediate memory (SIM) accessible by all processors. The relations R1 and R2 to be joined are first sorted on the join column. The underlying domain of the join column is then partitioned into P ranges of equal size. Each range is further divided into M subranges of progressively decreasing size to create MP tasks T.sub.m,p, the subranges of a given range being so sized relative to one another that the estimated completion time for task T.sub.m,p is a predetermined fraction that of task T.sub.m-1,p. Tasks T.sub.m,p with larger time estimates are assigned (and the corresponding tuples shipped) to the cluster to which processor p belongs, while tasks with smaller time estimates are assigned to the SIM, which is regarded as a universal cluster (cluster 0). The actual task-to-processor assignments are determined dynamically during the join phase in accordance with the dynamic longest processing time first (DLPT) algorithm. Each processor within a cluster picks its next task at any given decision point to be the one with the largest time estimate which is owned by that cluster or by cluster 0.
摘要翻译：在包含P个处理器的系统中对一对关系R1和R2执行并行连接操作的方法，所述P个处理器分组为Q个P / Q处理器群。该系统包含每个集群的磁盘存储，由该集群的处理器共享，以及可由所有处理器访问的共享中间存储器（SIM）。要连接的关系R1和R2首先在连接列上排序。然后将连接列的基础域分成相同大小的P范围。每个范围进一步分为逐渐减小的M个子范围以创建MP任务Tm，p，给定范围的子范围相对于彼此大小相对于任务Tm的估计完成时间，p是任务的预定分数 Tm-1，p。将具有较大时间估计值的任务Tm，p（和相应的元组发货）分配给处理器p所属的集群，而具有较小时间估计的任务被分配给被认为是通用集群（集群0）的SIM。根据动态最长处理时间优先（DLPT）算法，在连接阶段期间动态确定实际的任务到处理器分配。集群内的每个处理器在任何给定的决策点选择其下一个任务，作为拥有该集群或集群0的最大时间估计值。

2. 发明授权

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不被覆盖时。赔偿通过无效和最佳匹配执行。可以随时合并和执行多重补偿。

3. 发明授权

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.
摘要翻译：公开了一种用于支持分布式数据库环境中的汇总表的系统，方法和制品。该系统通常包括可以是异构的中央程序和多个远程数据库系统。中央程序被配置为与数据库系统进行通信，并且支持中央程序内或在一个或多个数据库系统内的汇总表（也称为物化视图）。汇总表可能包含来自一个或多个数据库系统的汇总数据。中央程序可以启动汇总表的生成，其可以在中央程序本地填充或本地地填充到一个或多个数据库系统。中央程序还可以维护或协调汇总表的维护。此外，中央程序可以被配置为在一个或多个数据库系统上接收用户查询，并且基于用户查询来生成优化的查询计划，在这样做时，总结表。

4. 发明授权

US6112198A Optimization of data repartitioning during parallel query optimization 失效
标题翻译：并行查询优化中数据重分区的优化
公开(公告)号：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.
摘要翻译：使用并行优化技术优化查询评估，使重新分区更有效率。通过识别实现查询操作的并行性的可能的分区要求，以及通过识别数据的分区属性何时满足查询操作的分区要求，可以提高效率。根据本发明的数据库管理系统使用并行查询处理技术来优化数据重新分区，或者完全避免它们。

5. 发明授权

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区域”的分区。这些分区可以将操作强制到单节点，协调器节点，目录节点或多个节点或节点组上的特定分区类。

6. 发明授权

US5963933A Efficient implementation of full outer join and anti-join 失效
标题翻译：高效实施全外连接和反连接
公开(公告)号：US5963933A
公开(公告)日：1999-10-05
申请号：US882027
申请日：1997-06-25
申请人： Josephine M. Cheng , Ting Yu Leung , Mir Hamid Pirahesh
发明人： Josephine M. Cheng , Ting Yu Leung , Mir Hamid Pirahesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30454 , G06F17/30471 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99943
摘要： Method for specifying SQL "full outer joins" which enables the use of arbitrary join conditions in specifying the query. This is enabled by equating a full outer join with a left outer join unioned with a right outer join less the matched tuples from the right outer join. A number of embodiments further present improvements in execution speed. One such improvement utilizes as a second operand of the union query a novel operator, the "ANTI-JOIN". The anti-join is implemented as a right outer join coupled with an ISNULL predicate.
摘要翻译：用于指定SQL“完全外连接”的方法，它可以在指定查询时使用任意连接条件。这可以通过将一个完整的外连接与一个右外联接的左外连接相等，从右外连接减去匹配的元组。许多实施例还提供了执行速度的改进。一个这样的改进利用作为联合查询的第二操作数，一个新的运算符“ANTI-JOIN”。反连接被实现为与ISNULL谓词耦合的右外连接。

7. 发明授权

US08326847B2 Graph search system and method for querying loosely integrated data 失效
标题翻译：用于查询松散集成数据的图形搜索系统和方法
公开(公告)号：US08326847B2
公开(公告)日：2012-12-04
申请号：US12053597
申请日：2008-03-22
申请人： Andrey Balmin , Heasoo Hwang , Mir Hamid Pirahesh , Berthold Reinwald
发明人： Andrey Balmin , Heasoo Hwang , Mir Hamid Pirahesh , Berthold Reinwald
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30395 , G06F17/30554
摘要： A system, method and computer program product for executing a query on linked data sources. Embodiments of the invention generate an instance graph expressing relationships between objects in the linked data sources and receive a query including at least first and second search terms. The first search term is then executed on the instance graph and a summary graph is generated using the results of the executing step. A second search term is then executed on the summary graph.
摘要翻译：一种用于执行链接数据源查询的系统，方法和计算机程序产品。本发明的实施例生成表示链接的数据源中的对象之间的关系并且接收包括至少第一和第二搜索项的查询的实例图。然后在实例图上执行第一个搜索项，并使用执行步骤的结果生成汇总图。然后在摘要图上执行第二个搜索项。

8. 发明申请

US20110184933A1 JOIN ALGORITHMS OVER FULL TEXT INDEXES 失效
标题翻译：在完整的文本索引上加入算法
公开(公告)号：US20110184933A1
公开(公告)日：2011-07-28
申请号：US12696013
申请日：2010-01-28
申请人： Latha Sankar Colby , Quanzhong Li , Fatma Ozcan , Mir Hamid Pirahesh , Eugene J. Shekita , Zografoula Vagena
发明人： Latha Sankar Colby , Quanzhong Li , Fatma Ozcan , Mir Hamid Pirahesh , Eugene J. Shekita , Zografoula Vagena
IPC分类号： G06F17/30
CPC分类号： G06F17/30498
摘要： According to one embodiment of the present invention, a method for processing join predicates in full-text indexes is provided. The method includes evaluating local predicates of an outer full text index to generate a first posting list of documents. For each document in the first posting list, the value of a join attribute is determined and an inner full text index is probed to obtain a second posting list of documents containing one of the join attributes determined for each document. Local predicates of an inner full text index are evaluated to generate a third posting list of documents, and the second posting list is merged with the third posting list to generate a merge list of documents. Documents in the first posting list may be paired up with documents in the merge list.
摘要翻译：根据本发明的一个实施例，提供了一种用于处理全文索引中的连接谓词的方法。该方法包括评估外部全文本索引的本地谓词以生成文档的第一张贴列表。对于第一个发布列表中的每个文档，确定连接属性的值，并探测内部全文索引以获取包含为每个文档确定的连接属性之一的文档的第二个发布列表。评估内部全文本索引的本地谓词以生成文档的第三张发布列表，并且将第二张发布列表与第三张发布列表合并以生成文档的合并列表。第一个发布列表中的文档可能与合并列表中的文档配对。

9. 发明授权

US07240078B2 Method, system, and program for query optimization with algebraic rules 失效
标题翻译：用代数规则进行查询优化的方法，系统和程序
公开(公告)号：US07240078B2
公开(公告)日：2007-07-03
申请号：US10721802
申请日：2003-11-25
申请人： Qi Cheng , Mir Hamid Pirahesh , Yang Sun , Calisto Paul Zuzarte
发明人： Qi Cheng , Mir Hamid Pirahesh , Yang Sun , Calisto Paul Zuzarte
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , Y10S707/99933 , Y10S707/99954
摘要： A query is matched to an outlier materialized query table that stores exception data. The query is searched for a source predicate. An outlier predicate in the outlier materialized query table that corresponds to the source predicate is searched for a target column that corresponds to a source column in the source predicate. A new range predicate is derived based on the target column and introduced into the query, wherein the query is executed to retrieve data from one or more data stores.
摘要翻译：查询与存储异常数据的异常值物化查询表进行匹配。查询查询源谓词。搜索与源谓词对应的离群物质化查询表中的异常谓词，找出与源谓词中的源列相对应的目标列。基于目标列导出新的范围谓词并将其引入到查询中，其中执行查询以从一个或多个数据存储中检索数据。

10. 发明授权

US06847962B1 Analyzing, optimizing and rewriting queries using matching and compensation between query and automatic summary tables 有权
标题翻译：使用查询和自动汇总表之间的匹配和补偿来分析，优化和重写查询
公开(公告)号：US06847962B1
公开(公告)日：2005-01-25
申请号：US09502821
申请日：2000-02-11
申请人： Roberta Jo Cochrane , George Lapis , Ting Yu Leung , Mark A. Paskin , Mir Hamid Pirahesh , Yang Sun , Monica Sachiye Urata , Markos Zaharioudakis
发明人： Roberta Jo Cochrane , George Lapis , Ting Yu Leung , Mark A. Paskin , Mir Hamid Pirahesh , Yang Sun , Monica Sachiye Urata , Markos Zaharioudakis
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30457 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method, apparatus, and article of manufacture for optimizing database queries using a derived summary table, wherein a definition of the summary table is based on a full select statement, including, but not limited to, a derived table involving nested GROUP BY operations and complex HAVING clauses with subqueries or joins, that is materialized in the table and describes how the summary table was derived. A query is analyzed using matching/compensation tests between the query and the definition of the summary table (that is, a query by itself) to determine whether expressions occurring anywhere in the query, but not in the summary table, can be derived using either the content in the summary table alone, or after combining (through some relational operator) the content of the summary table with other base tables, and hence the query is subsumed by or overlaps with the summary table definition.
摘要翻译：一种用于使用导出的摘要表优化数据库查询的方法，装置和制品，其中所述汇总表的定义基于完整的选择语句，包括但不限于涉及嵌套的GROUP BY操作的导出表，以及具有子查询或联接的复杂HAVING子句，在表中实现，并描述了汇总表的派生方式。使用查询和汇总表的定义（即自身的查询）之间的匹配/补偿测试来分析查询，以确定查询中任何地方（而不是摘要表中）中发生的表达式是否可以使用汇总表中的内容，或者通过一些关系运算符将汇总表的内容与其他基表合并，因此该查询被归纳或与汇总表定义重叠。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式