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

1. 发明授权

US07035843B1 Evaluation of database hierarchical cubes by nesting rollup operators associated with multiple groupings 有权
标题翻译：通过嵌套与多个分组关联的汇总运算符来评估数据库分层立方体
公开(公告)号：US07035843B1
公开(公告)日：2006-04-25
申请号：US10077828
申请日：2002-02-15
申请人： Srikanth Bellamkonda , Abhinav Gupta , Andrew Witkowski
发明人： Srikanth Bellamkonda , Abhinav Gupta , Andrew Witkowski
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30489 , Y10S707/99933
摘要： Methods are provided for efficiently evaluating database queries including multiple rollup operators. With the computation of grouping identifiers to distinguish grouping levels of each rollup operator, evaluation of database queries that include concatenation of rollup operators includes nesting of the rollup operators and includes the grouping identifiers as sorting keys for subsequent processing. Furthermore, to optimize the query evaluation process, the order in which the rollup operators are computed can be determined based on cardinalities that estimate the number of records generated by each rollup operator, and parallel evaluation can be utilized by partitioning data records between rollup operator processing stages based on the grouping keys associated with the rollup operators that are not being processed at the next stage. If the query includes an algebraic aggregate function, the algebraic function is represented as distributive functions, which are propagated through the evaluation stages and used to compute the algebraic function at the final rollup stage.
摘要翻译：提供了有效评估数据库查询（包括多个汇总运算符）的方法。通过计算分组标识符以区分每个汇总运算符的分组级别，包括汇总运算符的级联的数据库查询的评估包括汇总运算符的嵌套，并且将分组标识符包括为用于后续处理的排序键。此外，为了优化查询评估过程，可以基于估计每个汇总运算符生成的记录数的基数来确定计算汇总运算符的顺序，并且可以通过在汇总运算符处理之间分割数据记录来利用并行评估基于与在下一阶段未被处理的汇总运算符相关联的分组密钥的阶段。如果查询包含代数聚合函数，则代数函数表示为分布函数，通过评估阶段传播，用于计算最终汇总阶段的代数函数。

2. 发明授权

US07809712B2 Compile-time optimizations of queries with SQL spreadsheet 有权
标题翻译：使用SQL电子表格对查询进行编译时优化
公开(公告)号：US07809712B2
公开(公告)日：2010-10-05
申请号：US11592470
申请日：2006-11-02
申请人： Andrew Witkowski , Srikanth Bellamkonda , Tolga Bozkaya , Abhinav Gupta , Nathan Folkert , Sankar Subramanian
发明人： Andrew Witkowski , Srikanth Bellamkonda , Tolga Bozkaya , Abhinav Gupta , Nathan Folkert , Sankar Subramanian
IPC分类号： G06F17/30
CPC分类号： G06F17/246 , G06F17/30386 , G06F17/30412 , G06F17/30592 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.
摘要翻译：这里描述的是针对SQL的电子表格扩展的优化和执行策略。如电子表格条款中规定的数据分区提供了一种并行化电子表格计算并提供和提高可扩展性的方法。即使在电子表格子句中未明确指定分区，数据库优化器也可以在某些情况下自动推断分区。关于关系的高效的基于散列的访问结构可以用于符号阵列寻址，从而能够快速计算公式。重写SQL语句时，可以从spreadsheet子句中删除其外部块中未引用其结果的公式，从而消除不必要的计算。来自其他查询块的谓词可以使用电子表格子句移动到查询块内，从而大大减少要处理的数据量。给出了这种转换的有效性条件。

3. 发明申请

US20070055661A1 Compile-time optimizations of queries with SQL spreadsheet 有权
公开(公告)号：US20070055661A1
公开(公告)日：2007-03-08
申请号：US11592470
申请日：2006-11-02
申请人： Andrew Witkowski , Srikanth Bellamkonda , Tolga Bozkaya , Abhinav Gupta , Nathan Folkert , Sankar Subramanian
发明人： Andrew Witkowski , Srikanth Bellamkonda , Tolga Bozkaya , Abhinav Gupta , Nathan Folkert , Sankar Subramanian
IPC分类号： G06F17/30
CPC分类号： G06F17/246 , G06F17/30386 , G06F17/30412 , G06F17/30592 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.

4. 发明授权

US07761403B2 Run-time optimizations of queries with SQL spreadsheet 有权
标题翻译：使用SQL电子表格对查询的运行时优化
公开(公告)号：US07761403B2
公开(公告)日：2010-07-20
申请号：US10703412
申请日：2003-11-06
申请人： Andrew Witkowski , Srikanth Bellamkonda , Tolga Bozkaya , Abhinav Gupta , Nathan Folkert , Sankar Subramanian
发明人： Andrew Witkowski , Srikanth Bellamkonda , Tolga Bozkaya , Abhinav Gupta , Nathan Folkert , Sankar Subramanian
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , Y10S707/99932 , Y10S707/99934 , Y10S707/99937 , Y10S707/99938 , Y10S707/99939
摘要： Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.
摘要翻译：这里描述的是针对SQL的电子表格扩展的优化和执行策略。如电子表格条款中规定的数据分区提供了一种并行化电子表格计算并提供和提高可扩展性的方法。即使在电子表格子句中未明确指定分区，数据库优化器也可以在某些情况下自动推断分区。关于关系的高效的基于散列的访问结构可以用于符号阵列寻址，从而能够快速计算公式。重写SQL语句时，可以从spreadsheet子句中删除其外部块中未引用其结果的公式，从而消除不必要的计算。来自其他查询块的谓词可以使用电子表格子句移动到查询块内，从而大大减少要处理的数据量。给出了这种转换的有效性条件。

5. 发明授权

US07177855B2 Compile-time optimizations of queries with SQL spreadsheet 有权
标题翻译：使用SQL电子表格对查询进行编译时优化
公开(公告)号：US07177855B2
公开(公告)日：2007-02-13
申请号：US10704192
申请日：2003-11-06
申请人： Andrew Witkowski , Srikanth Bellamkonda , Tolga Bozkaya , Abhinav Gupta , Nathan Folkert , Sankar Subramanian
发明人： Andrew Witkowski , Srikanth Bellamkonda , Tolga Bozkaya , Abhinav Gupta , Nathan Folkert , Sankar Subramanian
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/246 , G06F17/30386 , G06F17/30412 , G06F17/30592 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： Described herein are optimizations and execution strategies for spreadsheet extensions to SQL. The partitioning of data, as specified in a spreadsheet clause, provides a way to parallelize the computation of spreadsheet and to provide and improve scalability. Even if the partitioning is not explicitly specified in the spreadsheet clause, the database optimizer can automatically infer the partitioning in some cases. Efficient hash based access structures on relations can be used for symbolic array addressing, enabling fast computation of formulas. When rewriting SQL statements, formulas whose results are not referenced in outer blocks can be removed from the spreadsheet clause, thus removing unnecessary computations. The predicates from other query blocks can be moved inside query blocks with spreadsheets clauses, thus considerably reducing the amount of data to be processed. Conditions for validity of this transformation are given.
摘要翻译：这里描述的是针对SQL的电子表格扩展的优化和执行策略。如电子表格条款中规定的数据分区提供了一种并行化电子表格计算并提供和提高可扩展性的方法。即使在电子表格子句中未明确指定分区，数据库优化器也可以在某些情况下自动推断分区。关于关系的高效的基于散列的访问结构可以用于符号阵列寻址，从而能够快速计算公式。重写SQL语句时，可以从spreadsheet子句中删除其外部块中未引用其结果的公式，从而消除不必要的计算。来自其他查询块的谓词可以使用电子表格子句移动到查询块内，从而大大减少要处理的数据量。给出了这种转换的有效性条件。

6. 发明授权

US06622138B1 Method and apparatus for optimizing computation of OLAP ranking functions 有权
标题翻译：优化OLAP排名函数计算的方法和装置
公开(公告)号：US06622138B1
公开(公告)日：2003-09-16
申请号：US09656304
申请日：2000-09-06
申请人： Srikanth Bellamkonda , Bhaskar Ghosh , Andrew Witkowski
发明人： Srikanth Bellamkonda , Bhaskar Ghosh , Andrew Witkowski
IPC分类号： G06F1730
CPC分类号： G06F17/30454 , G06F17/30471 , Y10S707/99932
摘要： Techniques are described for optimizing the computation of OLAP ranking functions. The techniques involve push-down of the filtering operation into the window sort operation corresponding to a target ranking function. The push-down technique may be employed when a predetermined set of push-down conditions are met.
摘要翻译：描述了用于优化OLAP排序函数的计算的技术。这些技术涉及将过滤操作下推到与目标排名功能相对应的窗口分类操作中。当满足预定的下拉条件集合时，可以采用下推技术。

7. 发明授权

US08650208B2 Method and system for enhancing scalability of analytic window functions 有权
标题翻译：提高分析窗函数可扩展性的方法和系统
公开(公告)号：US08650208B2
公开(公告)日：2014-02-11
申请号：US12848018
申请日：2010-07-30
申请人： Srikanth Bellamkonda
发明人： Srikanth Bellamkonda
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , G06F17/30489
摘要： An improved approach is described for handling parallelization of window functions, particularly window functions that do not contain partition keys or which has low cardinality for the partition keys. The approach is highly scalable and can be used to greatly improve query processing. A two stage evaluation approach is employed to parallelize the processing of window functions. In the first stage, which is highly parallel, the majority of the computation of window function is done by all available processes. In this way, the entire computing power of the database server is utilized. The second stage, which is serial but is likely to be very short, all processes involved in first stage synchronize and complete the window function evaluation.
摘要翻译：描述了一种改进的方法来处理窗口函数的并行化，特别是不包含分区键或分区键的基数较低的窗口函数。该方法具有高度可扩展性，可用于大大改进查询处理。采用两阶段评估方法并行处理窗函数。在高度并行的第一阶段，窗口函数的大部分计算是由所有可用的进程完成的。以这种方式，利用数据库服务器的整个计算能力。第二阶段是串行但可能很短的，第一阶段涉及的所有过程同步并完成窗口功能评估。

8. 发明申请

US20090083253A1 Efficient Evaluation of Hierarchical Cubes By Non-Blocking Rollups and Skipping Levels 有权
标题翻译：通过非阻塞汇总和跳过级别对分层立方体进行有效的评估
公开(公告)号：US20090083253A1
公开(公告)日：2009-03-26
申请号：US11862158
申请日：2007-09-26
申请人： Srikanth Bellamkonda
发明人： Srikanth Bellamkonda
IPC分类号： G06F17/30
CPC分类号： G06F17/30489 , G06F17/30592
摘要： Techniques are described herein for efficiently evaluating database queries that include hierarchical cube computations. During second and subsequent evaluation phases (if any), a database server does not re-determine groups (nor re-aggregate within such groups) that have already been determined in a previous evaluation phase. Instead, according to a technique described herein, whenever an evaluation phase subsequent to the first evaluation phase is performed, the database server immediately outputs or otherwise returns certain groups and aggregate results that were determined based on certain grouping column sets that were generated in the previous evaluation phase. The database server does not aggregate within these certain groups when performing aggregation in the current evaluation phase, thereby avoiding the duplication of work already performed during previous evaluation phases.
摘要翻译：这里描述了用于有效评估包括分层立方体计算的数据库查询的技术。在第二个和后续的评估阶段（如果有的话）中，数据库服务器不会重新确定在以前的评估阶段已经确定的组（也不在这些组内重新聚合）。相反，根据本文描述的技术，每当执行第一评估阶段之后的评估阶段时，数据库服务器立即输出或以其他方式返回某些组，并且基于在前一个中生成的某些分组列集确定的聚合结果评估阶段。在当前评估阶段执行聚合时，数据库服务器不会在这些特定组内聚合，从而避免在以前的评估阶段已经执行的工作重复。

9. 发明授权

US08150865B2 Techniques for coalescing subqueries 有权
标题翻译：合并子查询的技术
公开(公告)号：US08150865B2
公开(公告)日：2012-04-03
申请号：US12182002
申请日：2008-07-29
申请人： Rafi Ahmed , Srikanth Bellamkonda
发明人： Rafi Ahmed , Srikanth Bellamkonda
IPC分类号： G06F17/30
CPC分类号： G06F17/30448
摘要： Methods for transforming queries that contain EXISTS and NOT EXISTS subqueries are provided. The methods provided transform original queries that contain EXISTS and/or NOT EXISTS subqueries in conjunctive or disjunctive combinations into transformed queries that coalesce the original EXISTS and/or NOT EXISTS subqueries into a reduced number of EXISTS and/or NOT EXISTS subqueries, thereby eliminating duplicative table accesses and join operations.
摘要翻译：提供了用于转换包含EXISTS和NOT EXISTS子查询的查询的方法。所提供的方法将包含EXISTS和/或NOT EXISTS子查询的原始查询以联合或分离的组合转换为将原始EXISTS和/或NOT EXISTS子查询合并到减少数量的EXISTS和/或NOT EXISTS子查询中的转换查询，从而消除重复表访问和连接操作。

10. 发明授权

US07945560B2 Technique for removing subquery in group by—having clauses using window functions 有权
标题翻译：使用窗口函数删除组旁路子句中的子查询的技术
公开(公告)号：US07945560B2
公开(公告)日：2011-05-17
申请号：US12125783
申请日：2008-05-22
申请人： Rafi Ahmed , Srikanth Bellamkonda
发明人： Rafi Ahmed , Srikanth Bellamkonda
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30466
摘要： Methods for transforming a query to remove redundant subqueries in HAVING clauses are provided. The methods provided transform queries that contain subqueries in HAVING clauses with tables and join conditions and filter conditions equal to tables, join conditions and filter conditions in outer query to queries that eliminate the original subquery and retain the original outer query with a single inline view using window functions. Whether this transformation can be performed depends on which tables and join and filter conditions are in the outer query and the subquery. The transformation eliminates duplicative table accesses and join operations from queries.
摘要翻译：提供了在HAVING子句中转换查询以删除冗余子查询的方法。所提供的方法将包含HAVING子句中的子查询的查询转换为表和连接条件以及等于外部查询中的表，连接条件和过滤条件的过滤条件，以消除原始子查询并使用单个内联视图保留原始外部查询窗口功能。是否可以执行此转换取决于外部查询和子查询中的哪些表和连接和过滤条件。该转换消除了查询中的重复表访问和连接操作。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式