公开(公告)号：US08533179B2

公开(公告)日：2013-09-10

申请号：US13544583

申请日：2012-07-09

申请人： 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上对谓词进行评估。

公开(公告)号：US08442988B2

公开(公告)日：2013-05-14

申请号：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.

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

公开(公告)号：US20070294323A1

公开(公告)日：2007-12-20

申请号：US11848304

申请日：2007-08-31

申请人： Inderpal Narang ,  Vijayshankar Raman ,  Peter Schwarz

发明人： Inderpal Narang ,  Vijayshankar Raman ,  Peter Schwarz

IPC分类号： 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.

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

公开(公告)号：US20070226186A1

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

申请号：US11389596

申请日：2006-03-24

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

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

IPC分类号： G06F17/30

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.

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

公开(公告)号：US20060136499A1

公开(公告)日：2006-06-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.

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

公开(公告)号：US08812486B2

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

申请号：US12028120

申请日：2008-02-08

申请人： Volker G. Markl ,  Vijayshankar Raman

发明人： Volker G. Markl ,  Vijayshankar Raman

IPC分类号： G06F7/00

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

摘要： 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方法与增加成本函数的根的方法相结合，称为输入基数，从而避免了成本函数中的不连续和不可微性的点。 以这种方式，输入基数保持在可以指定有效范围的域内。 另外，通过对近似有效范围进行的灵敏度分析来确定鲁棒性度量。 使用由灵敏度分析和合成有效范围提供的鲁棒性度量，并且简化了查询计划亚最优检测，重新优化被选择性地触发，并且向执行校正动作的系统或用户提供鲁棒性信息。

公开(公告)号：US20120278291A1

公开(公告)日：2012-11-01

申请号：US13544583

申请日：2012-07-09

申请人： 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上对谓词进行评估。

公开(公告)号：US08140490B2

公开(公告)日：2012-03-20

申请号：US12059129

申请日：2008-03-31

申请人： 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.

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

公开(公告)号：US20090248648A1

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

申请号：US12056999

申请日：2008-03-27

申请人： F. Ryan Johnson ,  Vijayshankar Raman ,  Garret Frederick Swart

发明人： F. Ryan Johnson ,  Vijayshankar Raman ,  Garret Frederick Swart

IPC分类号： G06F17/30

CPC分类号： G06F17/30445

摘要： Methods are described to simultaneously apply conjugates of equality, range, and in-list predicates. A first set of methods are described for the simultaneous application of equality predicates. A second set of methods are described for the simultaneous application of a mixture of range and equality predicates. A third method is described for the simultaneous applying a mixture of in-list predicates. The described methods allow for quick evaluation of complex predicates as they efficiently implement the computation done per record, while maintaining the same execution time irrespective of the number of fields.

摘要翻译： 描述方法同时应用等式，范围和列表中谓词的共轭。 描述了用于同时应用等式谓词的第一组方法。 描述了用于同时应用范围和等式谓词混合的第二组方法。 描述了同时应用列表中谓词混合的第三种方法。 所描述的方法允许对复杂谓词的快速评估，因为它们有效地实现每个记录的计算，同时保持相同的执行时间，而不管字段的数量。

公开(公告)号：US20080177722A1

公开(公告)日：2008-07-24

申请号：US11940185

申请日：2007-11-14

申请人： Guy Maring Lohman ,  Marki Volker ,  Mir Hamid Pirahesh ,  Vijayshankar Raman ,  David Everett Simmen

发明人： Guy Maring Lohman ,  Marki Volker ,  Mir Hamid Pirahesh ,  Vijayshankar Raman ,  David Everett Simmen

IPC分类号： G06F17/30

CPC分类号： G06F17/30979 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99935

摘要： A method, system, and computer program product to make query processing more robust in the face of optimization errors. The invention validates the statistics and assumptions used for compiling a query as the query is executed and, when necessary, progressively re-optimizes the query in mid-execution based on the knowledge learned during its partial execution. The invention selectively places a number of CHECK operators in a query execution plan to validate the optimizer's cardinality estimates against actual cardinalities. Errors beyond a threshold trigger re-optimization, and the optimizer decides whether the old plan is still optimal and whether to re-use previously computed results. The invention addresses arbitrary SQL queries whose plans can contain sub-queries, updates, trigger checking, and view maintenance operations. The invention can handle concurrent update transactions or updates of common sub-expressions in a query execution plan without compromising consistency and isolation as locking information is tied to the record ID.

摘要翻译： 一种方法，系统和计算机程序产品，使查询处理在面对优化错误时更加鲁棒。 本发明验证了在执行查询时用于编译查询的统计和假设，并且在必要时，根据在其部分执行期间学到的知识，在中间执行中逐渐重新优化查询。 本发明选择性地将多个CHECK运算符放置在查询执行计划中以根据实际基数验证优化器的基数估计。 超出阈值的错误触发重新优化，优化器决定旧计划是否仍然最优，以及是否重新使用先前计算的结果。 本发明解决任意SQL查询，其计划可以包含子查询，更新，触发器检查和查看维护操作。 本发明可以处理查询执行计划中的并发更新事务或公用子表达式的更新，而不会在锁定信息与记录ID相关联的情况下不影响一致性和隔离。