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

1. 发明授权

US07930301B2 System and method for searching computer files and returning identified files and associated files 失效
标题翻译：用于搜索计算机文件并返回识别的文件和相关文件的系统和方法
公开(公告)号：US07930301B2
公开(公告)日：2011-04-19
申请号：US10403063
申请日：2003-03-31
申请人： Cezary Marcjan , Ryszard Kott , Surajit Chaudhuri , Lili Cheng
发明人： Cezary Marcjan , Ryszard Kott , Surajit Chaudhuri , Lili Cheng
IPC分类号： G06F7/00
CPC分类号： G06F17/30106
摘要： A search of an index database or another search method is conducted to identify preliminary results listing one or more selected computer objects having selected identifying information stored in an index database. In addition, one or more selected computer objects of the preliminary search results are correlated with one or more other computer objects that have associations with the selected computer objects of the preliminary search results. Integrated search results are then returned and include the preliminary search results and one or more other computer objects that have associations with the selected computer objects of the preliminary search results. The associations may be determined by a association system and represent relationships between computer files based upon user or other interactions between the objects. The associations between the objects may include similarities between them and their importance.
摘要翻译：执行索引数据库或另一搜索方法的搜索以识别列出存储在索引数据库中的具有所选择的识别信息的一个或多个所选计算机对象的初步结果。此外，初步搜索结果的一个或多个所选择的计算机对象与与初步搜索结果的所选择的计算机对象具有关联的一个或多个其他计算机对象相关联。然后返回集成搜索结果，并包括初步搜索结果以及与初步搜索结果的所选计算机对象相关联的一个或多个其他计算机对象。关联可以由关联系统确定，并且基于用户或对象之间的其他交互来表示计算机文件之间的关系。对象之间的关联可能包括它们之间的相似性及其重要性。

2. 发明授权

US10838957B2 Slicing relational queries using spool operators 有权
公开(公告)号：US10838957B2
公开(公告)日：2020-11-17
申请号：US12817511
申请日：2010-06-17
申请人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri , Vivek Ravindranath Narasayya
发明人： Nicolas Bruno , Ravishankar Ramamurthy , Surajit Chaudhuri , Vivek Ravindranath Narasayya
IPC分类号： G06F16/2453
CPC分类号： G06F16/24537 , G06F16/24542
摘要： A relational database server may concurrently execute many relational queries, but a complex relational query may cause performance delays in the fulfillment of other relational queries. Instead, the relational database server may generate a query plan for the relational query, and may endeavor to partition the relational query between a spool operator and a scan operator into two or more query slices, where each query slice may be executed within a query slice threshold. Many alternative candidate query plans may be considered, such as inserting spool and scan operators after various operators and parameterizing operators in order to partition the records of a relation into two or more ranges based on an attribute of the relation. A large search space of candidate query plans may be reviewed in order to select a query plan that respects the query slice threshold while efficiently executing the logic of the relational query.

3. 发明授权

US10032131B2 Data services for enterprises leveraging search system data assets 有权
公开(公告)号：US10032131B2
公开(公告)日：2018-07-24
申请号：US13527601
申请日：2012-06-20
申请人： Tao Cheng , Kris Ganjam , Kaushik Chakrabarti , Zhimin Chen , Vivek R. Narasayya , Surajit Chaudhuri
发明人： Tao Cheng , Kris Ganjam , Kaushik Chakrabarti , Zhimin Chen , Vivek R. Narasayya , Surajit Chaudhuri
IPC分类号： G06F13/00 , G06Q10/10
摘要： A data service system is described herein which processes raw data assets from at least one network-accessible system (such as a search system), to produce processed data assets. Enterprise applications can then leverage the processed data assets to perform various environment-specific tasks. In one implementation, the data service system can generate any of: synonym resources for use by an enterprise application in providing synonyms for specified terms associated with entities; augmentation resources for use by an enterprise application in providing supplemental information for specified seed information; and spelling-correction resources for use by an enterprise application in providing spelling information for specified terms, and so on.

4. 发明授权

US08874592B2 Search guided by location and context 有权
标题翻译：按位置和上下文指导搜索
公开(公告)号：US08874592B2
公开(公告)日：2014-10-28
申请号：US11427287
申请日：2006-06-28
申请人： Gary W. Flake , William H. Gates, III , Eric J. Horvitz , Joshua T. Goodman , Surajit Chaudhuri , Trenholme J. Griffin , Oliver Hurst-Hiller , Kenneth A. Moss
发明人： Gary W. Flake , William H. Gates, III , Eric J. Horvitz , Joshua T. Goodman , Surajit Chaudhuri , Trenholme J. Griffin , Oliver Hurst-Hiller , Kenneth A. Moss
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/30061 , G06F17/30241 , G06F17/3087 , G06Q30/0261
摘要： The subject disclosure pertains to web searches and more particularly toward influencing resultant content to increase relevancy. The resultant content can be influenced by reconfiguring a query and/or filtering results based on user location and/or context information (e.g., user characteristics/profile, prior interaction/usage temporal, current events, and third party state/context . . . ). Furthermore, the disclosure provides for query execution on at least a subset of designated web content, for example as specified by a user. Still further yet, a localized marketing system is disclosed that provides discount offers to users that match merchant criteria including proximity. A system for actively probing populations of users with different parameters and monitoring responses can be employed to collect data for identifying the best discounts and deadlines to offer to users to achieve desired results.
摘要翻译：本发明涉及网络搜索，更具体地涉及影响结果内容以增加相关性。可以通过基于用户位置和/或上下文信息（例如，用户特征/简档，先前交互/使用时间，当前事件和第三方状态/上下文）重新配置查询和/或过滤结果来影响所得到的内容。）。此外，本公开提供了在指定的web内容的至少一个子集上的查询执行，例如由用户指定的。此外，公开了一种本地化的营销系统，其向与用户相匹配的商品标准（包括接近度）提供折扣优惠。可以采用用于主动探测具有不同参数和监测响应的用户群体的系统来收集数据，以识别提供给用户以获得期望结果的最佳折扣和期限。

5. 发明申请

US20130275436A1 PSEUDO-DOCUMENTS TO FACILITATE DATA DISCOVERY 审中-公开
标题翻译：促进数据发现的原始文件
公开(公告)号：US20130275436A1
公开(公告)日：2013-10-17
申请号：US13444717
申请日：2012-04-11
申请人： Surajit Chaudhuri , Lev Novik , John C. Platt
发明人： Surajit Chaudhuri , Lev Novik , John C. Platt
IPC分类号： G06F17/30
CPC分类号： G06F16/319 , G06F16/245
摘要： Various embodiments promote the discoverability of data that can be contained within a database. In one or more embodiments, data within a database is organized in a structure having a schema. The structure and data can be processed in a manner that renders one or more pseudo-documents each of which constitutes a sub-structure that can be indexed. Once produced and indexed, the pseudo-documents constitute a set of searchable objects each of which relationally points back to its associated structure within the database. Searches can now be performed against the pseudo-documents which, in turn, returns a set of search results. The set of search results can include multiple sub-sets of pseudo-documents, each sub-set of which is associated with a different structure.
摘要翻译：各种实施例提高了可以包含在数据库内的数据的可发现性。在一个或多个实施例中，数据库内的数据被组织在具有模式的结构中。结构和数据可以以呈现一个或多个伪文档的方式进行处理，每个伪文档构成可被索引的子结构。一旦生成和索引，伪文档构成一组可搜索的对象，每个可搜索对象在数据库中相互关联地指向其相关联的结构。现在可以针对伪文档执行搜索，这些伪文档又返回一组搜索结果。该组搜索结果可以包括多个伪文档子集，每个子集的每个子集与不同的结构相关联。

6. 发明申请

US20130091120A1 INTEGRATED FUZZY JOINS IN DATABASE MANAGEMENT SYSTEMS 有权
标题翻译：数据库管理系统中的集成FUZZY JOINS
公开(公告)号：US20130091120A1
公开(公告)日：2013-04-11
申请号：US13253315
申请日：2011-10-05
申请人： Kris Ganjam , Vivek Ravindranath Narasayya , Raghav Kaushik , Arvind Arasu , Surajit Chaudhuri
发明人： Kris Ganjam , Vivek Ravindranath Narasayya , Raghav Kaushik , Arvind Arasu , Surajit Chaudhuri
IPC分类号： G06F17/30
CPC分类号： G06F17/30303 , G06F17/30533
摘要： A fuzzy joins system that is integrated in a database system generates fuzzy joins between records from two datasets. The fuzzy joins system includes a tokenizer to generate tokens for data records and a transformer to find transforms for the tokens. The fuzzy joins system invokes a signature generator, running within a runtime layer of the database system, to generate signatures for data records based on the tokens and their transforms. Subsequently, an equi-join operation joins the records from the two datasets with at least one equal signature. A similarity calculator, running within a runtime layer of the database system, computes a similarity measure using the token information of the joined records. If the similarity measure for any two records is above a threshold, the fuzzy joins system generates a fuzzy join between such two records.
摘要翻译：集成在数据库系统中的模糊连接系统在两个数据集的记录之间生成模糊连接。模糊连接系统包括一个用于生成数据记录令牌的标记器和一个用于为令牌找到变换的变压器。模糊连接系统调用在数据库系统的运行时层内运行的签名生成器，以基于令牌及其转换生成用于数据记录的签名。随后，等连接操作将来自两个数据集的记录与至少一个相等的签名相连。在数据库系统的运行时层内运行的相似度计算器使用所连接的记录的令牌信息来计算相似性度量。如果任何两个记录的相似性度量高于阈值，则模糊连接系统在这两个记录之间生成模糊连接。

7. 发明授权

US08332388B2 Transformation rule profiling for a query optimizer 有权
标题翻译：用于查询优化器的转换规则概要分析
公开(公告)号：US08332388B2
公开(公告)日：2012-12-11
申请号：US12818237
申请日：2010-06-18
申请人： Surajit Chaudhuri , Leo Giakoumakis , Vivek Narasayya , Ravi Ramamurthy
发明人： Surajit Chaudhuri , Leo Giakoumakis , Vivek Narasayya , Ravi Ramamurthy
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30463
摘要： Technology is described for transformation rule profiling for a query optimizer. The method can include obtaining a database query configured to be optimized by the query optimizer of a database system. An optimized query plan for the database query can be found using a host set of transformation rules. One transformation rule can be removed and checked at a time. Each transformation rule can be checked to determine whether the transformation rule affects an optimal query plan output. A test query plan can be generated after each transformation rule has been removed. The query optimizer can determine whether the test query plan is different than the optimized query plan in the absence of the removed transformation rule. An equivalent set of transformation rules can be created that includes transformation rules where the test query plan generated from the equivalent set of transformation rules is equivalent to the optimized plan.
摘要翻译：描述技术用于查询优化器的转换规则剖析。该方法可以包括获得配置为由数据库系统的查询优化器优化的数据库查询。可以使用主机转换规则集查找数据库查询的优化查询计划。一次可以删除和检查一个转换规则。可以检查每个变换规则以确定变换规则是否影响最优查询计划输出。每个转换规则已被删除后，可以生成测试查询计划。在没有删除的转换规则的情况下，查询优化器可以确定测试查询计划是否与优化的查询计划不同。可以创建一组等效的转换规则，其中包括转换规则，其中从等效转换规则集生成的测试查询计划等同于优化的计划。

8. 发明申请

US20110314000A1 TRANSFORMATION RULE PROFILING FOR A QUERY OPTIMIZER 有权
标题翻译：用于查询优化器的变换规则轮廓
公开(公告)号：US20110314000A1
公开(公告)日：2011-12-22
申请号：US12818237
申请日：2010-06-18
申请人： Surajit Chaudhuri , Leo Giakoumakis , Vivek Narasayya , Ravi Ramamurthy
发明人： Surajit Chaudhuri , Leo Giakoumakis , Vivek Narasayya , Ravi Ramamurthy
IPC分类号： G06F17/30
CPC分类号： G06F17/30463
摘要： Technology is described for transformation rule profiling for a query optimizer. The method can include obtaining a database query configured to be optimized by the query optimizer of a database system. An optimized query plan for the database query can be found using a host set of transformation rules. One transformation rule can be removed and checked at a time. Each transformation rule can be checked to determine whether the transformation rule affects an optimal query plan output. A test query plan can be generated after each transformation rule has been removed. The query optimizer can determine whether the test query plan is different than the optimized query plan in the absence of the removed transformation rule. An equivalent set of transformation rules can be created that includes transformation rules where the test query plan generated from the equivalent set of transformation rules is equivalent to the optimized plan.
摘要翻译：描述技术用于查询优化器的转换规则剖析。该方法可以包括获得配置为由数据库系统的查询优化器优化的数据库查询。可以使用主机转换规则集查找数据库查询的优化查询计划。一次可以删除和检查一个转换规则。可以检查每个变换规则以确定变换规则是否影响最优查询计划输出。每个转换规则已被删除后，可以生成测试查询计划。在没有删除的转换规则的情况下，查询优化器可以确定测试查询计划是否与优化的查询计划不同。可以创建一组等效的转换规则，其中包括转换规则，其中从等效转换规则集生成的测试查询计划等同于优化的计划。

9. 发明授权

US08032546B2 Transformation-based framework for record matching 有权
标题翻译：用于记录匹配的基于变换的框架
公开(公告)号：US08032546B2
公开(公告)日：2011-10-04
申请号：US12031715
申请日：2008-02-15
申请人： Arvind Arasu , Surajit Chaudhuri
发明人： Arvind Arasu , Surajit Chaudhuri
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30569 , G06F17/30675 , G06F17/30985
摘要： A transformation-based record matching technique. The technique provides a flexible way to account for synonyms and more general forms of string equivalences when performing record matching by taking as explicit input user-defined transformation rules (such as, for example, the fact that “Robert” and “Bob” that are synonymous). The input string and user-defined transformation rules are used to generate a larger set of strings which are used when performing record matching. Both the input string and data elements in a database can be transformed using the user-defined transformation rules in order to generate a larger set of potential record matches. These potential record matches can then be subjected to a threshold test in order to determine one or more best matches. Additionally, signature-based similarity functions are used to improve the computational efficiency of the technique.
摘要翻译：基于变换的记录匹配技术。当通过采用显式输入用户定义的转换规则（例如，“Robert”和“Bob”）这样的事实来执行记录匹配时，该技术提供了一种灵活的方式来解释同义词和更一般的字符串等同形式同义词）。输入字符串和用户定义的转换规则用于生成在执行记录匹配时使用的较大的一组字符串。可以使用用户定义的变换规则来转换数据库中的输入字符串和数据元素，以便生成更大的潜在记录匹配集合。然后可以对这些潜在的记录匹配进行阈值测试，以确定一个或多个最佳匹配。另外，使用基于签名的相似度函数来提高该技术的计算效率。

10. 发明申请

US20110038531A1 LEARNING STRING TRANSFORMATIONS FROM EXAMPLES 有权
标题翻译：从示例中学习STRING变换
公开(公告)号：US20110038531A1
公开(公告)日：2011-02-17
申请号：US12492311
申请日：2009-08-14
申请人： Arvind Arasu , Surajit Chaudhuri , Shriraghav Kaushik
发明人： Arvind Arasu , Surajit Chaudhuri , Shriraghav Kaushik
IPC分类号： G06K9/62
CPC分类号： G06F17/2765
摘要： Techniques are described to leverage a set of sample or example matched pairs of strings to learn string transformation rules, which may be used to match data records that are semantically equivalent. In one embodiment, matched pairs of input strings are accessed. For a set of matched pairs, a set of one or more string transformation rules are learned. A transformation rule may include two strings determined to be semantically equivalent. The transformation rules are used to determine whether a first and second string match each other.
摘要翻译：描述技术来利用一组样本或示例匹配的字符串对来学习字符串转换规则，其可以用于匹配语义等同的数据记录。在一个实施例中，访问匹配的输入串对。对于一组匹配的对，学习一组或多个字符串转换规则。转换规则可以包括确定为在语义上相等的两个字符串。变换规则用于确定第一个和第二个字符串是否彼此匹配。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式