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

1. 发明申请

US20080154844A1 ESTIMATING THE COMPILATION TIME OF A QUERY OPTIMIZER 有权
标题翻译：估计查询优化器的编译时间
公开(公告)号：US20080154844A1
公开(公告)日：2008-06-26
申请号：US12032838
申请日：2008-02-18
申请人： Dengfeng Gao , Ihab F. Ilyas , Eileen Tien Lin , Guy Maring Lohman , Jun Rao
发明人： Dengfeng Gao , Ihab F. Ilyas , Eileen Tien Lin , Guy Maring Lohman , Jun Rao
IPC分类号： G06F17/30
CPC分类号： G06F17/30471 , Y10S707/99934 , Y10S707/99935
摘要： A compilation time estimator provides a quantified estimate of the optimizer compilation time for a given query optimizer. The estimator automates the optimizer to choose the right level of optimization in commercial database systems. The estimator reuses an optimizer's join enumerator to obtain actual number of joins, but bypasses plan generation to save estimation overhead, and maintains a small number of interesting physical properties to estimate the number of plans by using a linear regression model. The estimator uses the number of generated plans to estimate query compilation time.
摘要翻译：编译时间估计器提供给定查询优化器的优化器编译时间的量化估计。估计器自动优化器在商业数据库系统中选择合适的优化级别。估计器重用优化器的连接枚举器来获取实际的连接数，但绕过计划生成以节省估计开销，并保留少量有趣的物理属性以通过使用线性回归模型来估计计划数。估计器使用生成计划的数量来估计查询编译时间。

2. 发明授权

US07356526B2 Estimating the compilation time of a query optimizer 有权
标题翻译：估计查询优化器的编译时间
公开(公告)号：US07356526B2
公开(公告)日：2008-04-08
申请号：US10673433
申请日：2003-09-30
申请人： Dengfeng Gao , Ihab F. Ilyas , Eileen Tien Lin , Guy Maring Lohman , Jun Rao
发明人： Dengfeng Gao , Ihab F. Ilyas , Eileen Tien Lin , Guy Maring Lohman , Jun Rao
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30471 , Y10S707/99934 , Y10S707/99935
摘要： A compilation time estimator provides a quantified estimate of the optimizer compilation time for a given query optimizer. The estimator automates the optimizer to choose the right level of optimization in commercial database systems. The estimator reuses an optimizer's join enumerator to obtain actual number of joins, but bypasses plan generation to save estimation overhead, and maintains a small number of interesting physical properties to estimate the number of plans by using a linear regression model. The estimator uses the number of generated plans to estimate query compilation time.
摘要翻译：编译时间估计器提供给定查询优化器的优化器编译时间的量化估计。估计器自动优化器在商业数据库系统中选择合适的优化级别。估计器重用优化器的连接枚举器来获取实际的连接数，但绕过计划生成以节省估计开销，并保留少量有趣的物理属性以通过使用线性回归模型来估计计划数。估计器使用生成计划的数量来估计查询编译时间。

3. 发明授权

US07925646B2 Estimating the compilation time of a query optimizer 有权
标题翻译：估计查询优化器的编译时间
公开(公告)号：US07925646B2
公开(公告)日：2011-04-12
申请号：US12032838
申请日：2008-02-18
申请人： Dengfeng Gao , Ihab F. Ilyas , Eileen Tien Lin , Guy Maring Lohman , Jun Rao
发明人： Dengfeng Gao , Ihab F. Ilyas , Eileen Tien Lin , Guy Maring Lohman , Jun Rao
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30471 , Y10S707/99934 , Y10S707/99935
摘要： A compilation time estimator provides a quantified estimate of the optimizer compilation time for a given query optimizer. The estimator automates the optimizer to choose the right level of optimization in commercial database systems. The estimator reuses an optimizer's join enumerator to obtain actual number of joins, but bypasses plan generation to save estimation overhead, and maintains a small number of interesting physical properties to estimate the number of plans by using a linear regression model. The estimator uses the number of generated plans to estimate query compilation time.
摘要翻译：编译时间估计器提供给定查询优化器的优化器编译时间的量化估计。估计器自动优化器在商业数据库系统中选择合适的优化级别。估计器重用优化器的连接枚举器来获取实际的连接数，但绕过计划生成以节省估计开销，并保留少量有趣的物理属性以通过使用线性回归模型来估计计划数。估计器使用生成计划的数量来估计查询编译时间。

4. 发明授权

US07647293B2 Detecting correlation from data 失效
标题翻译：从数据中检测相关性
公开(公告)号：US07647293B2
公开(公告)日：2010-01-12
申请号：US10864463
申请日：2004-06-10
申请人： Paul Geoffrey Brown , Peter Jay Haas , Ihab F. Ilyas , Volker G. Markl
发明人： Paul Geoffrey Brown , Peter Jay Haas , Ihab F. Ilyas , Volker G. Markl
IPC分类号： G06F17/30
CPC分类号： G06F17/30536 , G06F17/30471 , Y10S707/99932
摘要： A system and method of discovering dependencies between relational database column pairs and application of discoveries to query optimization is provided. For each candidate column pair remaining after simultaneously generating column pairs, pruning pairs not satisfying specified heuristic constraints, and eliminating pairs with trivial instances of correlation, a random sample of data values is collected. A candidate column pair is tested for the existence of a soft functional dependency (FD), and if a dependency is not found, statistically tested for correlation using a robust chi-squared statistic. Column pairs for which either a soft FD or a statistical correlation exists are prioritized for recommendation to a query optimizer, based on any of: strength of dependency, degree of correlation, or adjustment factor; statistics for recommended columns pairs are tracked to improve selectivity estimates. Additionally, a dependency graph representing correlations and dependencies as edges and column pairs as nodes is provided.
摘要翻译：提供了一种发现关系数据库列对与查询优化应用发现之间依赖关系的系统和方法。对于在同时生成列对之后剩余的每个候选列对，修剪对不满足指定的启发式约束，并且消除具有相关性的平凡实例的对，收集数据值的随机样本。测试候选列对是否存在软功能依赖（FD），并且如果没有找到依赖关系，则使用鲁棒的卡方统计统计检验相关性。基于任何一个依赖关系强度，相关程度或调整因素，对存在软FD或统计相关性的列进行优先排序以推荐给查询优化器; 跟踪推荐列对的统计量，以提高选择性估计。另外，提供了表示作为边缘和列对作为节点的相关性和依赖性的依赖图。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式