公开(公告)号：US07076508B2

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

申请号：US10217707

申请日：2002-08-12

申请人： Serge Bourbonnais ,  Elizabeth Belva Hamel ,  Bruce G. Lindsay ,  Chengfei Liu ,  Jens Stankiewitz ,  Tuong Chanh Truong

发明人： Serge Bourbonnais ,  Elizabeth Belva Hamel ,  Bruce G. Lindsay ,  Chengfei Liu ,  Jens Stankiewitz ,  Tuong Chanh Truong

IPC分类号： G06F17/30

CPC分类号： G06F17/30377 ,  G06F11/1471 ,  Y10S707/99942 ,  Y10S707/99953

摘要： Provided are a method, system, and program for merging independent log entries in a multiple node shared nothing DBMS. Initially, log entries from multiple log entries are combined to form a single log entry sequence. Local transactions are generated from the single log entry sequence and stored in a local transactions structure. In particular, log entries with the same local transaction identifier form a local transaction. Then, local transactions having the same global identifier are merged to form global transactions.

摘要翻译： 提供了一种方法，系统和程序，用于合并多个节点中的独立日志条目，不共享DBMS。 最初，来自多个日志条目的日志条目被组合以形成单个日志条目序列。 本地事务从单个日志条目序列生成并存储在本地事务结构中。 特别地，具有相同本地事务标识符的日志条目形成本地事务。 然后，具有相同全局标识符的本地事务被合并以形成全局事务。

公开(公告)号：US06529896B1

公开(公告)日：2003-03-04

申请号：US09506471

申请日：2000-02-17

申请人： Ting Yu Leung ,  Tuong Chanh Truong ,  Monica Sachiye Urata

发明人： Ting Yu Leung ,  Tuong Chanh Truong ,  Monica Sachiye Urata

IPC分类号： G06F1730

CPC分类号： G06F17/30451 ,  G06F17/30463 ,  Y10S707/99932

摘要： An optimization technique for SQL queries, a program storage device storing the optimization program, and an apparatus for optimizing a query is provided. A query is analyzed to determine whether it includes the WHERE clause which contains an “EXISTS” subquery and a “NOT EXISTS” subquery, or EXISTS-equivalent subqueries, in Boolean factor. If so, the subsumption test is performed on two subqueries. Then, the compensation predicate is applied to one of them, to perform the QGM transformation of the query. One subquery block is stacked on top of the other subquery block, in order to eliminate one subquery. This procedure allows the transformed query to perform more efficiently than the original query while providing same results. The query is then executed in the computer to efficiently retrieve data from the relational database.

摘要翻译： 提供了一种用于SQL查询的优化技术，存储优化程序的程序存储设备以及用于优化查询的设备。 分析查询以确定它是否包含WHERE子句，其中包含“EXISTS”子查询和“NOT EXISTS”子查询，或EXISTS等效的子查询（Boolean factor）。 如果是这样，则在两个子查询上执行包含测试。 然后，将补偿谓词应用于其中一个，执行查询的QGM转换。 一个子查询块堆叠在另一个子查询块的顶部，以消除一个子查询。 此过程允许转换的查询执行比原始查询更高效，同时提供相同的结果。 然后在计算机中执行查询以有效地从关系数据库检索数据。

公开(公告)号：US6032143A

公开(公告)日：2000-02-29

申请号：US206194

申请日：1998-12-04

申请人： Ting Yu Leung ,  Alex Chak-tsang Lui ,  Mir Hamid Pirahesh ,  Tuong Chanh Truong

发明人： Ting Yu Leung ,  Alex Chak-tsang Lui ,  Mir Hamid Pirahesh ,  Tuong Chanh Truong

IPC分类号： G06F17/30

CPC分类号： G06F17/30463 ,  G06F17/30451 ,  G06F17/30545 ,  Y10S707/99932

摘要： A relational data base management system includes a query processor that permits consideration of alternative query plans by the query optimizer so one table can be sent to a selected network location for subquery evaluation in consideration of maximum processing efficiency. Subqueries are converted from "predicate push-down" form to scalar subqueries, enabling upper tables to be sent to nodes of lower tables and vice versa, thereby permitting selection of the node direction depending on the least cost alternative. The optimizer of the query processor is presented with rewritten query code that permits more than one alternative for sending tables for evaluation. The optimizer evaluates the alternatives permitted by the rewritten code, determines the optimal plan for each alternative, and selects the least-cost plan from among the plans evaluated. Thus, the optimizer can decide to send an outer table to where a subquery table is located, or can decide to send a subquery table to where an outer table is located, depending on which is more efficient.

摘要翻译： 关系数据库管理系统包括查询处理器，其允许由查询优化器考虑替代查询计划，因此考虑到最大处理效率，可以将一个表发送到所选网络位置进行子查询评估。 子查询从“谓词下推”形式转换为标量子查询，使得上表可以发送到下表的节点，反之亦然，从而允许根据最低成本替代方案选择节点方向。 查询处理器的优化器被呈现为重写的查询代码，其允许用于发送表进行评估的多个替代方案。 优化器评估重写代码允许的替代方案，确定每个替代方案的最佳计划，并从评估的计划中选择最低成本计划。 因此，优化器可以决定将外部表发送到子查询表所在的位置，或者可以决定将子查询表发送到外部表所在的位置，具体取决于哪个更有效。

公开(公告)号：US5864840A

公开(公告)日：1999-01-26

申请号：US884697

申请日：1997-06-30

申请人： Ting Yu Leung ,  Alex Chak-tsang Lui ,  Mir Hamid Pirahesh ,  Tuong Chanh Truong

发明人： Ting Yu Leung ,  Alex Chak-tsang Lui ,  Mir Hamid Pirahesh ,  Tuong Chanh Truong

IPC分类号： G06F17/30

CPC分类号： G06F17/30463 ,  G06F17/30451 ,  G06F17/30545 ,  Y10S707/99932

摘要： A relational data base management system includes a query processor that permits consideration of alternative query plans by the query optimizer so one table can be sent to a selected network location for subquery evaluation in consideration of maximum processing efficiency. Subqueries are converted from "predicate push-down" form to scalar subqueries, enabling upper tables to be sent to nodes of lower tables and vice versa, thereby permitting selection of the node direction depending on the least cost alternative. The optimizer of the query processor is presented with rewritten query code that permits more than one alternative for sending tables for evaluation. The optimizer evaluates the alternatives permitted by the rewritten code, determines the optimal plan for each alternative, and selects the least-cost plan from among the plans evaluated. Thus, the optimizer can decide to send an outer table to where a subquery table is located, or can decide to send a subquery table to where an outer table is located, depending on which is more efficient.

公开(公告)号：US06625593B1

公开(公告)日：2003-09-23

申请号：US09395771

申请日：1999-09-13

申请人： Ting Yu Leung ,  Mir Hamid Pirahesh ,  David E. Simmen ,  Tuong Chanh Truong

发明人： Ting Yu Leung ,  Mir Hamid Pirahesh ,  David E. Simmen ,  Tuong Chanh Truong

IPC分类号： G06F1730

CPC分类号： G06F17/30445 ,  Y10S707/99932 ,  Y10S707/99934

摘要： A method, apparatus, and article of manufacture for optimizing database queries. The query is analyzed to determine whether at least a portion of the query can be evaluated using a plurality of parallel operations without data redistribution. If so, then the most efficient query execution plan that uses these parallel operations is constructed and executed.

摘要翻译： 用于优化数据库查询的方法，装置和制品。 分析查询以确定是否可以使用多个并行操作来评估查询的至少一部分而没有数据重新分配。 如果是这样，则构建并执行使用这些并行操作的最有效的查询执行计划。

公开(公告)号：US07552119B2

公开(公告)日：2009-06-23

申请号：US11613757

申请日：2006-12-20

申请人： Edison Lao Ting ,  Tuong Chanh Truong

发明人： Edison Lao Ting ,  Tuong Chanh Truong

IPC分类号： G06F17/30

CPC分类号： G06F17/30938 ,  Y10S707/99936 ,  Y10S707/99943

摘要： An apparatus and method are disclosed for skipping XML index scans with common ancestors of a previously failed predicate. An XML index is scanned by an XML index scan to filter entries of the index matching at least one search value (predicate) of an XML query. When the XML index scan finds a matching entry, the entry is passed to an XPath evaluation component. The XPath evaluation component evaluates the entry against remaining predicates of the XML query for further qualification. When the XPath evaluation component disqualifies an entry, the XPath evaluation component provides feedback to the XML index scan to skip remaining entries comprising a common ancestor of the disqualified entry's path. The XML index scan can then efficiently skip index entries that will not qualify against the XML query.

摘要翻译： 公开了一种用于跳过具有先前故障谓词的共同祖先的XML索引扫描的装置和方法。 通过XML索引扫描扫描XML索引，以过滤与XML查询的至少一个搜索值（谓词）匹配的索引的条目。 当XML索引扫描找到匹配的条目时，该条目将传递给XPath评估组件。 XPath评估组件根据XML查询的剩余谓词评估条目以进一步验证。 当XPath评估组件取消条目资格时，XPath评估组件向XML索引扫描提供反馈，以跳过包含不合格条目路径的共同祖先的剩余条目。 然后，XML索引扫描可以有效地跳过不符合XML查询条件的索引条目。

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

公开(公告)号：US6085189A

公开(公告)日：2000-07-04

申请号：US304024

申请日：1999-05-03

申请人： Mir Hamid Pirahesh ,  David E. Simmen ,  Tuong Chanh Truong

发明人： Mir Hamid Pirahesh ,  David E. Simmen ,  Tuong Chanh Truong

IPC分类号： G06F17/30

CPC分类号： G06F17/3041 ,  G06F17/30365 ,  G06F17/30424 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99935

摘要： A database system and method provide support for a positioned data set modification operation on a collection of data sets involved in a data set query operation, in which the data set modification operation is based on the position of a query execution iterator. At query compile time, the database system generates an iterator position retrieval function and a data set modification function for each data set involved in the query operation. At query execution time, the database system invokes each of the iterator retrieval functions until the iterator position retrieval function for a current open data set returns the current the position of the query execution iterator on that data set. The database system then invokes each of the data set modification functions until the data set modification function for the current open data set performs a data set modification operation at the current position of the query execution iterator specified by the iterator position retrieval function. The system and method may be implemented on single node systems and on multi-node shared-nothing parallelism architectures.

摘要翻译： 数据库系统和方法提供了对数据集查询操作中涉及的数据集合的定位数据集修改操作的支持，其中数据集修改操作基于查询执行迭代器的位置。 在查询编译时，数据库系统为查询操作中涉及的每个数据集生成迭代器位置检索功能和数据集修改功能。 在查询执行时，数据库系统调用每个迭代器检索函数，直到当前打开的数据集的迭代器位置检索函数返回当前查询执行迭代器在该数据集上的位置。 数据库系统然后调用每个数据集修改功能，直到当前打开的数据集的数据集修改功能在迭代器位置检索功能指定的查询执行迭代器的当前位置执行数据集修改操作。 系统和方法可以在单节点系统和多节点无共享平行架构上实现。

公开(公告)号：US5960426A

公开(公告)日：1999-09-28

申请号：US884246

申请日：1997-06-30

申请人： Mir Hamid Pirahesh ,  David E. Simmen ,  Tuong Chanh Truong

发明人： Mir Hamid Pirahesh ,  David E. Simmen ,  Tuong Chanh Truong

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

CPC分类号： G06F17/3041 ,  G06F17/30365 ,  G06F17/30424 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99935

摘要： A database system and method provide support for a positioned data set modification operation on a collection of data sets involved in a data set query operation, in which the data set modification operation is based on the position of a query execution iterator. At query compile time, the database system generates an iterator position retrieval function and a data set modification function for each data set involved in the query operation. At query execution time, the database system invokes each of the iterator retrieval functions until the iterator position retrieval function for a current open data set returns the current the position of the query execution iterator on that data set. The database system then invokes each of the data set modification functions until the data set modification function for the current open data set performs a data set modification operation at the current position of the query execution iterator specified by the iterator position retrieval function. The system and method may be implemented on single node systems and on multi-node shared-nothing parallelism architectures.

摘要翻译： 数据库系统和方法提供了对数据集查询操作中涉及的数据集合的定位数据集修改操作的支持，其中数据集修改操作基于查询执行迭代器的位置。 在查询编译时，数据库系统为查询操作中涉及的每个数据集生成迭代器位置检索功能和数据集修改功能。 在查询执行时，数据库系统调用每个迭代器检索函数，直到当前打开的数据集的迭代器位置检索函数返回当前查询执行迭代器在该数据集上的位置。 数据库系统然后调用每个数据集修改功能，直到当前打开的数据集的数据集修改功能在迭代器位置检索功能指定的查询执行迭代器的当前位置执行数据集修改操作。 系统和方法可以在单节点系统和多节点无共享平行架构上实现。

公开(公告)号：US20080154893A1

公开(公告)日：2008-06-26

申请号：US11613757

申请日：2006-12-20

申请人： Edison Lao Ting ,  Tuong Chanh Truong

发明人： Edison Lao Ting ,  Tuong Chanh Truong

IPC分类号： G06F17/30

CPC分类号： G06F17/30938 ,  Y10S707/99936 ,  Y10S707/99943

摘要： An apparatus and method are disclosed for skipping XML index scans with common ancestors of a previously failed predicate. An XML index is scanned by an XML index scan to filter entries of the index matching at least one search value (predicate) of an XML query. When the XML index scan finds a matching entry, the entry is passed to an XPath evaluation component. The XPath evaluation component evaluates the entry against remaining predicates of the XML query for further qualification. When the XPath evaluation component disqualifies an entry, the XPath evaluation component provides feedback to the XML index scan to skip remaining entries comprising a common ancestor of the disqualified entry's path. The XML index scan can then efficiently skip index entries that will not qualify against the XML query.

摘要翻译： 公开了一种用于跳过具有先前故障谓词的共同祖先的XML索引扫描的装置和方法。 通过XML索引扫描扫描XML索引，以过滤与XML查询的至少一个搜索值（谓词）匹配的索引的条目。 当XML索引扫描找到匹配的条目时，该条目将传递给XPath评估组件。 XPath评估组件根据XML查询的剩余谓词评估条目以进一步验证。 当XPath评估组件取消条目资格时，XPath评估组件向XML索引扫描提供反馈，以跳过包含不合格条目路径的共同祖先的剩余条目。 然后，XML索引扫描可以有效地跳过不符合XML查询条件的索引条目。