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

1. 发明授权

US08874961B2 Method and system for automatic failover of distributed query processing using distributed shared memory 有权
标题翻译：使用分布式共享内存进行分布式查询处理的自动故障转移的方法和系统
公开(公告)号：US08874961B2
公开(公告)日：2014-10-28
申请号：US12789531
申请日：2010-05-28
申请人： Brijesh Pillai , Aakanksha Gagrani Singh , Srikumar Krishnamoorthy
发明人： Brijesh Pillai , Aakanksha Gagrani Singh , Srikumar Krishnamoorthy
IPC分类号： G06F11/00 , G06F11/20 , G06F17/30
CPC分类号： G06F17/30545 , G06F11/2023 , G06F11/203 , G06F11/2043 , G06F2201/80 , G06F2201/815
摘要： A method and system for implementing automatic recovery from failure of resources in a grid-based distributed database is provided. The method includes determining the category of each node in the subgroup of nodes, where the determination identifies each node as at least one of a worker node and an idle node. The method further includes saving state of each worker node engaged in execution of a task in a shared memory at pre-determined time intervals. Each worker node is monitored by one or more idle nodes in each sub-group. Upon detection of no change in state of worker node for a pre-determined period of time, a failure notification is raised by one or more idle nodes that have detected failure of the worker node.
摘要翻译：提供了一种用于实现基于网格的分布式数据库中的资源故障的自动恢复的方法和系统。该方法包括确定节点子组中的每个节点的类别，其中确定将每个节点标识为工作节点和空闲节点中的至少一个。该方法还包括以预定的时间间隔将从事任务执行的每个工作节点的状态保存在共享存储器中。每个工作节点由每个子组中的一个或多个空闲节点进行监视。在预定时间段内检测到工作节点的状态没有变化的情况下，一个或多个检测到工作节点故障的空闲节点引起故障通知。

2. 发明授权

US08386508B2 System and method for parallel query evaluation 有权
标题翻译：用于并行查询评估的系统和方法
公开(公告)号：US08386508B2
公开(公告)日：2013-02-26
申请号：US12431296
申请日：2009-04-28
申请人： Srikumar Krishnamoorthy , Shanmugavel Sadasivam , Aakanksha Gagrani , Prahalad Haldhoderi Achutharao
发明人： Srikumar Krishnamoorthy , Shanmugavel Sadasivam , Aakanksha Gagrani , Prahalad Haldhoderi Achutharao
IPC分类号： G06F17/30
CPC分类号： G06F17/30445
摘要： A method and system for parallel query processing is provided. The method includes estimating a number of sub-queries that may be formed corresponding to an input query. The method further includes fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query. Further, processing of the sub queries is scheduled. Thereafter, one or more query execution plans are generated and processed. Following the processing of the query execution plans, the results of the processed sub queries are collated, aggregated and presented in a required format.
摘要翻译：提供了一种用于并行查询处理的方法和系统。该方法包括估计可以对应于输入查询形成的多个子查询。该方法还包括通过向输入查询添加一个或多个过滤器谓词而不改变输入查询的语义来将输入查询分段成多个子查询。此外，调度子查询的处理。此后，生成并处理一个或多个查询执行计划。在处理查询执行计划之后，处理后的子查询的结果将以所需的格式进行整理，汇总和呈现。

3. 发明申请

US20120254143A1 NATURAL LANGUAGE QUERYING WITH CASCADED CONDITIONAL RANDOM FIELDS 有权
标题翻译：自然语言查询与CASCADED条件随机字段
公开(公告)号：US20120254143A1
公开(公告)日：2012-10-04
申请号：US13117077
申请日：2011-05-26
申请人： Kishore Indukuri Varma , Srikumar Krishnamoorthy , Radha Krishna Pisipati
发明人： Kishore Indukuri Varma , Srikumar Krishnamoorthy , Radha Krishna Pisipati
IPC分类号： G06F17/30
CPC分类号： G06F17/2785 , G06F17/30401
摘要： A natural language query tool comprising cascaded conditional random fields (CRFs) (e.g., a linear-chain CRF and a skip-chain CRF applied sequentially) processes natural language input to produce output that can be used in database searches. For example, cascaded CRFs extract entities from natural language input that correspond to column names or column values in a database, and identify relationships between the extracted entities. A search engine can execute queries based on output from the cascaded CRFs over an inverted index of a database, which can be based on one or more materialized views of the database. Results can be sorted (e.g., according to relevance scores) and presented in a user interface.
摘要翻译：包括级联条件随机字段（CRF）（例如，顺序应用的线性链CRF和跳过链CRF）的自然语言查询工具处理自然语言输入以产生可用于数据库搜索的输出。例如，级联CRF从对应于数据库中的列名或列值的自然语言输入中提取实体，并且识别提取的实体之间的关系。搜索引擎可以基于数据库的反向索引上的级联CRF的输出执行查询，这可以基于数据库的一个或多个物化视图。结果可以被排序（例如，根据相关性得分）并呈现在用户界面中。

4. 发明授权

US08103656B2 Integrated distributed query processor for data grids 有权
标题翻译：用于数据网格的集成分布式查询处理器
公开(公告)号：US08103656B2
公开(公告)日：2012-01-24
申请号：US12389473
申请日：2009-02-20
申请人： Srikumar Krishnamoorthy , Avdhoot Kishore Saple , Prahalad Haldhoderi Achutharao
发明人： Srikumar Krishnamoorthy , Avdhoot Kishore Saple , Prahalad Haldhoderi Achutharao
IPC分类号： G06F7/00
CPC分类号： G06F17/30463 , G06F17/30545
摘要： A method for processing a distributed query in a network of computational resources is provided. The method includes receiving a user-defined freshness criterion and a distributed query from a user. The user-defined data freshness criterion is based on the version of the distributed query results desired by the user. An integrated cost model is formulated to optimize the execution of the distributed query. The integrated cost model is based on one or more integrated cost model factors. Thereafter, an objective function is constructed, based on the processing cost for each of the one or more copies of the one or more relations, and a data transmission cost for the transfer of the one or more copies of the one or more relations from a first to a second computational resource. Subsequently, an optimal solution of the objective function is calculated by using one or more heuristic approaches.
摘要翻译：提供了一种在计算资源网络中处理分布式查询的方法。该方法包括从用户接收用户定义的新鲜度标准和分布式查询。用户定义的数据新鲜度标准基于用户期望的分布式查询结果的版本。制定综合成本模型来优化分布式查询的执行。综合成本模型基于一个或多个综合成本模型因素。此后，基于一个或多个关系的一个或多个副本的处理成本构建目标函数，以及用于从一个或多个关系的一个或多个关系的一个或多个副本的转移的数据传输成本首先到第二个计算资源。随后，通过使用一种或多种启发式方法来计算目标函数的最优解。

5. 发明授权

US08386493B2 System and method for schema matching 有权
标题翻译：用于模式匹配的系统和方法
公开(公告)号：US08386493B2
公开(公告)日：2013-02-26
申请号：US12951364
申请日：2010-11-22
申请人： Durga Prasad Muni , Krupa Benhur Gadde , Srikumar Krishnamoorthy
发明人： Durga Prasad Muni , Krupa Benhur Gadde , Srikumar Krishnamoorthy
IPC分类号： G06F7/00
CPC分类号： G06F17/303 , G06F17/30292
摘要： A system and method for matching one or more source schemas with one or more target schemas is provided. The matching between source and target schemas is performed by gathering inputs pertaining to the source and target schemas, wherein the inputs comprises a set of details in a predefined format. Thereafter, the gathered inputs are processed by comparing the source schemas with the target schemas. The processing is performed to identify a set of matches between the source and target schemas based on the linguistic similarity, structural similarity and functional similarity and relationship between the source and target schemas. Subsequently, the identified matches are stored.
摘要翻译：提供了用于将一个或多个源模式与一个或多个目标模式进行匹配的系统和方法。源和目标模式之间的匹配通过收集与源模式和目标模式相关的输入来执行，其中输入包括预定格式的一组细节。此后，通过将源模式与目标模式进行比较来处理收集的输入。执行处理以基于语言相似性，结构相似性和功能相似性以及源和目标模式之间的关系来识别源和目标模式之间的一组匹配。随后，存储所识别的匹配。

6. 发明申请

US20090254916A1 ALLOCATING RESOURCES FOR PARALLEL EXECUTION OF QUERY PLANS 有权
标题翻译：分配资源并行执行查询计划
公开(公告)号：US20090254916A1
公开(公告)日：2009-10-08
申请号：US12192061
申请日：2008-08-14
申请人： Sumit Kumar Bose , Srikumar Krishnamoorthy , Nilesh Dilip Ranade
发明人： Sumit Kumar Bose , Srikumar Krishnamoorthy , Nilesh Dilip Ranade
IPC分类号： G06F9/50
CPC分类号： G06F9/5066 , G06F17/30477
摘要： Computing resources can be assigned to sub-plans within a query plan to effect parallel execution of the query plan. For example, computing resources in a grid can be represented by nodes, and a shortest path technique can be applied to allocate machines to the sub-plans. Computing resources can be provisionally allocated as the query plan is divided into query plan segments containing one or more sub-plans. Based on provisional allocations to the segments, the computing resources can then be allocated to the sub-plans within respective segments. Multiprocessor computing resources can be supported. The techniques can account for data locality. Both pipelined and partitioned parallelism can be addressed. Described techniques can be particularly suited for efficient execution of bushy query plans in a grid environment. Parallel processing will reduce the overall response time of the query.
摘要翻译：计算资源可以分配给查询计划中的子计划，以实现查询计划的并行执行。例如，网格中的计算资源可以由节点表示，并且可以应用最短路径技术来将子机分配给子计划。可以临时分配计算资源，因为查询计划被划分为包含一个或多个子计划的查询计划段。基于对段的临时分配，然后可以将计算资源分配给各个段内的子计划。可以支持多处理器计算资源。这些技术可以解释数据的局部性。可以解决流水线和分区并行性问题。描述的技术可以特别适合于在网格环境中有效执行浓密的查询计划。并行处理将减少查询的整体响应时间。

7. 发明申请

US20120078913A1 SYSTEM AND METHOD FOR SCHEMA MATCHING 有权
标题翻译：用于图像匹配的系统和方法
公开(公告)号：US20120078913A1
公开(公告)日：2012-03-29
申请号：US12951364
申请日：2010-11-22
申请人： Durga Prasad Muni , Krupa Benhur Gadde , Srikumar Krishnamoorthy
发明人： Durga Prasad Muni , Krupa Benhur Gadde , Srikumar Krishnamoorthy
IPC分类号： G06F17/30
CPC分类号： G06F17/303 , G06F17/30292
摘要： A system and method for matching one or more source schemas with one or more target schemas is provided. The matching between source and target schemas is performed by gathering inputs pertaining to the source and target schemas, wherein the inputs comprises a set of details in a predefined format. Thereafter, the gathered inputs are processed by comparing the source schemas with the target schemas. The processing is performed to identify a set of matches between the source and target schemas based on the linguistic similarity, structural similarity and functional similarity and relationship between the source and target schemas. Subsequently, the identified matches are stored.
摘要翻译：提供了用于将一个或多个源模式与一个或多个目标模式进行匹配的系统和方法。源和目标模式之间的匹配通过收集与源模式和目标模式相关的输入来执行，其中输入包括预定格式的一组细节。此后，通过将源模式与目标模式进行比较来处理收集的输入。执行处理以基于语言相似性，结构相似性和功能相似性以及源和目标模式之间的关系来识别源和目标模式之间的一组匹配。随后，存储所识别的匹配。

8. 发明申请

US20110228668A1 METHOD AND SYSTEM FOR AUTOMATIC FAILOVER OF DISTRIBUTED QUERY PROCESSING USING DISTRIBUTED SHARED MEMORY 有权
标题翻译：使用分布式共享存储器进行分布式查询处理的自动失败的方法和系统
公开(公告)号：US20110228668A1
公开(公告)日：2011-09-22
申请号：US12789531
申请日：2010-05-28
申请人： Brijesh PILLAI , Aakanksha Gagrani SINGH , Srikumar KRISHNAMOORTHY
发明人： Brijesh PILLAI , Aakanksha Gagrani SINGH , Srikumar KRISHNAMOORTHY
IPC分类号： H04J3/14
CPC分类号： G06F17/30545 , G06F11/2023 , G06F11/203 , G06F11/2043 , G06F2201/80 , G06F2201/815
摘要： A method and system for implementing automatic recovery from failure of resources in a grid-based distributed database is provided. The method includes determining the category of each node in the subgroup of nodes, where the determination identifies each node as at least one of a worker node and an idle node. The method further includes saving state of each worker node engaged in execution of a task in a shared memory at pre-determined time intervals. Each worker node is monitored by one or more idle nodes in each sub-group. Upon detection of no change in state of worker node for a pre-determined period of time, a failure notification is raised by one or more idle nodes that have detected failure of the worker node.
摘要翻译：提供了一种用于实现基于网格的分布式数据库中的资源故障的自动恢复的方法和系统。该方法包括确定节点子组中的每个节点的类别，其中确定将每个节点标识为工作节点和空闲节点中的至少一个。该方法还包括以预定的时间间隔将从事任务执行的每个工作节点的状态保存在共享存储器中。每个工作节点由每个子组中的一个或多个空闲节点进行监视。在预定时间段内检测到工作节点的状态没有变化的情况下，一个或多个检测到工作节点故障的空闲节点引起故障通知。

9. 发明授权

US07870133B2 Method for semantic based storage and retrieval of information 有权
标题翻译：基于语义的存储和检索信息的方法
公开(公告)号：US07870133B2
公开(公告)日：2011-01-11
申请号：US12074870
申请日：2008-03-06
申请人： Srikumar Krishnamoorthy , Abdul Sakib Mondal
发明人： Srikumar Krishnamoorthy , Abdul Sakib Mondal
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30011 , G06F17/3071
摘要： A method of storing semantically similar documents on proximally located peers in a structured peer to peer overlay network, where each peer is assigned a unique identifier and each document includes one or more words belonging to at least one hierarchical structured collection of words. A method of searching and retrieving documents, corresponding to a search query, from a structured peer to peer overlay network is also provided.
摘要翻译：一种在结构化对等覆盖网络中向近端定位的对等体上存储语义上相似的文档的方法，其中每个对等体被分配唯一的标识符，并且每个文档包括属于至少一个层次结构化的字集合的一个或多个字。还提供了从结构化对等覆盖网络搜索和检索对应于搜索查询的文档的方法。

10. 发明申请

US20090271385A1 SYSTEM AND METHOD FOR PARALLEL QUERY EVALUATION 有权
标题翻译：用于并行查询评估的系统和方法
公开(公告)号：US20090271385A1
公开(公告)日：2009-10-29
申请号：US12431296
申请日：2009-04-28
申请人： Srikumar Krishnamoorthy , Shanmugavel S. , Aakanksha Gagrani , Prahalad Haldhoderi Achutharao
发明人： Srikumar Krishnamoorthy , Shanmugavel S. , Aakanksha Gagrani , Prahalad Haldhoderi Achutharao
IPC分类号： G06F17/30
CPC分类号： G06F17/30445
摘要： A method and system for parallel query processing is provided. The method includes estimating a number of sub-queries that may be formed corresponding to an input query. The method further includes fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query. Further, processing of the sub queries is scheduled. Thereafter, one or more query execution plans are generated and processed. Following the processing of the query execution plans, the results of the processed sub queries are collated, aggregated and presented in a required format.
摘要翻译：提供了一种用于并行查询处理的方法和系统。该方法包括估计可以对应于输入查询形成的多个子查询。该方法还包括通过向输入查询添加一个或多个过滤器谓词而不改变输入查询的语义来将输入查询分段成多个子查询。此外，调度子查询的处理。此后，生成并处理一个或多个查询执行计划。在处理查询执行计划之后，处理后的子查询的结果将以所需的格式进行整理，汇总和呈现。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式