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

1. 发明授权

US08868587B1 Determining correction of queries with potentially inaccurate terms 有权
标题翻译：确定具有潜在不准确条件的查询的更正
公开(公告)号：US08868587B1
公开(公告)日：2014-10-21
申请号：US13482427
申请日：2012-05-29
申请人： Krishnan R. Subramaniam , Trystan G. Upstill
发明人： Krishnan R. Subramaniam , Trystan G. Upstill
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06F17/30646 , G06F17/30424 , G06F17/30657 , G06F17/30864
摘要： Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for correcting potentially inaccurate terms in queries. In an aspect, a search system determines that an original query includes a potentially inaccurate term. The determination is made on the basis that the term of the original query meets an inaccuracy criterion. Derivative queries are generated from the original query. Each derivative query does not include the potentially inaccurate term. For each derivative query resources that are determined to be responsive to the derivative query are determined, and from the resources, a corrected term is determined. The corrected term is substituted for the potentially inaccurate term, and a search operation that uses the corrected query as input is performed.
摘要翻译：方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于校正查询中的可能不准确的术语。在一方面，搜索系统确定原始查询包括潜在不准确的术语。基于原始查询的期限符合不准确的标准进行确定。衍生查询是从原始查询生成的。每个派生查询都不包括潜在的不准确的术语。对于确定为对衍生查询做出响应的每个衍生查询的资源被确定，并且从资源中确定校正的项。修正后的术语代替潜在的不准确的术语，并且执行使用校正的查询作为输入的搜索操作。

2. 发明授权

US07584202B2 High performance in memory data cubes 有权
公开(公告)号：US07584202B2
公开(公告)日：2009-09-01
申请号：US11332536
申请日：2006-01-13
申请人： Krishnan R. Subramaniam , Saugata Chowdhury
发明人： Krishnan R. Subramaniam , Saugata Chowdhury
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30501 , G06F17/30592 , G06F17/30598 , Y10S707/99932 , Y10S707/99942
摘要： A solution is provided in which regions are formed incrementally as points are added to a database. Each time a point is added to the database, it may be assigned to a new region. This new region may then be compared against each of the current set of regions until one is found with which it can be successfully merged. Then, this newly merged region may be compared against each of the other regions until one is found with which it can be successfully merged. This process repeats until there are no more regions that can be merged. Determining whether or not a region can be merged with another region may involve determining whether or not the points in one region differ from the points in the other region only along one dimension. If so, then the point can be successfully merged with the region.

3. 发明申请

US20090138489A1 High performance in memory data cubes 有权
标题翻译：高性能的内存数据立方体
公开(公告)号：US20090138489A1
公开(公告)日：2009-05-28
申请号：US11332536
申请日：2006-01-13
申请人： Krishnan R. Subramaniam , Saugata Chowdhury
发明人： Krishnan R. Subramaniam , Saugata Chowdhury
IPC分类号： G06F17/30
CPC分类号： G06F17/30501 , G06F17/30592 , G06F17/30598 , Y10S707/99932 , Y10S707/99942
摘要： A solution is provided in which regions are formed incrementally as points are added to a database. Each time a point is added to the database, it may be assigned to a new region. This new region may then be compared against each of the current set of regions until one is found with which it can be successfully merged. Then, this newly merged region may be compared against each of the other regions until one is found with which it can be successfully merged. This process repeats until there are no more regions that can be merged. Determining whether or not a region can be merged with another region may involve determining whether or not the points in one region differ from the points in the other region only along one dimension. If so, then the point can be successfully merged with the region.
摘要翻译：提供了一种解决方案，其中随着点被添加到数据库而逐渐形成区域。每当一个点被添加到数据库时，它可能被分配到一个新的区域。然后，可以将该新区域与当前的一组区域进行比较，直到找到可以成功合并的区域。然后，可以将这个新合并的区域与每个其他区域进行比较，直到找到可以成功合并的区域。该过程重复，直到没有更多的区域可以合并。确定区域是否可以与另一区域合并可以涉及确定一个区域中的点是否仅沿着一个维度与另一区域中的点不同。如果是这样，那么该点可以与该区域成功合并。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式