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

1. 发明授权

US06993516B2 Efficient sampling of a relational database 有权
标题翻译：关系数据库的有效抽样
公开(公告)号：US06993516B2
公开(公告)日：2006-01-31
申请号：US10329892
申请日：2002-12-26
申请人： Peter Jay Haas , Guy Maring Lohman , Mir Hamid Pirahesh , David Everett Simmen , Ashutosh Vir Vikram Singh , Michael Jeffrey Winer , Markos Zaharioudakis
发明人： Peter Jay Haas , Guy Maring Lohman , Mir Hamid Pirahesh , David Everett Simmen , Ashutosh Vir Vikram Singh , Michael Jeffrey Winer , Markos Zaharioudakis
IPC分类号： G06F17/30
CPC分类号： G06F17/30489 , G06F17/30536 , Y10S707/99932 , Y10S707/99936
摘要： A system, method and computer readable medium for sampling data from a relational database are disclosed, where an information processing system chooses rows from a table in a relational database for sampling, wherein data values are arranged into rows, rows are arranged into pages, and pages are arranged into tables. Pages are chosen for sampling according to a probability P and rows in a selected page are chosen for sampling according to a probability R, so that the overall probability of choosing a row for sampling is Q=PR. The probabilities P and R are based on the desired precision of estimates computed from a sample, as well as processing speed. The probabilities P and R are further based on either catalog statistics of the relational database or a pilot sample of rows from the relational database.
摘要翻译：公开了一种用于从关系数据库采样数据的系统，方法和计算机可读介质，其中信息处理系统从用于采样的关系数据库中的表中选择行，其中数据值被排列成行，行被排列成页，并且页面排列成表。根据概率P选择页面进行采样，并根据概率R选择所选页面中的行进行采样，以便选择采样行的总体概率为Q = PR。概率P和R基于从样本计算的估计精度以及处理速度。概率P和R进一步基于关系数据库的目录统计数据或来自关系数据库的行的导频样本。

2. 发明授权

US07636735B2 Method for estimating the cost of query processing 失效
标题翻译：估算查询处理成本的方法
公开(公告)号：US07636735B2
公开(公告)日：2009-12-22
申请号：US11206978
申请日：2005-08-19
申请人： Peter Jay Haas , Vanja Josifovski , Guy Maring Lohman , Chun Zhang
发明人： Peter Jay Haas , Vanja Josifovski , Guy Maring Lohman , Chun Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30935 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935 , Y10S707/99945 , Y10S707/99948
摘要： Provided is a method for modeling the cost of XML as well as relational operators. As with traditional relational cost estimation, a set of system catalog statistics that summarizes the XML data is exploited; however, the novel use of a set of simple path statistics is also proposed. A new statistical learning technique called transform regression is utilized instead of detailed analytical models to predict the overall cost of an operator. Additionally, a query optimizer in a database is enabled to be self-tuning, automatically adapting to changes over time in the query workload and in the system environment.
摘要翻译：提供了一种用于建模XML成本以及关系运算符的方法。与传统的关系成本估算一样，利用了一套总结XML数据的系统目录统计数据; 然而，还提出了一组简单路径统计学的新颖使用。使用称为变换回归的新的统计学习技术，而不是详细的分析模型来预测运营商的整体成本。另外，数据库中的查询优化器可以自我调整，自动适应查询工作负载和系统环境中随时间的变化。

3. 发明授权

US06732110B2 Estimation of column cardinality in a partitioned relational database 有权
标题翻译：分区关系数据库中列基数的估计
公开(公告)号：US06732110B2
公开(公告)日：2004-05-04
申请号：US09894222
申请日：2001-06-27
申请人： Walid Rjaibi , Guy Maring Lohman , Peter Jay Haas
发明人： Walid Rjaibi , Guy Maring Lohman , Peter Jay Haas
IPC分类号： G06F1700
CPC分类号： G06F17/30469 , Y10S707/99932 , Y10S707/99942 , Y10S707/99943 , Y10S707/99945
摘要： The present invention is directed to a system, method and computer readable medium for estimating a column cardinality value for a column in a partitioned table stored in a plurality of nodes in a relational database. According to one embodiment of the present invention, a plurality of column values for the partitioned table stored in each node are hashed, and a hash data set for each node is generated. Each of the hash data sets from each node is transferred to a coordinator node designated from the plurality of nodes. The hash data sets are merged into a merged data set, and an estimated column cardinality value for the table is calculated from the merged data set.
摘要翻译：本发明涉及一种用于估计存储在关系数据库中的多个节点中的分区表中的列的列基数值的系统，方法和计算机可读介质。根据本发明的一个实施例，对存储在每个节点中的分区表的多个列值进行散列，并且生成针对每个节点的散列数据集。来自每个节点的每个哈希数据集被传送到从多个节点指定的协调器节点。哈希数据集被合并到合并的数据集中，并且从合并的数据集中计算表的估计列基数值。

4. 发明申请

US20100312775A1 MANAGING UNCERTAIN DATA USING MONTE CARLO TECHNIQUES 有权
标题翻译：使用蒙特卡罗技术管理不确定的数据
公开(公告)号：US20100312775A1
公开(公告)日：2010-12-09
申请号：US12477856
申请日：2009-06-03
申请人： Peter Jay Haas , Ravindranath Jampani , Chistopher Matthew Jermaine , Luis Leopoldo Perez , Mingxi Wu , Fei Xu
发明人： Peter Jay Haas , Ravindranath Jampani , Chistopher Matthew Jermaine , Luis Leopoldo Perez , Mingxi Wu , Fei Xu
IPC分类号： G06F17/30
CPC分类号： G06F17/30536
摘要： According to one embodiment of the present invention, a method for managing uncertain data is provided. The method includes specifying data uncertainty using at least one variable generation (VG) function, wherein the VG function generates pseudorandom samples of uncertain data values. A random database based on the VG function is specified. and multiple Monte Carlo instantiations of the random database are generated. Using a Monte Carlo method, a query is repeatedly executed over the multiple Monte Carlo instantiations to output a Monte Carlo method result and associated query-results. The Monte Carlo method result may then be used to estimate statistical properties of a probability distribution of the query-result.
摘要翻译：根据本发明的一个实施例，提供了一种用于管理不确定数据的方法。该方法包括使用至少一个可变生成（VG）函数来指定数据不确定性，其中VG功能产生不确定数据值的伪随机样本。指定了基于VG功能的随机数据库。并生成随机数据库的多个蒙特卡罗实例。使用蒙特卡罗方法，通过多个蒙特卡洛实例重复执行查询，以输出蒙特卡罗方法结果和关联的查询结果。然后可以使用蒙特卡罗方法结果来估计查询结果的概率分布的统计特性。

5. 发明申请

US20090006331A1 ENTITY-BASED BUSINESS INTELLIGENCE 有权
公开(公告)号：US20090006331A1
公开(公告)日：2009-01-01
申请号：US11771668
申请日：2007-06-29
申请人： Ariel Fuxman , Peter Jay Haas , Berthold Reinwald , Yannis Sismanis , Ling Wang
发明人： Ariel Fuxman , Peter Jay Haas , Berthold Reinwald , Yannis Sismanis , Ling Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30489
摘要： A method is disclosed for conducting a query to transform data in a pre-existing database, the method comprising: collecting database information from the pre-existing database, the database information including inconsistent dimensional tables and fact tables; running an entity discovery process on the inconsistent dimensional tables and the fact tables to produce entity mapping tables; using the entity mapping tables to resolve the inconsistent dimensional tables into resolved dimensional tables; and running the query on a resolved database to obtain a query result, the resolved database including the resolved dimensional table.

6. 发明申请

US20080228831A1 METHOD, SYSTEM AND PROGRAM FOR PRIORITIZING MAINTENANCE OF DATABASE TABLES 失效
标题翻译：方法，系统和程序，用于优化数据库表的维护
公开(公告)号：US20080228831A1
公开(公告)日：2008-09-18
申请号：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.
摘要翻译：公开了一种数据处理系统实现的方法，数据处理系统和用于指导数据处理系统维护与初始维护调度间隔相关联的数据库表的制品。所述数据处理系统实现方法包括：选择随机化因子，并且基于所述初始维护调度间隔和所选择的随机化因子为所述数据库表选择新的维护调度间隔。

7. 发明授权

US08983879B2 Systems and methods for large-scale randomized optimization for problems with decomposable loss functions 有权
标题翻译：用于分解损失函数问题的大规模随机优化的系统和方法
公开(公告)号：US08983879B2
公开(公告)日：2015-03-17
申请号：US13595618
申请日：2012-08-27
申请人： Rainer Gemulla , Peter Jay Haas , John Sismanis
发明人： Rainer Gemulla , Peter Jay Haas , John Sismanis
IPC分类号： G06F15/18 , G06F15/78 , G06F7/58 , G06F9/06 , G06F17/10 , G06F17/11
CPC分类号： G06F15/781 , G06F7/588 , G06F9/06 , G06F17/10 , G06F17/11
摘要： Systems and methods directed toward processing optimization problems using loss functions, wherein a loss function is decomposed into at least one stratum loss function, a loss is decreased for each stratum loss function to a predefined stratum loss threshold individually using gradient descent, and the overall loss is decreased to a predefined threshold for the loss function by appropriately ordering the processing of the strata and spending appropriate processing time in each stratum. Other embodiments and aspects are also described herein.
摘要翻译：针对使用损失函数来处理优化问题的系统和方法，其中损失函数被分解成至少一个层损失函数，每个层损失函数的损失都减少到单独使用梯度下降的预定义层损失阈值，并且总体损耗通过适当地排序层的处理并在每个层中消耗适当的处理时间来减少到损失函数的预定阈值。本文还描述了其它实施例和方面。

8. 发明申请

US20120331025A1 SYSTEMS AND METHODS FOR LARGE-SCALE RANDOMIZED OPTIMIZATION FOR PROBLEMS WITH DECOMPOSABLE LOSS FUNCTIONS 审中-公开
标题翻译：用于具有可分解损失函数的问题的大规模随机优化的系统和方法
公开(公告)号：US20120331025A1
公开(公告)日：2012-12-27
申请号：US13595618
申请日：2012-08-27
申请人： Rainer Gemulla , Peter Jay Haas , John Sismanis
发明人： Rainer Gemulla , Peter Jay Haas , John Sismanis
IPC分类号： G06F7/38
CPC分类号： G06F15/781 , G06F7/588 , G06F9/06 , G06F17/10 , G06F17/11
摘要： Systems and methods directed toward processing optimization problems using loss functions, wherein a loss function is decomposed into at least one stratum loss function, a loss is decreased for each stratum loss function to a predefined stratum loss threshold individually using gradient descent, and the overall loss is decreased to a predefined threshold for the loss function by appropriately ordering the processing of the strata and spending appropriate processing time in each stratum. Other embodiments and aspects are also described herein.
摘要翻译：针对使用损失函数来处理优化问题的系统和方法，其中损失函数被分解成至少一个层损失函数，每个层损失函数的损失都减少到单独使用梯度下降的预定义层损失阈值，并且总体损耗通过适当地排序层的处理并在每个层中消耗适当的处理时间来减少到损失函数的预定阈值。本文还描述了其它实施例和方面。

9. 发明授权

US08176088B2 Incremental cardinality estimation for a set of data values 失效
标题翻译：一组数据值的增量基数估计
公开(公告)号：US08176088B2
公开(公告)日：2012-05-08
申请号：US12324352
申请日：2008-11-26
申请人： Walid Rjaibi , Peter Jay Haas
发明人： Walid Rjaibi , Peter Jay Haas
IPC分类号： G06F17/30
CPC分类号： G06F17/30469 , Y10S707/941 , Y10S707/959 , Y10S707/99937 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945 , Y10S707/99953
摘要： A system, an article, and a computer program product for estimating a cardinality value for a set of data values. In one embodiment, the system includes means for initializing a data structure for representing an array of counts; means for obtaining a data value from said set of data values; means for transforming said data value into a transformed string; means for modifying said data structure with said transformed string; means for obtaining a summary statistic value from said modified data structure, wherein the summary statistic value is based on the array of counts; and means for generating said estimated cardinality value using said summary statistic value.
摘要翻译：一种用于估计一组数据值的基数值的系统，物品和计算机程序产品。在一个实施例中，系统包括用于初始化用于表示计数阵列的数据结构的装置; 用于从所述数据值集合获得数据值的装置; 用于将所述数据值变换为变换字符串的装置; 用于用所述变换的字符串修改所述数据结构的装置; 用于从所述修改的数据结构获得摘要统计值的装置，其中所述摘要统计值基于计数数组; 以及用于使用所述概要统计值生成所述估计基数值的装置。

10. 发明授权

US07685086B2 Method for discovering undeclared and fuzzy rules in databases 失效
标题翻译：在数据库中发现未申报和模糊规则的方法
公开(公告)号：US07685086B2
公开(公告)日：2010-03-23
申请号：US11842828
申请日：2007-08-21
申请人： Paul Geoffrey Brown , Peter Jay Haas
发明人： Paul Geoffrey Brown , Peter Jay Haas
IPC分类号： G06F17/00 , G06F5/00 , G06N5/02 , G06N7/00 , G06N7/08
CPC分类号： G06N5/048 , G06F17/30539
摘要： A scheme is used to automatically discover algebraic constraints between pairs of columns in relational data. The constraints may be “fuzzy” in that they hold for most, but not all, of the records, and the columns may be in the same table or different tables. The scheme first identifies candidate sets of column value pairs that are likely to satisfy an algebraic constraint. For each candidate, the scheme constructs algebraic constraints by applying statistical histogramming, segmentation, or clustering techniques to samples of column values. In query-optimization mode, the scheme automatically partitions the data into normal and exception records. During subsequent query processing, queries can be modified to incorporate the constraints; the optimizer uses the constraints to identify new, more efficient access paths. The results are then combined with the results of executing the original query against the (small) set of exception records.
摘要翻译：一种方案用于自动发现关系数据中的列对之间的代数约束。约束可能是“模糊的”，因为它们对大多数但不是全部的记录持有，并且列可以在同一个表或不同的表中。该方案首先识别可能满足代数约束的列值对的候选集合。对于每个候选者，该方案通过将统计直方图，分段或聚类技术应用于列值样本来构建代数约束。在查询优化模式下，该方案自动将数据分割为正常和异常记录。在随后的查询处理期间，可以修改查询以并入约束; 优化器使用约束来识别新的更有效的访问路径。然后将结果与针对（小）异常记录集执行原始查询的结果相结合。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式