-
公开(公告)号：US07945577B2
公开(公告)日：2011-05-17
申请号：US12123101
申请日：2008-05-19
申请人： Mehmet Altinel , Christof Bomhoevd , Chandrasekaran Mohan , Mir Hamid Pirahesh , Berthold Reinwald , Saileshwar Krishnamurthy
发明人： Mehmet Altinel , Christof Bomhoevd , Chandrasekaran Mohan , Mir Hamid Pirahesh , Berthold Reinwald , Saileshwar Krishnamurthy
IPC分类号： G06F17/00
CPC分类号： G06F17/3048 , Y10S707/99933
摘要： A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan.
摘要翻译： 提供本地数据库缓存，实现远程数据库的完整或部分内容的持久自适应缓存。 包含本地缓存数据库的表的内容基于每个表进行定义。 表是：在查询执行之前以声明方式和填充方式定义，或者在查询执行期间按需动态和异步地填充表。 基于最初针对远程DBMS发出的用户输入查询和本地数据库高速缓存中的表之间的参考高速缓存约束，确定包括本地，远程和探测查询部分的Janus查询计划。 执行Janus查询计划的探查查询部分以确定是否可以通过对本地数据库高速缓存执行本地查询部分来传递最新结果，或者是否需要通过以下方式从远程数据库检索结果： 执行Janus查询计划的远程查询部分。
-
公开(公告)号：US20080215580A1
公开(公告)日：2008-09-04
申请号：US12123101
申请日：2008-05-19
申请人： MEHMET ALTINEL , Christof Bomhoevd , Chandasekaran Mohan , Mir Hamid Pirahesh , Berthold Reinwald , Saileshwar Krishnamurthy
发明人： MEHMET ALTINEL , Christof Bomhoevd , Chandasekaran Mohan , Mir Hamid Pirahesh , Berthold Reinwald , Saileshwar Krishnamurthy
IPC分类号： G06F17/30
CPC分类号： G06F17/3048 , Y10S707/99933
摘要： A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan.
摘要翻译： 提供本地数据库缓存，实现远程数据库的完整或部分内容的持久自适应缓存。 包含本地缓存数据库的表的内容基于每个表进行定义。 表是：在查询执行之前以声明方式和填充方式定义，或者在查询执行期间按需动态和异步地填充表。 基于最初针对远程DBMS发出的用户输入查询和本地数据库高速缓存中的表之间的参考高速缓存约束，确定包括本地，远程和探测查询部分的Janus查询计划。 执行Janus查询计划的探查查询部分以确定是否可以通过对本地数据库高速缓存执行本地查询部分来传递最新结果，或者是否需要通过以下方式从远程数据库检索结果： 执行Janus查询计划的远程查询部分。
-
公开(公告)号：US07395258B2
公开(公告)日：2008-07-01
申请号：US10902583
申请日：2004-07-30
申请人： Mehmet Altinel , Christof Bornhoevd , Chandrasekaran Mohan , Mir Hamid Pirahesh , Berthold Reinwald , Saileshwar Krishnamurthy
发明人： Mehmet Altinel , Christof Bornhoevd , Chandrasekaran Mohan , Mir Hamid Pirahesh , Berthold Reinwald , Saileshwar Krishnamurthy
IPC分类号： G06F17/30
CPC分类号： G06F17/3048 , Y10S707/99933
摘要： A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan.
摘要翻译： 提供本地数据库缓存，实现远程数据库的完整或部分内容的持久自适应缓存。 包含本地缓存数据库的表的内容基于每个表进行定义。 表是：在查询执行之前以声明方式和填充方式定义，或者在查询执行期间按需动态和异步地填充表。 基于最初针对远程DBMS发出的用户输入查询和本地数据库高速缓存中的表之间的参考高速缓存约束，确定包括本地，远程和探测查询部分的Janus查询计划。 执行Janus查询计划的探查查询部分以确定是否可以通过对本地数据库高速缓存执行本地查询部分来传递最新结果，或者是否需要通过以下方式从远程数据库检索结果： 执行Janus查询计划的远程查询部分。
-
公开(公告)号：US20060026154A1
公开(公告)日：2006-02-02
申请号：US10902583
申请日：2004-07-30
申请人： Mehmet Altinel , Christof Bornhoevd , Chandrasekaran Mohan , Mir Pirahesh , Berthold Reinwald , Saileshwar Krishnamurthy
发明人： Mehmet Altinel , Christof Bornhoevd , Chandrasekaran Mohan , Mir Pirahesh , Berthold Reinwald , Saileshwar Krishnamurthy
IPC分类号： G06F17/00
CPC分类号： G06F17/3048 , Y10S707/99933
摘要： A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan.
摘要翻译： 提供本地数据库缓存，实现远程数据库的完整或部分内容的持久自适应缓存。 包含本地缓存数据库的表的内容基于每个表进行定义。 表是：在查询执行之前以声明方式和填充方式定义，或者在查询执行期间按需动态和异步地填充表。 基于最初针对远程DBMS发出的用户输入查询和本地数据库高速缓存中的表之间的参考高速缓存约束，确定包括本地，远程和探测查询部分的Janus查询计划。 执行Janus查询计划的探查查询部分以确定是否可以通过对本地数据库高速缓存执行本地查询部分来传递最新结果，或者是否需要通过以下方式从远程数据库检索结果： 执行Janus查询计划的远程查询部分。
-
公开(公告)号：US08326847B2
公开(公告)日：2012-12-04
申请号：US12053597
申请日：2008-03-22
CPC分类号： G06F17/30395 , G06F17/30554
摘要： A system, method and computer program product for executing a query on linked data sources. Embodiments of the invention generate an instance graph expressing relationships between objects in the linked data sources and receive a query including at least first and second search terms. The first search term is then executed on the instance graph and a summary graph is generated using the results of the executing step. A second search term is then executed on the summary graph.
摘要翻译： 一种用于执行链接数据源查询的系统，方法和计算机程序产品。 本发明的实施例生成表示链接的数据源中的对象之间的关系并且接收包括至少第一和第二搜索项的查询的实例图。 然后在实例图上执行第一个搜索项，并使用执行步骤的结果生成汇总图。 然后在摘要图上执行第二个搜索项。
-
6.发明申请公开(公告)号：US20090240682A1
公开(公告)日：2009-09-24
申请号：US12053597
申请日：2008-03-22
IPC分类号： G06F7/06
CPC分类号： G06F17/30395 , G06F17/30554
摘要： A system, method and computer program product for executing a query on linked data sources. Embodiments of the invention generate an instance graph expressing relationships between objects in the linked data sources and receive a query including at least first and second search terms. The first search term is then executed on the instance graph and a summary graph is generated using the results of the executing step. A second search term is then executed on the summary graph.
摘要翻译： 一种用于执行链接数据源查询的系统，方法和计算机程序产品。 本发明的实施例生成表示链接的数据源中的对象之间的关系的实例图，并且接收包括至少第一和第二搜索项的查询。 然后在实例图上执行第一个搜索项，并使用执行步骤的结果生成汇总图。 然后在摘要图上执行第二个搜索项。
-
7.发明授权Methods for obtaining improved text similarity measures which replace similar characters with a string pattern representation by using a semantic data tree 失效用于通过使用语义数据树获得用字符串模式表示替换相似字符的改进的文本相似性度量的方法公开(公告)号：US07945525B2
公开(公告)日：2011-05-17
申请号：US11937550
申请日：2007-11-09
IPC分类号： G06F17/00
CPC分类号： G06F17/2211 , G06F17/277 , G06F17/2795
摘要： The embodiments of the invention provide methods for obtaining improved text similarity measures. More specifically, a method of measuring similarity between at least two electronic documents begins by identifying similar terms between the electronic documents. This includes basing similarity between the similar terms on patterns, wherein the patterns can include word patterns, letter patterns, numeric patterns, and/or alphanumeric patterns. The identifying of the similar terms also includes identifying multiple pattern types between the electronic documents. Moreover, the basing of the similarity on patterns identifies terms within the electronic documents that are within a category of a hierarchy. Specifically, the identifying of the terms reviews a hierarchical data tree, wherein nodes of the tree represent terms within the electronic documents. Lower nodes of the tree have specific terms; and, wherein higher nodes of the tree have general terms.
摘要翻译： 本发明的实施例提供了用于获得改进的文本相似性度量的方法。 更具体地说，一种测量至少两个电子文档之间的相似性的方法，首先是识别电子文档之间的类似术语。 这包括在模式上的类似术语之间的基础相似性，其中模式可以包括字模式，字母模式，数字模式和/或字母数字模式。 类似术语的识别还包括识别电子文档之间的多种模式类型。 此外，模式上的相似性的基础确定电子文档内的层次结构类别内的术语。 具体地，术语的识别审查分层数据树，其中树的节点表示电子文档内的术语。 树的下层节点有特定的术语; 并且其中树的较高节点具有一般术语。
-
8.发明授权Platform-independent method and system for graphically presenting the evaluation of a query in a database management system 有权平台无关的方法和系统，用于图形化地呈现数据库管理系统中的查询评估公开(公告)号：US06725212B2
公开(公告)日：2004-04-20
申请号：US09944921
申请日：2001-08-31
IPC分类号： G06F1730
CPC分类号： G06F17/30554 , Y10S707/99932 , Y10S707/99943
摘要： A method and system for graphically representing a plan for a query in a relational database management system is disclosed. The method includes receiving and processing an input query to form a plurality of plans, selecting at least one plan of the plurality of plans, and transforming the selected plan into a self-describing formatted file which is platform independent. The method further includes generating a graph representing the selected plan from the self-describing formatted file.
摘要翻译： 公开了一种在关系数据库管理系统中图形化地表示查询计划的方法和系统。 该方法包括接收和处理输入查询以形成多个计划，选择多个计划中的至少一个计划，以及将所选择的计划变换为独立于平台的自描述格式化文件。 该方法还包括从自描述格式化的文件生成表示所选择的计划的图形。
-
9.发明授权Systems and methods for processing machine learning algorithms in a MapReduce environment 失效在MapReduce环境中处理机器学习算法的系统和方法公开(公告)号：US08612368B2
公开(公告)日：2013-12-17
申请号：US13038086
申请日：2011-03-01
申请人： Douglas Ronald Burdick , Amol Ghoting , Rajasekar Krishnamurthy , Edwin Peter Dawson Pednault , Berthold Reinwald , Vikas Sindhwani , Shirish Tatikonda , Yuanyuan Tian , Shivakumar Vaithyanathan
发明人： Douglas Ronald Burdick , Amol Ghoting , Rajasekar Krishnamurthy , Edwin Peter Dawson Pednault , Berthold Reinwald , Vikas Sindhwani , Shirish Tatikonda , Yuanyuan Tian , Shivakumar Vaithyanathan
IPC分类号： G06F15/18
CPC分类号： G06F9/4843 , G06F8/427
摘要： Systems and methods for processing Machine Learning (ML) algorithms in a MapReduce environment are described. In one embodiment of a method, the method includes receiving a ML algorithm to be executed in the MapReduce environment. The method further includes parsing the ML algorithm into a plurality of statement blocks in a sequence, wherein each statement block comprises a plurality of basic operations (hops). The method also includes automatically determining an execution plan for each statement block, wherein at least one of the execution plans comprises one or more low-level operations (lops). The method further includes implementing the execution plans in the sequence of the plurality of the statement blocks.
摘要翻译： 描述了MapReduce环境中处理机器学习（ML）算法的系统和方法。 在一种方法的一个实施例中，该方法包括接收要在MapReduce环境中执行的ML算法。 该方法还包括将ML算法解析为序列中的多个语句块，其中每个语句块包括多个基本操作（跳）。 该方法还包括自动确定每个语句块的执行计划，其中至少一个执行计划包括一个或多个低级操作（lops）。 该方法还包括以多个语句块的顺序来实现执行计划。
-
10.发明授权公开(公告)号：US07987177B2
公开(公告)日：2011-07-26
申请号：US12022601
申请日：2008-01-30
CPC分类号： G06F17/30536 , G06F17/30469
摘要： The task of estimating the number of distinct values (DVs) in a large dataset arises in a wide variety of settings in computer science and elsewhere. The present invention provides synopses for DV estimation in the setting of a partitioned dataset, as well as corresponding DV estimators that exploit these synopses. Whenever an output compound data partition is created via a multiset operation on a pair of (possibly compound) input partitions, the synopsis for the output partition can be obtained by combining the synopses of the input partitions. If the input partitions are compound partitions, it is not necessary to access the synopses for all the base partitions that were used to construct the input partitions. Superior (in certain cases near-optimal) accuracy in DV estimates is maintained, especially when the synopsis size is small. The synopses can be created in parallel, and can also handle deletions of individual partition elements.
摘要翻译： 在大数据集中估计不同值（DV）的数量的任务出现在计算机科学和其他地方的各种设置中。 本发明提供了在分区数据集的设置中的DV估计的概要，以及利用这些概要的对应的DV估计器。 无论何时通过一对（可能是复合）输入分区上的多集合操作创建输出复合数据分区，可以通过组合输入分区的概要来获取输出分区的概要。 如果输入分区是复合分区，则不需要访问用于构建输入分区的所有基本分区的概要。 维持DV估计中的优异（在某些情况下接近最佳）的准确度，特别是当概要大小较小时。 概要可以并行创建，也可以处理各个分区元素的删除。
-
-
-
-
-
-
-
-
-
搜索结果
26 条记录 (耗时 0.027 秒)
