公开(公告)号：US06931390B1

公开(公告)日：2005-08-16

申请号：US09796001

申请日：2001-02-27

申请人： Mohamed Zait ,  Benoit Dageville

发明人： Mohamed Zait ,  Benoit Dageville

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

CPC分类号： G06F17/30312 ,  G06F17/30492 ,  Y10S707/99932 ,  Y10S707/99942

摘要： The present invention is directed to a method and mechanism for partitioning using information not directly located in the object being partitioned. According to an embodiment of the invention, foreign key-primary key relationships are utilized to create join conditions between multiple database tables to implement partitioning of a database object. Also, disclosed are methods and mechanisms to perform partition pruning.

公开(公告)号：US06609131B1

公开(公告)日：2003-08-19

申请号：US09406482

申请日：1999-09-27

申请人： Mohamed Zait ,  Beniot Dageville

发明人： Mohamed Zait ,  Beniot Dageville

IPC分类号： G06F1700

CPC分类号： G06F9/5066 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99938 ,  Y10S707/99943

摘要： Techniques are disclosed for expanding the concept of partitioning in variety of ways. In particular techniques are provided for performing multiple-dimension partitioning. In multiple-dimension partitioning, a database object is divided into partitions based on one criteria, and each of those resulting partitions is divided into sub-partitions based on a second criteria. The process of partitioning partitions based on different criteria may be repeated across any number of dimensions. Entirely different partitioning techniques may be used for each level of partitioning. The database server takes advantage of partitions when processing queries that include joins. In particular, techniques are provided for performing a full parallel partitioned-wise join, and a partial parallel partition-wise join. In a partial parallel partition-wise join, one of the join tables is statically partitioned on the join key and another join table is dynamically partitioned in a way that corresponds to the partition criteria of the statically partitioned table. In a full parallel partition-wise join, both of the tables involved in the join have already been statically partitioned based on the same criteria. The join operation is performed in parallel in a way that takes advantage of that static partitioning.

摘要翻译： 公开了以各种方式扩展划分概念的技术。 特别地，提供了用于执行多维分割的技术。 在多维分区中，基于一个条件将数据库对象划分为分区，并且根据第二准则将所生成的分区中的每一个划分为子分区。 可以跨任何数量的维度重复基于不同标准划分分区的过程。 完全不同的分区技术可用于每个级别的分区。 处理包含连接的查询时，数据库服务器利用分区。 特别地，提供了用于执行完全并行分割连接和部分并行分区连接的技术。 在部分并行分区连接中，其中一个连接表在连接键上静态分区，另一个连接表以与静态分区表的分区标准相对应的方式进行动态分区。 在完全并行的分区连接中，连接中涉及的两个表都已经基于相同的标准进行了静态分区。 连接操作是以利用静态分区的方式并行执行的。

公开(公告)号：US10726010B2

公开(公告)日：2020-07-28

申请号：US13603302

申请日：2012-09-04

申请人： Rafi Ahmed ,  Chun-Chieh Lin ,  Mohamed Zait

发明人： Rafi Ahmed ,  Chun-Chieh Lin ,  Mohamed Zait

IPC分类号： G06F16/2453

摘要： A method, apparatus, and stored instructions are provided for transforming a query representation by unnesting a predicate condition that is based on whether or not a result exists for a subquery of the predicate condition. An initial query representation is received. The initial query representation represents an initial query that includes an EXISTS-equivalent predicate or a NOT-EXISTS-equivalent predicate and at least one other predicate in a disjunction. The initial query representation is transformed into a semantically equivalent transformed query representation that represents a transformed query. The transformed query includes, instead of the EXISTS-equivalent predicate or a NOT-EXISTS-equivalent predicate, a join operator that references the data object. The transformed query representation, when used for execution, causes the at least one other predicate to be applied separately from a join operation caused by the join operator such that execution of the initial representation is semantically equivalent to execution of the transformed representation.

公开(公告)号：US20080010240A1

公开(公告)日：2008-01-10

申请号：US11484108

申请日：2006-07-10

申请人： Mohamed Zait

发明人： Mohamed Zait

IPC分类号： G06F17/30

CPC分类号： G06F17/30463

摘要： Under automated alternate plan analysis, a query optimizer generates candidate execution plans. The candidate execution plans are selected as alternate execution plans for the query and execution. Output describing characteristics of each alternate execution plan and/or its execution is generated and/or compared. From this information, it may be determined, for example, whether results returned by any of the alternate execution plans are the same and whether the least cost execution plan is actually the most efficiently executed.

摘要翻译： 在自动替代计划分析下，查询优化器生成候选执行计划。 选择候选执行计划作为查询和执行的备用执行计划。 生成和/或比较描述每个替代执行计划的特征的输出和/或其执行。 根据该信息，可以例如确定任何替代执行计划返回的结果是否相同以及最低成本执行计划是否实际上是最有效地执行的。

公开(公告)号：US20060182046A1

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

申请号：US11060260

申请日：2005-02-16

申请人： Benoit Dageville ,  Bhaskar Ghosh ,  Rushan Chen ,  Thierry Cruanes ,  Mohamed Zait

发明人： Benoit Dageville ,  Bhaskar Ghosh ,  Rushan Chen ,  Thierry Cruanes ,  Mohamed Zait

IPC分类号： H04L12/16 ,  H04Q11/00

CPC分类号： G06F9/4494

摘要： Techniques are provided for performing a parallel aggregation operation on data that resides in a container, such as a relational table. During generation of the execution plan for the operation, it is determined whether partition-wise aggregation should be performed, based on the grouping keys involved in the aggregation and the partition keys used to partition the container. If partition-wise aggregation is to be performed, then the assignments given to the slave processes that are assigned to scan a container are made on a partition-wise basis. The scan slaves themselves may perform full or partial aggregation (depending on whether they are the only scan slaves assigned to the partition). If the scan slaves perform no aggregation, or only partial aggregation, then the scan slaves redistribute the data items to aggregation slaves that are local to the scan slaves.

摘要翻译： 提供了用于对驻留在诸如关系表的容器中的数据执行并行聚合操作的技术。 在生成操作的执行计划时，基于聚合中涉及的分组密钥和用于分区容器的分区密钥，确定是否应该执行分区聚合。 如果要执行分区聚合，则分配给分配给扫描容器的从属进程的分配是以分区方式进行的。 扫描从站本身可以执行完全或部分聚合（取决于它们是否是分配给分区的唯一扫描从站）。 如果扫描从站不执行聚合或仅执行部分聚合，则扫描从站将数据项重新分配到扫描从站本地的聚合从站。

公开(公告)号：US06665684B2

公开(公告)日：2003-12-16

申请号：US09405980

申请日：1999-09-27

申请人： Mohamed Zait ,  Benoit Dageville ,  Andre Kruglikov ,  Gianfranco Putzolu

发明人： Mohamed Zait ,  Benoit Dageville ,  Andre Kruglikov ,  Gianfranco Putzolu

IPC分类号： G06F1700

CPC分类号： G06F17/3033 ,  G06F17/30333 ,  G06F17/30492 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99942 ,  Y10S707/99943

摘要： Techniques are disclosed for expanding the concept of partitioning in variety of ways. In particular techniques are provided for performing multiple-dimension partitioning. In multiple-dimension partitioning, a database object is divided into partitions based on one criteria, and each of those resulting partitions is divided into sub-partitions based on a second criteria. The process of partitioning partitions based on different criteria may be repeated across any number of dimensions. Entirely different partitioning techniques may be used for each level of partitioning. The database server takes advantage of partitions when processing queries by selectively accessing a subset of partitions on disk or reducing the number of internal join operations.

摘要翻译： 公开了以各种方式扩展划分概念的技术。 特别地，提供了用于执行多维分割的技术。 在多维分区中，基于一个条件将数据库对象划分为分区，并且根据第二准则将所生成的分区中的每一个划分为子分区。 可以跨任何数量的维度重复基于不同标准划分分区的过程。 完全不同的分区技术可用于每个级别的分区。 数据库服务器通过选择性地访问磁盘上的分区子集或减少内部联接操作的数量来处理查询时利用分区。

公开(公告)号：US5737593A

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

申请号：US459018

申请日：1995-06-02

申请人： Rakesh Agrawal ,  Giuseppe Psaila ,  Edward L. Wimmers ,  Mohamed Zait

发明人： Rakesh Agrawal ,  Giuseppe Psaila ,  Edward L. Wimmers ,  Mohamed Zait

IPC分类号： G06F17/30

CPC分类号： G06F17/30548 ,  G06F17/30327 ,  G06F17/30539 ,  Y10S707/99936 ,  Y10S707/99937

摘要： A system and method including a computer shape definition language are disclosed for defining shapes and mining time sequences that resemble the shapes. The system and method include provisions for establishing a user-defined alphabet that in turn establishes a set of elemental shapes. The system also includes simple yet powerful operators for combining the elemental shapes to define a desired time sequence shape. Moreover, intervals of actual time sequences are mapped into corresponding transition sequences using the alphabet, and the transition sequences are stored in a hierarchical index structure for easily accessing the transition sequences. The index structure is entered with the desired time sequence shape, and the index structure is traversed to identify maximal actual transition sequences which conform to the desired time sequence shape, within user-definable blurry criteria.

公开(公告)号：US07877373B2

公开(公告)日：2011-01-25

申请号：US11484108

申请日：2006-07-10

申请人： Mohamed Zait

发明人： Mohamed Zait

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

CPC分类号： G06F17/30463

摘要： Under automated alternate plan analysis, a query optimizer generates candidate execution plans. The candidate execution plans are selected as alternate execution plans for the query and execution. Output describing characteristics of each alternate execution plan and/or its execution is generated and/or compared. From this information, it may be determined, for example, whether results returned by any of the alternate execution plans are the same and whether the least cost execution plan is actually the most efficiently executed.

摘要翻译： 在自动替代计划分析下，查询优化器生成候选执行计划。 选择候选执行计划作为查询和执行的备用执行计划。 生成和/或比较描述每个替代执行计划的特征的输出和/或其执行。 根据该信息，可以例如确定任何替代执行计划返回的结果是否相同以及最低成本执行计划是否实际上是最有效地执行的。

公开(公告)号：US07680761B2

公开(公告)日：2010-03-16

申请号：US10952390

申请日：2004-09-27

申请人： Mohamed Zait ,  Benoit Dageville

发明人： Mohamed Zait ,  Benoit Dageville

IPC分类号： G06F17/30

CPC分类号： G06F17/30312 ,  G06F17/30492 ,  Y10S707/99932 ,  Y10S707/99942

摘要： The present invention is directed to a method and mechanism for partitioning using information not directly located in the object being partitioned. According to an embodiment of the invention, foreign key-primary key relationships are utilized to create join conditions between multiple database tables to implement partitioning of a database object. Also, disclosed are methods and mechanisms to perform partition pruning.

摘要翻译： 本发明涉及一种使用不直接位于被划分的对象中的信息进行分区的方法和机制。 根据本发明的实施例，利用外键 - 主键关系来创建多个数据库表之间的连接条件以实现数据库对象的分区。 此外，公开了执行分割修剪的方法和机制。

公开(公告)号：US20100030728A1

公开(公告)日：2010-02-04

申请号：US12181994

申请日：2008-07-29

申请人： Sunil P. Chakkappen ,  Mohamed Zait

发明人： Sunil P. Chakkappen ,  Mohamed Zait

IPC分类号： G06F17/30

CPC分类号： G06F16/24545

摘要： Techniques are described herein for estimating selectivities of query predicates that reference more than one column and predicates that include column expressions. Virtual columns are defined based on column groups and column expressions. Statistics are gathered on the virtual columns and are used to estimate the selectivities of query predicates that include column groups or expressions. Query predicates that include column groups are mapped to virtual columns on which statistics are gathered, based on similarities between the column groups in the query predicates and the column groups on which the virtual columns are defined. Virtual columns are defined for column groups and expressions are specified by users or a workload analyzer that analyzes query predicates.

摘要翻译： 这里描述了用于估计引用多于一个列的查询谓词的选择性以及包括列表达式的谓词的技术。 虚拟列是基于列组和列表达式定义的。 在虚拟列上收集统计信息，并用于估计包含列组或表达式的查询谓词的选择性。 根据查询谓词中的列组与定义了虚拟列的列组之间的相似性，将列组映射到收集统计信息的虚拟列的查询谓词。 为列组定义虚拟列，表达式由用户或分析查询谓词的工作负载分析器指定。