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

1. 发明授权

US10983998B2 Query execution plans by compilation-time execution 有权
公开(公告)号：US10983998B2
公开(公告)日：2021-04-20
申请号：US12146423
申请日：2008-06-25
申请人： Andrew S. Richardson , Campbell Bryce Fraser , Cesar A. Galindo-Legaría , Torsten W. Grabs , Wei Yu , Milind M. Joshi
发明人： Andrew S. Richardson , Campbell Bryce Fraser , Cesar A. Galindo-Legaría , Torsten W. Grabs , Wei Yu , Milind M. Joshi
IPC分类号： G06F16/30 , G06F16/2453
摘要： Described is a query optimizer comprising a query tuner that performs actual execution of query fragments to obtain actual results during compilation time, and uses those actual results to select a query plan. The actual results may be combined with estimates for fragments that were not executed. The tree may be traversed in a top-down traversal, processing every node. Alternatively, the tree may be traversed in a bottom-up traversal, re-deriving data for higher nodes as each lower level is completed. A limit, such as a time limit or level limit, may be used to control how much time is taken to determine the execution plan.

2. 发明申请

US20090327214A1 Query Execution Plans by Compilation-Time Execution 审中-公开
标题翻译：通过编译时执行查询执行计划
公开(公告)号：US20090327214A1
公开(公告)日：2009-12-31
申请号：US12146423
申请日：2008-06-25
申请人： Andrew S. Richardson , Campbell Bryce Fraser , Cesar A. Galindo-Legaria , Torsten W. Grabs , Wei Yu , Milind M. Joshi
发明人： Andrew S. Richardson , Campbell Bryce Fraser , Cesar A. Galindo-Legaria , Torsten W. Grabs , Wei Yu , Milind M. Joshi
IPC分类号： G06F17/30
CPC分类号： G06F16/24545
摘要： Described is a query optimizer comprising a query tuner that performs actual execution of query fragments to obtain actual results during compilation time, and uses those actual results to select a query plan. The actual results may be combined with estimates for fragments that were not executed. The tree may be traversed in a top-down traversal, processing every node. Alternatively, the tree may be traversed in a bottom-up traversal, re-deriving data for higher nodes as each lower level is completed. A limit, such as a time limit or level limit, may be used to control how much time is taken to determine the execution plan.
摘要翻译：描述了一种查询优化器，其包括执行查询片段的实际执行以在编译期间获得实际结果的查询调谐器，并且使用这些实际结果来选择查询计划。实际结果可能与未执行的片段的估计相结合。可以在上下遍历中遍历树，处理每个节点。或者，可以在自下而上遍历中遍历树，在每个较低级完成时，重新导出较高节点的数据。可以使用诸如时间限制或级别限制的限制来控制用于确定执行计划的时间。

3. 发明授权

US07792822B2 Systems and methods for modeling partitioned tables as logical indexes 有权
标题翻译：将分区表建模为逻辑索引的系统和方法
公开(公告)号：US07792822B2
公开(公告)日：2010-09-07
申请号：US11735683
申请日：2007-04-16
申请人： Cesar A. Galindo-Legaria , Craig S. Freedman , Milind M. Joshi
发明人： Cesar A. Galindo-Legaria , Craig S. Freedman , Milind M. Joshi
IPC分类号： G06F7/00
CPC分类号： G06F17/30321 , G06F17/30427
摘要： Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions.
摘要翻译：用于形成逻辑索引和利用这些索引的技术，以便抽象引用分区数据库表导致的许多复杂性。包括使用表元数据的顺序保留属性的技术，用于在分区表中的合并连接处理中向显式谓词添加分区相等谓词，以及在查询时选择分区表上逻辑跳过扫描的执行谓词不引用特定分区。这些技术通常从查询写入程序和处理系统中抽象出来显式引用表分区。

4. 发明申请

US20080215544A1 Systems and Methods for Modeling Partitioned Tables as Logical Indexes 有权
标题翻译：将分区表建模为逻辑索引的系统和方法
公开(公告)号：US20080215544A1
公开(公告)日：2008-09-04
申请号：US11735683
申请日：2007-04-16
申请人： Cesar Alejandro Galindo-Legaria , Craig S. Freedman , Milind M. Joshi
发明人： Cesar Alejandro Galindo-Legaria , Craig S. Freedman , Milind M. Joshi
IPC分类号： G06F17/30
CPC分类号： G06F17/30321 , G06F17/30427
摘要： Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions.
摘要翻译：用于形成逻辑索引和利用这些索引的技术，以便抽象引用分区数据库表导致的许多复杂性。包括使用表元数据的顺序保留属性的技术，用于在分区表中的合并连接处理中向显式谓词添加分区相等谓词，以及在查询时选择分区表上逻辑跳过扫描的执行谓词不引用特定分区。这些技术通常从查询写入程序和处理系统中抽象出来显式引用表分区。

5. 发明授权

US07254574B2 Structured indexes on results of function applications over data 有权
公开(公告)号：US07254574B2
公开(公告)日：2007-08-07
申请号：US10795623
申请日：2004-03-08
申请人： Conor J. Cunningham , Eric N. Hanson , Milind M. Joshi , Cesar A. Galindo-Legaria , Florian M. Waas
发明人： Conor J. Cunningham , Eric N. Hanson , Milind M. Joshi , Cesar A. Galindo-Legaria , Florian M. Waas
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table. The back-join is supported from a single-table indexed view to the base table via a unique clustering key which acts as a logical row locator. Thus, the system can back-join to the base table from an indexed view via the unique clustering key. These features allow the use of indexed views to index a table on the contents of multi-set or multi-valued attributes.

6. 发明授权

US07590646B2 System and method for segmented evaluation of database queries 失效
公开(公告)号：US07590646B2
公开(公告)日：2009-09-15
申请号：US10829595
申请日：2004-04-22
申请人： Cesar A. Galinda-Legaria , Goetz Graefe , Milind M. Joshi , Ross T. Bunker
发明人： Cesar A. Galinda-Legaria , Goetz Graefe , Milind M. Joshi , Ross T. Bunker
IPC分类号： G06F17/30
CPC分类号： G06F17/30501 , G06F17/3046 , G06F17/30466 , G06F17/30498 , Y10S707/99933 , Y10S707/99943
摘要： A method of satisfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.

7. 发明授权

US07340445B2 Structured indexes on results of function applications over data 有权
标题翻译：功能应用程序对数据结果的结构化索引
公开(公告)号：US07340445B2
公开(公告)日：2008-03-04
申请号：US11051360
申请日：2005-02-04
申请人： Conor J. Cunningham , Eric N. Hanson , Milind M. Joshi , Cesar A. Galindo-Legaria , Florian M. Waas
发明人： Conor J. Cunningham , Eric N. Hanson , Milind M. Joshi , Cesar A. Galindo-Legaria , Florian M. Waas
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table. The back-join is supported from a single-table indexed view to the base table via a unique clustering key which acts as a logical row locator. Thus, the system can back-join to the base table from an indexed view via the unique clustering key. These features allow the use of indexed views to index a table on the contents of multi-set or multi-valued attributes.
摘要翻译：索引视图或物化视图用作具有多值属性的基表上的辅助索引。这提供了使用索引来搜索嵌套数据。而且，索引是针对不良操作的结果。索引对不察觉操作的结果的视图提供了对嵌套集合的内容进行索引的能力。一个这样的不太理想的操作是“不适用”。这为查询执行计划提供了其他选项，从而导致更优化的查询。从索引视图向基表提供反向连接，以允许来自索引视图中不存在的基表中的字段包含在使用索引视图处理的表上的查询结果中作为访问路径这提供了一种在查询结果中包含不在索引视图中但在基表中的列的方法。通过独立的集群密钥（作为逻辑行定位符），从单表索引视图向基表支持后连接。因此，系统可以通过独特的聚类键从索引视图返回到基表。这些功能允许使用索引视图来索引关于多集或多值属性的内容的表。

8. 发明授权

US07272598B2 Structured indexes on results of function applications over data 有权
标题翻译：功能应用程序对数据结果的结构化索引
公开(公告)号：US07272598B2
公开(公告)日：2007-09-18
申请号：US11096149
申请日：2005-03-31
申请人： Conor J. Cunningham , Eric N. Hanson , Milind M. Joshi , Cesar A. Galindo-Legaria , Florian M. Waas
发明人： Conor J. Cunningham , Eric N. Hanson , Milind M. Joshi , Cesar A. Galindo-Legaria , Florian M. Waas
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： Indexed views or materialized views are used as a secondary index on a base table with multi-valued attributes. This provides for using the index to search in the nested data. Moreover, indexing is provided on the result of an unnest operation. Indexing a view on the result of an unnesting operation provides the ability to index the contents of a nested collection. One such unnesting operation is “cross apply unnest”. This provides additional options for a query execution plan, leading to a more optimized query. A back-join is provided from the indexed view to the base table to allow fields from the base table that are not present in the indexed view to be included in a result of a query on the table which is processed using the indexed view as an access path. This provides a means of including columns in the query result that are not in the indexed view but are in the base table. The back-join is supported from a single-table indexed view to the base table via a unique clustering key which acts as a logical row locator. Thus, the system can back-join to the base table from an indexed view via the unique clustering key. These features allow the use of indexed views to index a table on the contents of multi-set or multi-valued attributes.
摘要翻译：索引视图或物化视图用作具有多值属性的基表上的辅助索引。这提供了使用索引来搜索嵌套数据。而且，索引是针对不良操作的结果。索引对不察觉操作的结果的视图提供了对嵌套集合的内容进行索引的能力。一个这样的不太理想的操作是“不适用”。这为查询执行计划提供了其他选项，从而导致更优化的查询。从索引视图向基表提供反向连接，以允许来自索引视图中不存在的基表中的字段包含在使用索引视图处理的表上的查询结果中作为访问路径这提供了一种在查询结果中包含不在索引视图中但在基表中的列的方法。通过独立的集群密钥（作为逻辑行定位符），从单表索引视图向基表支持后连接。因此，系统可以通过独特的聚类键从索引视图返回到基表。这些功能允许使用索引视图来索引关于多集或多值属性的内容的表。

9. 发明授权

US08255387B2 Systems and methods for modeling partitioned tables as logical indexes 有权
标题翻译：将分区表建模为逻辑索引的系统和方法
公开(公告)号：US08255387B2
公开(公告)日：2012-08-28
申请号：US12833670
申请日：2010-07-09
申请人： Cesar A. Galindo-Legaria , Craig S. Freedman , Milind M. Joshi
发明人： Cesar A. Galindo-Legaria , Craig S. Freedman , Milind M. Joshi
IPC分类号： G06F7/00
CPC分类号： G06F17/30321 , G06F17/30427
摘要： Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions.
摘要翻译：用于形成逻辑索引和利用这些索引的技术，以便抽象引用分区数据库表导致的许多复杂性。包括使用表元数据的顺序保留属性的技术，用于在分区表中的合并连接处理中向显式谓词添加分区相等谓词，以及在查询时选择分区表上逻辑跳过扫描的执行谓词不引用特定分区。这些技术通常从查询写入程序和处理系统中抽象出来显式引用表分区。

10. 发明授权

US07599953B2 System and method for segmented evaluation of database queries 失效
标题翻译：数据库查询分段评估的系统和方法
公开(公告)号：US07599953B2
公开(公告)日：2009-10-06
申请号：US10998761
申请日：2004-11-29
申请人： Cesar A. Galindo-Legaria , Goetz Graefe , Milind M. Joshi , Ross T. Bunker
发明人： Cesar A. Galindo-Legaria , Goetz Graefe , Milind M. Joshi , Ross T. Bunker
IPC分类号： G06F17/30
CPC分类号： G06F17/30501 , G06F17/3046 , G06F17/30466 , G06F17/30498 , Y10S707/99933 , Y10S707/99943
摘要： A method of satisfying a database query includes evaluating certain joins on a per-segment basis. An expression tree is produced for the query, and the expression tree is evaluated to identify joins whose operands are two instances of the same relation and whose join predicate conjunctively includes an equality comparison between two instances of the same column. When such a join is identified, it may be evaluated by segmenting the operand relation according to the columns that are compared for equality in the predicate. The join is then evaluated by performing the join operation separately on each segment. Segments may be spooled separately, thereby exploiting the efficiencies obtained by spooling even where the entire relation is too large to fit in the spool. Execution iterators are provided for spooling successive segments and for applying the join to the spooled segment.
摘要翻译：满足数据库查询的方法包括基于每个段来评估某些联接。为查询生成表达式树，并且对表达式树进行评估，以标识其操作数是相同关系的两个实例的连接，并且其连接谓词连接地包含同一列的两个实例之间的等效比较。当识别出这样的连接时，可以通过根据在谓词中的相等性进行比较的列分割操作数关系来评估操作数关系。然后通过在每个段上分别执行连接操作来评估连接。分段可以单独地卷绕，从而利用即使在整个关系太大而不能装入卷轴的情况下通过卷绕获得的效率。提供执行迭代器用于假脱机连续的段并将连接应用到假脱机段。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式