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

1. 发明授权

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排序函数的计算的技术。这些技术涉及将过滤操作下推到与目标排名功能相对应的窗口分类操作中。当满足预定的下拉条件集合时，可以采用下推技术。

2. 发明授权

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.
摘要翻译：提供了有效评估数据库查询（包括多个汇总运算符）的方法。通过计算分组标识符以区分每个汇总运算符的分组级别，包括汇总运算符的级联的数据库查询的评估包括汇总运算符的嵌套，并且将分组标识符包括为用于后续处理的排序键。此外，为了优化查询评估过程，可以基于估计每个汇总运算符生成的记录数的基数来确定计算汇总运算符的顺序，并且可以通过在汇总运算符处理之间分割数据记录来利用并行评估基于与在下一阶段未被处理的汇总运算符相关联的分组密钥的阶段。如果查询包含代数聚合函数，则代数函数表示为分布函数，通过评估阶段传播，用于计算最终汇总阶段的代数函数。

3. 发明授权

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子句中删除其外部块中未引用其结果的公式，从而消除不必要的计算。来自其他查询块的谓词可以使用电子表格子句移动到查询块内，从而大大减少要处理的数据量。给出了这种转换的有效性条件。

4. 发明申请

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.

5. 发明授权

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子句中删除其外部块中未引用其结果的公式，从而消除不必要的计算。来自其他查询块的谓词可以使用电子表格子句移动到查询块内，从而大大减少要处理的数据量。给出了这种转换的有效性条件。

6. 发明授权

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子句中删除其外部块中未引用其结果的公式，从而消除不必要的计算。来自其他查询块的谓词可以使用电子表格子句移动到查询块内，从而大大减少要处理的数据量。给出了这种转换的有效性条件。

7. 发明授权

US06457000B1 Method and apparatus for accessing previous rows of data in a table 有权
标题翻译：用于访问表中数据前一行的方法和装置
公开(公告)号：US06457000B1
公开(公告)日：2002-09-24
申请号：US09363996
申请日：1999-07-29
申请人： Andrew Witkowski , Bhaskar Ghosh
发明人： Andrew Witkowski , Bhaskar Ghosh
IPC分类号： G06F1730
CPC分类号： G06F17/30595 , G06F17/3048 , G06F17/30483 , Y10S707/99932 , Y10S707/99943
摘要： A method and apparatus is disclosed for allowing access to one or more previously generated rows of data. A server receives a statement that requires delivery of one or more rows of data to a client, and designates a particular row of data as a current row within a generation sequence. As the rows of data are being delivered to the client, the server accesses select previously generated rows of data that has already been delivered to the client without designating a new particular row of data as the current row. Once the previously generated row is accessed, data is retrieved from predetermined columns. The data retrieved may be used to perform various calculations that will insert values into the current row prior to delivery of the current row to the client. The statement transmitted by the client may include various parameters, including a default parameter, that specifies a default value to be used by the server. The previously generated row is then retrieved based on an offset parameter specified by the client. If the location determined is outside a predetermined range of addressable rows in the generation sequence, then the default value specified by the default parameter is returned. The present invention may also be configured to use a buffer and manage dynamic memory allocated to the buffer.
摘要翻译：公开了一种用于允许访问一个或多个先前生成的数据行的方法和装置。服务器接收需要将一行或多行数据传送给客户端的语句，并将特定行数据指定为生成序列中的当前行。当数据行被传递到客户端时，服务器访问已经传递给客户端的先前生成的数据行，而不指定新的特定数据行作为当前行。一旦访问了先前生成的行，就从预定的列中检索数据。检索的数据可用于执行各种计算，这些计算将在将当前行传递给客户端之前将值插入到当前行中。客户端发送的语句可以包括指定服务器使用的默认值的各种参数，包括默认参数。然后根据客户端指定的偏移参数检索先前生成的行。如果确定的位置在生成序列中的可寻址行的预定范围之外，则返回由默认参数指定的默认值。本发明还可以被配置为使用缓冲器并管理分配给缓冲器的动态存储器。

8. 发明授权

US07111020B1 Incremental refresh of materialized views containing rank function, and rewrite of queries containing rank or rownumber or min/max aggregate functions using such a materialized view 有权
标题翻译：包含秩函数的物化视图的增量刷新，以及使用这样的实例化视图重写包含rank或rownumber或min / max聚合函数的查询
公开(公告)号：US07111020B1
公开(公告)日：2006-09-19
申请号：US10107106
申请日：2002-03-26
申请人： Abhinav Gupta , Andrew Witkowski
发明人： Abhinav Gupta , Andrew Witkowski
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , Y10S707/99932 , Y10S707/99952
摘要： Techniques are provided for improving efficiency of database systems, and in particular, to refreshing materialized views maintained by database systems and rewriting queries to access the materialized views. According to the approaches, a ranked materialized view is incrementally refreshed, and during the incremental refresh operation, rows in the partitions of the materialized view are ranked within the partitions.
摘要翻译：提供了提高数据库系统效率的技术，特别是刷新由数据库系统维护的物化视图，并重写查询以访问物化视图。根据这些方法，逐步刷新排序的实体化视图，并且在增量刷新操作期间，物化视图的分区中的行被排列在分区内。

9. 发明申请

US20050235004A1 Using estimated cost to schedule an order for refreshing a set of materialized views (MVS) 有权
标题翻译：使用估计成本计划刷新一组物化视图（MVS）的顺序
公开(公告)号：US20050235004A1
公开(公告)日：2005-10-20
申请号：US11084331
申请日：2005-03-18
申请人： Nathaniel Folkert , Abhinav Gupta , Andrew Witkowski
发明人： Nathaniel Folkert , Abhinav Gupta , Andrew Witkowski
IPC分类号： G06F17/30
CPC分类号： G06F17/30383 , G06F17/30457
摘要： In an embodiment, estimated costs are used to pick the best refresh technique (e.g., method) for a given MV. In another embodiment, estimated costs are used to schedule the refresh of a set MVs in an order such that overall time to refresh is reduced, or in an order that uses the smallest overall time, for refreshing when compared to other alternative refresh schedules. In another embodiment, the estimated cost of refreshing each of a set of MVs is used to select the set of CPU resources to allocate to refreshing each MV. Based on the estimated costs, the allocation of CPU resources is chosen to be more optimal (e.g., use less CPU time) than other available sets of CPU resources. In an embodiment, when refreshing an MV, delayed index maintenance is chosen if a significant portion of the base table and/or the partitions of the table has changed.
摘要翻译：在一个实施例中，估计成本用于选择给定MV的最佳刷新技术（例如，方法）。在另一个实施例中，使用估计成本来按照这样的顺序调度设置的MV的刷新，使得当与其他备选刷新时间表相比时，总体刷新时间减少或以使用最小总体时间的顺序进行刷新。在另一个实施例中，使用一组MV中的每一个刷新的估计成本来选择要分配以刷新每个MV的CPU资源集合。基于估计的成本，CPU资源的分配被选择为比其他可用的CPU资源集合更优化（例如，使用更少的CPU时间）。在一个实施例中，当刷新MV时，如果基表的重要部分和/或表的分区已经改变，则选择延迟索引维护。

10. 发明申请

US20050039114A1 Spreadsheet to SQL translation 有权
标题翻译：电子表格到SQL翻译
公开(公告)号：US20050039114A1
公开(公告)日：2005-02-17
申请号：US10893547
申请日：2004-07-15
申请人： Aman Naimat , Allison Waingold , Martin Roth , Andrew Witkowski
发明人： Aman Naimat , Allison Waingold , Martin Roth , Andrew Witkowski
IPC分类号： G06F17/24 , G06F17/30 , G06F17/21
CPC分类号： G06F17/246 , G06F17/30427 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942
摘要： Users can create computational models in a spreadsheet application and automatically apply the model to data stored in a relational database. By importing a sample of the data from a database table into the spreadsheet application, users can build spreadsheet models that perform analysis and computations on the sample data. Once the model is complete, the spreadsheet model is translated into an SQL format model understood by the database. The SQL model can operate on the entire data set in the database, rather than just the sample data used to construct the model. The SQL model and its associated data are stored in the database, and the model can be executed on a different sets of data. A web browser based front-end allows model users to access the SQL model via a web browser, eliminating the need for model users to have a spreadsheet application.
摘要翻译：用户可以在电子表格应用程序中创建计算模型，并自动将模型应用于存储在关系数据库中的数据。通过将数据库表中的数据样本导入电子表格应用程序，用户可以构建对样本数据进行分析和计算的电子表格模型。模型完成后，电子表格模型将被转换为数据库了解的SQL格式模型。 SQL模型可以对数据库中的整个数据集进行操作，而不仅仅是用于构建模型的样本数据。 SQL模型及其相关数据存储在数据库中，模型可以在不同的数据集上执行。基于Web浏览器的前端允许模型用户通过Web浏览器访问SQL模型，从而无需模型用户使用电子表格应用程序。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式