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

1. 发明授权

US07359890B1 System load based adaptive prefetch 有权
标题翻译：基于系统负载的自适应预取
公开(公告)号：US07359890B1
公开(公告)日：2008-04-15
申请号：US10142257
申请日：2002-05-08
申请人： Chi Ku , Arvind Nithrakashyap , Ari W. Mozes
发明人： Chi Ku , Arvind Nithrakashyap , Ari W. Mozes
IPC分类号： G06F17/30
CPC分类号： G06F17/3048 , Y10S707/99932
摘要： A number, of the blocks of data to be prefetched into a buffer cache, is determined dynamically at run time (e.g. during execution of a query), based at least in part on the load placed on the buffer cache. An application program (such as a database) is responsive to the number (also called “prefetch size”), to determine the amount of prefetching. A sequence of instructions (also called “prefetch size daemon”) computes the prefetch size based on, for example, the number of prefetched blocks aged out before use. The prefetch size daemon dynamically revises the prefetch size based on usage of the buffer cache, thereby to form a feedback loop. Depending on the embodiment, at times of excessive use of the buffer cache, prefetching may even be turned off. Although in one embodiment described herein the prefetch size daemon is implemented in a database, in other embodiments other kinds of applications and/or the operating system itself can use a prefetch size daemon of the type described herein to dynamically determine and change prefetch behavior.
摘要翻译：至少部分地基于放置在缓冲器高速缓存上的负载，在运行时（例如在执行查询期间）动态地确定要预取到缓冲器高速缓存中的数据块的数量。应用程序（例如数据库）响应于数字（也称为“预取大小”）来确定预取量。指令序列（也称为“预取大小守护程序”）基于例如在使用之前老化的预取块的数量来计算预取大小。预取大小守护程序根据缓冲区高速缓存的使用动态地修改预取大小，从而形成一个反馈循环。根据实施例，在过度使用缓冲器高速缓存的时候，预取甚至可能被关闭。尽管在本文描述的一个实施例中，预取大小守护程序在数据库中实现，但在其他实施例中，其他种类的应用和/或操作系统本身可以使用本文所述类型的预取大小守护程序动态地确定并改变预取行为。

2. 发明授权

US08280915B2 Binning predictors using per-predictor trees and MDL pruning 有权
标题翻译：使用每预测树和MDL修剪的binning预测变量
公开(公告)号：US08280915B2
公开(公告)日：2012-10-02
申请号：US11344185
申请日：2006-02-01
申请人： Mahesh Jagannath , Chitra Bhagwat , Joseph Yarmus , Ari W. Mozes
发明人： Mahesh Jagannath , Chitra Bhagwat , Joseph Yarmus , Ari W. Mozes
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06K9/6282
摘要： Binning of predictor values used for generating a data mining model provides useful reduction in memory footprint and computation during the computationally dominant decision tree build phase, but reduces the information loss of the model and reduces the introduction of false information artifacts. A method of binning data in a database for data mining modeling in a database system, the data stored in a database table in the database system, the data mining modeling having selected at least one predictor and one target for the data, the data including a plurality of values of the predictor and a plurality of values of the target, the method comprises constructing a binary tree for the predictor that splits the values of the predictor into a plurality of portions, pruning the binary tree, and defining as bins of the predictor leaves of the tree that remain after pruning, each leaf of the tree representing a portion of the values of the predictor.
摘要翻译：用于生成数据挖掘模型的预测值的分组在计算主导的决策树构建阶段提供了有用的减少内存占用和计算，但减少了模型的信息丢失并减少了虚假信息工件的引入。一种在数据库中对数据进行数据挖掘建模的方法，数据库系统中存储的数据库中存储的数据，数据挖掘建模已经为数据选择了至少一个预测因子和一个目标，数据包括所述预测器的多个值和所述目标的多个值，所述方法包括为所述预测器构建二叉树，所述预测器将所述预测器的值分割成多个部分，修剪所述二叉树，并且将所述二叉树定义为所述预测器修剪后保留的树的叶子，树的每个叶表示预测值的一部分值。

3. 发明授权

US09135309B2 System and method for building decision trees in a database 有权
标题翻译：在数据库中构建决策树的系统和方法
公开(公告)号：US09135309B2
公开(公告)日：2015-09-15
申请号：US13300030
申请日：2011-11-18
申请人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari W. Mozes , Mahesh Jagannath
发明人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari W. Mozes , Mahesh Jagannath
IPC分类号： G06F17/30
CPC分类号： G06F17/30539
摘要： A computer-implemented method of creating a data mining model in a database management system comprises accepting a database language statement at the database management system, the database language statement indicating a dataset and a data mining model to be created from the dataset, and creating, in the database management system, the indicated data mining model using the indicated dataset, wherein creation and application of the data mining model does not require moving data to a separate data mining engine.
摘要翻译：在数据库管理系统中创建数据挖掘模型的计算机实现的方法包括在数据库管理系统上接受数据库语言语句，指示要从数据集创建的数据集和数据挖掘模型的数据库语言语句，在数据库管理系统中，使用所指示的数据集的指示数据挖掘模型，其中数据挖掘模型的创建和应用不需要将数据移动到单独的数据挖掘引擎。

4. 发明授权

US08065326B2 System and method for building decision trees in a database 有权
标题翻译：在数据库中构建决策树的系统和方法
公开(公告)号：US08065326B2
公开(公告)日：2011-11-22
申请号：US11344112
申请日：2006-02-01
申请人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari W. Mozes , Mahesh Jagannath
发明人： Wei Li , Shiby Thomas , Joseph Yarmus , Ari W. Mozes , Mahesh Jagannath
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30539
摘要： Decision trees are efficiently represented in a relational database. A computer-implemented method of representing a decision tree model in relational form comprises providing a directed acyclic graph comprising a plurality of nodes and a plurality of links, each link connecting a plurality of nodes, encoding a tree structure by including in each node a parent-child relationship of the node with other nodes, encoding in each node information relating to a split represented by the node, the split information including a splitting predictor and a split value, and encoding in each node a target histogram.
摘要翻译：决策树在关系数据库中有效地表示。以关系形式表示决策树模型的计算机实现的方法包括提供包括多个节点和多个链接的有向无环图，每个链接连接多个节点，通过在每个节点中包括父节点来编码树结构 - 节点与其他节点的关系，在每个节点中对由节点表示的分裂相关的信息进行编码，分割信息包括分割预测器和分割值，以及在每个节点中对目标直方图进行编码。

5. 发明授权

US07272589B1 Database index validation mechanism 有权
标题翻译：数据库索引验证机制
公开(公告)号：US07272589B1
公开(公告)日：2007-09-18
申请号：US09703909
申请日：2000-11-01
申请人： Todd P. Guay , Gregory S. Smith , Ari W. Mozes , Gaylen D. Royal
发明人： Todd P. Guay , Gregory S. Smith , Ari W. Mozes , Gaylen D. Royal
IPC分类号： G06F17/30
CPC分类号： G06F17/30312 , Y10S707/954 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method evaluates a plurality of candidate index sets for a workload of database statements in a database system by first generating baseline statistics for each statement in the workload. An index superset is formed by combining an existing or current index set and a proposed index set. A candidate index set is derived from the index superset, the candidate index being one of the plurality of candidate index sets. Statistics for a statement are generated by first creating an execution plan which represents an efficient series of steps for executing the statement given the candidate index set. The execution plan is evaluated, and statistics based on the evaluation of the execution plan are generated and recorded. The cost of the execution plan is then determined and statistics are generated. Statistics for each candidate index set are rolled up and presented to a user or an index tuning mechanism.
摘要翻译：一种方法通过首先为工作负载中的每个语句生成基准统计量来评估数据库系统中数据库语句的工作负荷的多个候选索引集。索引超集是通过组合现有或当前索引集合和提出的索引集合来形成的。候选索引集是从索引超集导出的，候选索引是多个候选索引集之一。通过首先创建执行计划来生成语句的统计信息，该执行计划代表给出候选索引集的执行语句的有效的一系列步骤。对执行计划进行评估，生成并记录基于执行计划的评估的统计。然后确定执行计划的成本，并生成统计信息。每个候选索引集的统计信息被卷起并呈现给用户或索引调整机制。

6. 发明授权

US06691099B1 Method and system for histogram determination in a database 有权
标题翻译：数据库中直方图确定的方法和系统
公开(公告)号：US06691099B1
公开(公告)日：2004-02-10
申请号：US09872588
申请日：2001-05-31
申请人： Ari W. Mozes
发明人： Ari W. Mozes
IPC分类号： G06F1730
CPC分类号： G06F17/30469 , G06F17/30306 , G06F17/30536 , Y10S707/99932 , Y10S707/99934
摘要： A method and system for determining when to collect, save, and/or utilize histograms is disclosed. A mechanism for automatically deciding when to collect histograms upon request from the user is provided. The histogram collection decision is based on the columns the user is interested in, the role these columns play in the queries as submitted to the system, and the underlying distribution for these columns, e.g., as seen in a random sample. The user specifies which columns are of interest, and the database is configured to collect column usage information that describes how each column is being used in the workload. This column usage information could be stored in memory and periodically flushed to disk. Given a set of potential columns, the distribution of those columns is viewed in combination with the usage information to determine which columns should have histograms.
摘要翻译：公开了一种用于确定何时收集，保存和/或利用直方图的方法和系统。提供了一种用于根据用户请求自动决定何时收集直方图的机制。直方图收集决定基于用户感兴趣的列，这些列在提交给系统的查询中的作用，以及这些列的底层分布，例如随机样本中所示。用户指定哪些列是感兴趣的，并且数据库被配置为收集描述如何在工作负载中使用每列的列使用信息。此列使用信息可以存储在内存中并定期刷新到磁盘。给定一组潜在的列，这些列的分布与使用信息结合使用，以确定哪些列应具有直方图。

7. 发明授权

US07571159B2 System and method for building decision tree classifiers using bitmap techniques 有权
标题翻译：使用位图技术构建决策树分类器的系统和方法
公开(公告)号：US07571159B2
公开(公告)日：2009-08-04
申请号：US11344193
申请日：2006-02-01
申请人： Shiby Thomas , Wei Li , Joseph Yarmus , Mahesh Jagannath , Ari W. Mozes
发明人： Shiby Thomas , Wei Li , Joseph Yarmus , Mahesh Jagannath , Ari W. Mozes
IPC分类号： G06F7/00 , G06F17/30 , G06F17/00
CPC分类号： G06F17/30545 , Y10S707/99933 , Y10S707/99945
摘要： A method, system, and computer program product for counting predictor-target pairs for a decision tree model provides the capability to generate count tables that is quicker and more efficient than previous techniques. A method of counting predictor-target pairs for a decision tree model, the decision tree model based on data stored in a database, the data comprising a plurality of rows of data, at least one predictor and at least one target, comprises generating a bitmap for each split node of data stored in a database system by intersecting a parent node bitmap and a bitmap of a predictor that satisfies a condition of the node, intersecting each split node bitmap with each predictor bitmap and with each target bitmap to form intersected bitmaps, and counting bits of each intersected bitmap to generate a count of predictor-target pairs.
摘要翻译：用于计算决策树模型的预测器 - 目标对的方法，系统和计算机程序产品提供了生成比先前技术更快更有效的计数表的能力。一种对决策树模型计算预测器 - 目标对的方法，基于存储在数据库中的数据的决策树模型，包括多行数据的数据，至少一个预测器和至少一个目标，包括生成位图通过将父节点位图和满足该节点的条件的预测器的位图相交到数据库系统中存储的数据的每个分割节点，将每个分割节点位图与每个预测器位图相交，并与每个目标位图形成相交的位图，并计数每个相交位图的位以产生预测器 - 目标对的计数。

8. 发明授权

US07756853B2 Frequent itemset counting using subsets of bitmaps 有权
标题翻译：频繁的项集计数使用位图子集
公开(公告)号：US07756853B2
公开(公告)日：2010-07-13
申请号：US10927893
申请日：2004-08-27
申请人： Wei Li , Ari W. Mozes , Hakan Jakobsson
发明人： Wei Li , Ari W. Mozes , Hakan Jakobsson
IPC分类号： G06F7/00
CPC分类号： G06F17/30539
摘要： A method and mechanism for performing improved frequent itemset operations is provided. A set of item groups are divided into a plurality of subsets. Each item group is composed of a set of data items. Possible combinations of data items that may frequently appear together in the same item group are referred to as candidate combinations. Candidate combinations comprising a first set of data items are identified, and thereafter the occurrence of each candidate combination in any item group in each subset is counted by comparing item bitmaps, associated with items in the candidate combination, in each subset in turn. The comparison of item bitmaps is performed in volatile memory. A total frequent itemset count that describes the frequency of candidate combinations in items groups across all subsets is obtained. Thereafter, the total frequent itemset count for candidate combinations having a larger number of data items may be determined.
摘要翻译：提供了一种用于执行改进的频繁项目集操作的方法和机制。一组项目组被分成多个子集。每个项目组由一组数据项组成。可能经常出现在同一项目组中的数据项的可能组合被称为候选组合。识别包括第一组数据项的候选组合，然后通过在每个子集中依次比较与候选组合中的项目相关联的项目位图来对每个子集中的任何项目组中的每个候选组合的出现进行计数。项目位图的比较在易失性存储器中执行。获得描述所有子集中的项目组中候选组合的频率的总频繁项集计数。此后，可以确定具有较大数量数据项的候选组合的总频繁项目集计数。

9. 发明授权

US06732085B1 Method and system for sample size determination for database optimizers 有权
公开(公告)号：US06732085B1
公开(公告)日：2004-05-04
申请号：US09872565
申请日：2001-05-31
申请人： Ari W. Mozes
发明人： Ari W. Mozes
IPC分类号： G06F1730
CPC分类号： G06F17/30536 , Y10S707/99932 , Y10S707/99933
摘要： A system and method for determining an adequate sample size for statistics collection is disclosed. A mechanism for automatically determining an adequate sample size for both statistics and histograms is provided. The sample size determination is accomplished via an iterative approach where the process starts with a small sample, and for each attribute which may need more data, the sample size is increased while restricting the information collected to only those attributes that require the larger sample.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式