公开(公告)号：US07363324B2

公开(公告)日：2008-04-22

申请号：US11016233

申请日：2004-12-17

申请人： Ashraf Ismail Aboulnaga ,  Peter Jay Haas ,  Sam Sampson Lightstone ,  Volker Gerhard Markl ,  Ivan Popivanov ,  Vijayshankar Raman

发明人： Ashraf Ismail Aboulnaga ,  Peter Jay Haas ,  Sam Sampson Lightstone ,  Volker Gerhard Markl ,  Ivan Popivanov ,  Vijayshankar Raman

IPC分类号： G06F17/30

CPC分类号： G06F17/30339

摘要： There is disclosed a data processing system implemented method, a data processing system, and an article of manufacture for directing a data processing system to maintain a database table associated with an initial maintenance scheduling interval. The data processing system implemented method includes selecting a randomizing factor, and selecting a new maintenance scheduling interval for the database table based on the initial maintenance scheduling interval and the selected randomizing factor.

摘要翻译： 公开了一种数据处理系统实现的方法，数据处理系统和用于指导数据处理系统维护与初始维护调度间隔相关联的数据库表的制品。 所述数据处理系统实现方法包括：选择随机化因子，并且基于所述初始维护调度间隔和所选择的随机化因子为所述数据库表选择新的维护调度间隔。

公开(公告)号：US20070226178A1

公开(公告)日：2007-09-27

申请号：US11388934

申请日：2006-03-24

申请人： Stephan Ewen ,  Holger Kache ,  Guy Lohman ,  Volker Markl ,  Vijayshankar Raman

发明人： Stephan Ewen ,  Holger Kache ,  Guy Lohman ,  Volker Markl ,  Vijayshankar Raman

IPC分类号： G06F17/30

CPC分类号： G06F17/30442 ,  Y10S707/99953

摘要： A method for predictable query execution through early materialization is provided. The method deals with the problem of cardinality misestimation in query execution plans, by pre-executing sub-plans on a query execution plan that have questionable estimates and collecting statistics on the output of these sub-plans. If needed, the overall query execution plan is changed in light of these statistics, before optimizing and executing the remainder of the query.

摘要翻译： 提供了一种通过早期实现来预测查询执行的方法。 该方法处理查询执行计划中基数误判的问题，预先执行查询执行计划的子计划，并对这些子计划的输出进行统计。 如果需要，在优化和执行查询的其余部分之前，根据这些统计信息更改整体查询执行计划。

公开(公告)号：US20070067274A1

公开(公告)日：2007-03-22

申请号：US11228888

申请日：2005-09-16

申请人： Wei Han ,  Inderpal Narang ,  Vijayshankar Raman

发明人： Wei Han ,  Inderpal Narang ,  Vijayshankar Raman

IPC分类号： G06F17/30

CPC分类号： G06F16/2456

摘要： Disclosed are a method and a system for executing a query that requires an expensive process, such as a join, between two or more datasets. If each dataset has multiple partitions that are located at multiple sources, then each of the multiple partitions for each dataset must be unioned prior to completing execution of the query. The method and system develop both a query execution plan and at least one alternative query execution plan to indicate when the process should be pushed down below the unions and when the process should be pulled up above the unions based on collocation of partitions. The query execution plan and the alternative query execution plan(s) are embedded in a composite query execution plan which is evaluated and re-evaluated at run time to determine which of the query execution plan and the alternative query execution plan is currently the most efficient plan and the query is executed, accordingly.

摘要翻译： 公开了一种执行查询的方法和系统，该查询需要在两个或更多个数据集之间的昂贵的处理，诸如连接。 如果每个数据集具有位于多个源的多个分区，则在完成执行查询之前，必须对每个数据集的每个分区进行联合。 该方法和系统开发查询执行计划和至少一个替代查询执行计划，以指示何时将流程推送到工会下方，以及何时应该根据分区的搭配将工作提升到工会以上。 查询执行计划和替代查询执行计划嵌入在复合查询执行计划中，该计划在运行时进行评估和重新评估，以确定查询执行计划和备用查询执行计划中的哪一个当前是最有效的 相应地执行计划并执行查询。

公开(公告)号：US20050267866A1

公开(公告)日：2005-12-01

申请号：US10855609

申请日：2004-05-28

申请人： Volker Markl ,  Vijayshankar Raman

发明人： Volker Markl ,  Vijayshankar Raman

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

CPC分类号： G06F17/30463 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933

摘要： “Determining Validity Ranges of Query Plans Based on Suboptimality” A method for approximating a validity range for a domain of cardinalities of input to an optimal query plan is provided. Such a validity range is iteratively approximated using a modified Newton-Raphson method to find roots of cost functions for optimal and alternative query plans, respectively. The Newton-Raphson method is combined with a method of incrementing roots of cost functions, known as input cardinalities, such that discontinuous and non-differentiable points in cost functions are avoided. In this manner, input cardinalities remain within a domain for which a valid range can be specified. Additionally, a robustness measure is determined by a sensitivity analysis performed on an approximated validity range. Using a robustness measure provided by a sensitivity analysis and resultant validity range and, query plan sub-optimality detection is simplified, re-optimization is selectively triggered, and robustness information is provided to a system or user performing corrective actions.

摘要翻译： “确定基于次优性的查询计划的有效范围”提供了一种近似有效范围的方法，该方法用于将输入到基本查询计划的基数的域的范围近似。 这种有效范围使用修正的牛顿 - 拉夫逊方法迭代近似，以分别找到最优和替代查询计划的成本函数的根。 Newton-Raphson方法与增加成本函数的根的方法相结合，称为输入基数，从而避免了成本函数中的不连续和不可微性的点。 以这种方式，输入基数保持在可以指定有效范围的域内。 另外，通过对近似有效范围进行的灵敏度分析来确定鲁棒性度量。 使用由灵敏度分析和合成有效范围提供的鲁棒性度量，并且简化了查询计划亚最优检测，重新优化被选择性地触发，并且向执行校正动作的系统或用户提供鲁棒性信息。

公开(公告)号：US08832158B2

公开(公告)日：2014-09-09

申请号：US13433507

申请日：2012-03-29

申请人： Eduard Diner ,  Jens Leenstra ,  Vijayshankar Raman ,  Adam J. Storm

发明人： Eduard Diner ,  Jens Leenstra ,  Vijayshankar Raman ,  Adam J. Storm

IPC分类号： G06F17/30

CPC分类号： G06F17/30563 ,  G06F17/30519

摘要： An approach is provided in which a processor receives a scan request to scan data included in a data table. The processor selects a column in the data table corresponding to the scan request and retrieves column data entries from the selected column. In addition, the processor identifies the width of the selected column and selects a scan algorithm based upon the identified column width. In turn, the processor loads the column data entries into column data vectors and computes scan results from the column data vectors using the selected scan algorithm.

公开(公告)号：US20120117064A1

公开(公告)日：2012-05-10

申请号：US12939605

申请日：2010-11-04

申请人： Oliver Draese ,  Namik Hrle ,  Oliver Koeth ,  Tianchao Li ,  Vijayshankar Raman ,  Knut Stolze

发明人： Oliver Draese ,  Namik Hrle ,  Oliver Koeth ,  Tianchao Li ,  Vijayshankar Raman ,  Knut Stolze

IPC分类号： G06F17/30

CPC分类号： G06F17/30592

摘要： A cell-specific dictionary is applied adaptively to adequate cells, where the cell-specific dictionary subsequently optimizes the handling of frequency-partitioned multi-dimensional data. This includes improved data partitioning with super cells or adjusting resulting cells by sub-dividing very large cells and merging multiple small cells, both of which avoid the highly skewed data distribution in cells and improve the query processing. In addition, more efficient encoding is taught within a cell in case the distinct values that actually appear in that cell are much smaller than the size of the column dictionary.

摘要翻译： 小区特定字典自适应地应用于适当的小区，其中小区特定字典随后优化频分区多维数据的处理。 这包括使用超级单元的改进的数据分区或通过划分非常大的单元并合并多个小单元来调整所得到的单元，这两者都避免了单元格中的高度偏斜的数据分布并且改进了查询处理。 另外，如果在该单元中实际出现的不同值远小于列字典的大小，则在单元格内教授更有效的编码。

公开(公告)号：US20110078134A1

公开(公告)日：2011-03-31

申请号：US12570420

申请日：2009-09-30

申请人： Peter Bendel ,  Oliver Draese ,  Vijayshankar Raman ,  Knut Stolze

发明人： Peter Bendel ,  Oliver Draese ,  Vijayshankar Raman ,  Knut Stolze

IPC分类号： G06F17/30

CPC分类号： G06F17/30312 ,  H03M7/3088

摘要： According to one embodiment of the present invention, a method for dictionary encoding data without using three-valued logic is provided. According to one embodiment of the invention, a method includes encoding data in a database table using a dictionary, wherein the data includes values representing NULLs. A query having a predicate is received and the predicate is evaluated on the encoded data, whereby the predicate is evaluated on both the encoded data and on the encoded NULLs.

摘要翻译： 根据本发明的一个实施例，提供了一种用于字典编码数据而不使用三值逻辑的方法。 根据本发明的一个实施例，一种方法包括使用字典对数据库表中的数据进行编码，其中数据包括表示NULL的值。 接收到具有谓词的查询，并且对编码数据评估谓词，由此在编码数据和编码的NULL上对谓词进行评估。

公开(公告)号：US07882202B2

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

申请号：US12060501

申请日：2008-04-01

申请人： Guillermo Alejandro Alvarez ,  David Darden Chambliss ,  Prashant Pandey ,  Vijayshankar Raman ,  James Alan Ruddy ,  Garret Frederick Swart ,  Harry Morris Yudenfriend

发明人： Guillermo Alejandro Alvarez ,  David Darden Chambliss ,  Prashant Pandey ,  Vijayshankar Raman ,  James Alan Ruddy ,  Garret Frederick Swart ,  Harry Morris Yudenfriend

IPC分类号： G06F15/16

CPC分类号： H04L63/102 ,  H04L67/1097

摘要： A method is disclosed that places data-intensive subprocesses in close physical and logical proximity to the facility responsible for storing the data, so that high efficiencies at reduced cost are achieved. In one specific example, new computer programs, termed adjuncts, are added and placed in a logical partition on a storage facility so that they can be invoked using appropriate commands issued on the I/O channel. Further, programs or changes are added to existing programs on the host machine, wherein such programs or changes discover the function extensions and invoke them to perform data processing.

摘要翻译： 公开了一种将数据密集型子处理器紧密地物理和逻辑地接近负责存储数据的设施的方法，从而实现了降低成本的高效率。 在一个具体示例中，称为附件的新计算机程序被添加并放置在存储设备上的逻辑分区中，使得可以使用在I / O通道上发出的适当命令来调用它们。 此外，将程序或更改添加到主机上的现有程序，其中这些程序或改变发现功能扩展并调用它们来执行数据处理。

公开(公告)号：US07877381B2

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

申请号：US11389596

申请日：2006-03-24

申请人： Stephan Eberhard Ewen ,  Holger Kache ,  Volker Gerhard Markl ,  Vijayshankar Raman

发明人： Stephan Eberhard Ewen ,  Holger Kache ,  Volker Gerhard Markl ,  Vijayshankar Raman

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

CPC分类号： G06F17/30463

摘要： A way for progressively refining a query execution plan during query execution in a federated data system is provided. Re-optimization constraints are placed in the query execution plan during query compilation. When a re-optimization constraint is violated during query execution, a model of the query execution plan is refined using a partially executed query to form a new query execution plan. The new query execution plan is compiled. The compiled new query execution plan is executed.

摘要翻译： 提供了一种在联合数据系统中查询执行期间逐步完善查询执行计划的方法。 在查询编译期间，重新优化约束被放置在查询执行计划中。 当在查询执行期间违反重新优化约束时，使用部分执行的查询来改进查询执行计划的模型以形成新的查询执行计划。 新的查询执行计划被编译。 执行编译的新查询执行计划。

公开(公告)号：US07853576B2

公开(公告)日：2010-12-14

申请号：US11848304

申请日：2007-08-31

申请人： Inderpal S. Narang ,  Vijayshankar Raman ,  Peter M. Schwarz

发明人： Inderpal S. Narang ,  Vijayshankar Raman ,  Peter M. Schwarz

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

CPC分类号： G06F17/30575 ,  Y10S707/99933 ,  Y10S707/99955

摘要： A system, method, and program storage device implementing the method, for integrating data in a database management system, wherein the method comprises grouping data sources and replicas of the data sources that provide analogous data into a common logical domain; writing application queries against the common logical domain; selecting a correct set of replicas of the data sources and a query-execution strategy for combining a content of the correct set of replicas of the data sources in order to answer the application queries according to query-cost-based optimization; selecting a correct set of data sources according to run-time constraints; shielding the application queries from changes to the data sources by dynamically binding the application queries against the correct sets of data sources and replicas of the data sources; and processing the application queries by generating an optimum query result based on the steps of grouping and shielding.

摘要翻译： 实现该方法的系统，方法和程序存储设备，用于将数据集成在数据库管理系统中，其中该方法包括将提供类似数据的数据源的数据源和副本分组到公共逻辑域中; 针对公共逻辑域编写应用程序查询; 选择正确的数据源副本和用于组合数据源的正确的副本集合的内容的查询执行策略，以便根据基于查询成本的优化来应答应用查询; 根据运行时限制选择正确的数据源集合; 通过将应用程序查询与数据源的正确数据源和副本集合动态绑定来屏蔽应用程序查询对数据源的更改; 并通过基于分组和屏蔽的步骤产生最佳查询结果来处理应用查询。