-
公开(公告)号：US08352463B2
公开(公告)日：2013-01-08
申请号：US12122896
申请日：2008-05-19
IPC分类号： G06F7/00
CPC分类号： G06F17/30613 , G06F17/30696 , G06F17/30864 , Y10S707/99933 , Y10S707/99935
摘要： The present invention relates to an integrated full-text search architecture that integrates full text search with database server applications in a tight manner so that it becomes part of the server in all aspects including storage, metadata, query processing, back/up restore and resource management. This provides improved performance with respect to queries as well as improved manageability. Furthermore, the subject architecture is open and schema directed unlike other conventional full-text search architectures. Accordingly, the full-text search architecture enables expert users (e.g., search providers) to define their own index structures as well as ranking algorithms.
摘要翻译： 本发明涉及一种集成的全文搜索架构，其以紧密的方式将全文搜索与数据库服务器应用集成，从而在包括存储，元数据，查询处理，备份/恢复和资源在内的所有方面成为服务器的一部分 管理。 这提供了关于查询的改进的性能以及改进的可管理性。 此外，与其他传统的全文搜索架构不同，主体架构是开放的和架构定向的。 因此，全文搜索架构使得专家用户（例如，搜索提供者）能够定义它们自己的索引结构以及排序算法。
-
公开(公告)号：US07533088B2
公开(公告)日：2009-05-12
申请号：US11121418
申请日：2005-05-04
申请人： Tapas Kumar Nayak , Feng Tian , Nimish Khanolkar
发明人： Tapas Kumar Nayak , Feng Tian , Nimish Khanolkar
IPC分类号： G06F17/30
CPC分类号： G06F17/30705 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： The subject invention pertains to database reverse query matching. A text document can be received and analyzed to determine which, if any, queries the document matches. To enable such functionality, a number of intermediate structures such as tables are generated in accordance with designated queries. In particular, a canonical table can be generated that specifies the expressions or phrases as well as match rules. Furthermore, a Boolean table can be generated that specifies the Boolean relationship of expressions in canonical table. A match component or methodology can match text phrases to query phrases identified by the canonical table. An evaluation component or related methodology can subsequently utilize the Boolean table to determine if the preliminary phrase matches match the query logic.
摘要翻译： 本发明涉及数据库反向查询匹配。 可以接收和分析文本文档，以确定文档匹配的查询（如果有）。 为了实现这样的功能，根据指定的查询生成诸如表的多个中间结构。 特别地，可以生成指定表达式或短语以及匹配规则的规范表。 此外，可以生成一个布尔表，指定规范表中表达式的布尔关系。 匹配组件或方法可以匹配文本短语以查询由规范表标识的短语。 评估组件或相关方法可随后利用布尔表来确定初步短语是否匹配查询逻辑。
-
公开(公告)号：US07376642B2
公开(公告)日：2008-05-20
申请号：US10813312
申请日：2004-03-30
IPC分类号： G06F17/30
CPC分类号： G06F17/30613 , G06F17/30696 , G06F17/30864 , Y10S707/99933 , Y10S707/99935
摘要： The present invention relates to an integrated full-text search architecture that integrates full text search with database server applications in a tight manner so that it becomes part of the server in all aspects including storage, metadata, query processing, back/up restore and resource management. This provides improved performance with respect to queries as well as improved manageability. Furthermore, the subject architecture is open and schema directed unlike other conventional full-text search architectures. Accordingly, the full-text search architecture enables expert users (e.g., search providers) to define their own index structures as well as ranking algorithms.
摘要翻译： 本发明涉及一种集成的全文搜索架构，其以紧密的方式将全文搜索与数据库服务器应用集成，从而在包括存储，元数据，查询处理，备份/恢复和资源在内的所有方面成为服务器的一部分 管理。 这提供了关于查询的改进的性能以及改进的可管理性。 此外，与其他传统的全文搜索架构不同，主体架构是开放的和架构定向的。 因此，全文搜索架构使得专家用户（例如，搜索提供者）能够定义它们自己的索引结构以及排序算法。
-
公开(公告)号：US20090100022A1
公开(公告)日：2009-04-16
申请号：US12122896
申请日：2008-05-19
IPC分类号： G06F17/30
CPC分类号： G06F17/30613 , G06F17/30696 , G06F17/30864 , Y10S707/99933 , Y10S707/99935
摘要： The present invention relates to an integrated full-text search architecture that integrates full text search with database server applications in a tight manner so that it becomes part of the server in all aspects including storage, metadata, query processing, back/up restore and resource management. This provides improved performance with respect to queries as well as improved manageability. Furthermore, the subject architecture is open and schema directed unlike other conventional full-text search architectures. Accordingly, the full-text search architecture enables expert users (e.g., search providers) to define their own index structures as well as ranking algorithms.
摘要翻译： 本发明涉及一种集成的全文搜索架构，其以紧密的方式将全文搜索与数据库服务器应用集成，从而在包括存储，元数据，查询处理，备份/恢复和资源在内的所有方面成为服务器的一部分 管理。 这提供了关于查询的改进的性能以及改进的可管理性。 此外，与其他传统的全文搜索架构不同，主体架构是开放的和架构定向的。 因此，全文搜索架构使得专家用户（例如，搜索提供者）能够定义它们自己的索引结构以及排序算法。
-
公开(公告)号：US20060253410A1
公开(公告)日：2006-11-09
申请号：US11121418
申请日：2005-05-04
申请人： Tapas Nayak , Feng Tian , Nimish Khanolkar
发明人： Tapas Nayak , Feng Tian , Nimish Khanolkar
IPC分类号： G06F17/30
CPC分类号： G06F17/30705 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： The subject invention pertains to database reverse query matching. A text document can be received and analyzed to determine which, if any, queries the document matches. To enable such functionality, a number of intermediate structures such as tables are generated in accordance with designated queries. In particular, a canonical table can be generated that specifies the expressions or phrases as well as match rules. Furthermore, a Boolean table can be generated that specifies the Boolean relationship of expressions in canonical table. A match component or methodology can match text phrases to query phrases identified by the canonical table. An evaluation component or related methodology can subsequently utilize the Boolean table to determine if the preliminary phrase matches match the query logic.
-
公开(公告)号：US20080294620A1
公开(公告)日：2008-11-27
申请号：US11805380
申请日：2007-05-23
申请人： Denis Churin , Jingwei Lu , Nimish Khanolkar , Sundaram Narayanan , Tapas Nayak , Feng Tian
发明人： Denis Churin , Jingwei Lu , Nimish Khanolkar , Sundaram Narayanan , Tapas Nayak , Feng Tian
IPC分类号： G06F17/30
CPC分类号： G06F17/30678 , G06F17/3053
摘要： Detailed herein is a technology which, among other things, allows a search engine to utilize a user-defined relevance function. In one approach to the technology, a method of applying a user-defined relevance function is described. In this approach, a complex search query is decomposed into a simple operator. The simple operator is associated with the user-defined relevance function. A document which matches the search query is retrieved, and a rank is calculated for the document, using the user-defined relevance function.
摘要翻译： 本文详细描述了一种技术，其特征在于允许搜索引擎利用用户定义的相关性功能。 在技术的一种方法中，描述了应用用户定义的相关性功能的方法。 在这种方法中，复杂的搜索查询被分解成一个简单的运算符。 简单的运算符与用户定义的相关函数相关联。 检索与搜索查询匹配的文档，并且使用用户定义的相关性函数为文档计算等级。
-
公开(公告)号：US20080114750A1
公开(公告)日：2008-05-15
申请号：US11559659
申请日：2006-11-14
申请人： Ashutosh Saxena , Jingwei Lu , Nimish Khanolkar
发明人： Ashutosh Saxena , Jingwei Lu , Nimish Khanolkar
IPC分类号： G06F17/30
CPC分类号： G06F16/3346
摘要： The subject disclosure pertains to systems and methods for facilitating item retrieval and/or ranking. An original ranking of items can be modified and enhanced utilizing a Markov Random Field (MRF) approach based upon item similarity. Item similarity can be measured utilizing a variety of methods. An MRF similarity model can be generated by measuring of similarity between items. An original ranking of items can be obtained, where each document is evaluated independently based upon a query. For example, the original ranking can be obtained using a keyword search. The original ranking can be enhanced based upon similarity of items. For example, items that are deemed to be similar should have similar rankings. The MRF model can be used in conjunction with original rankings to adjust rankings to reflect item relationships.
摘要翻译： 本发明涉及用于促进项目检索和/或排名的系统和方法。 可以使用基于项目相似度的马尔可夫随机场（MRF）方法来修改和增强项目的原始排名。 项目相似性可以利用各种方法来测量。 可以通过测量项目之间的相似性来生成MRF相似性模型。 可以获得项目的原始排名，其中基于查询独立地评估每个文档。 例如，可以使用关键词搜索获得原始排名。 可以基于项目的相似性来增强原始排名。 例如，被认为相似的项目应具有类似的排名。 MRF模型可以与原始排名一起使用，以调整排名以反映项目关系。
-
公开(公告)号：US07853603B2
公开(公告)日：2010-12-14
申请号：US11805380
申请日：2007-05-23
申请人： Denis Churin , Jingwei Lu , Nimish Khanolkar , Sundaram Narayanan , Tapas Nayak , Feng Tian
发明人： Denis Churin , Jingwei Lu , Nimish Khanolkar , Sundaram Narayanan , Tapas Nayak , Feng Tian
IPC分类号： G05F17/30
CPC分类号： G06F17/30678 , G06F17/3053
摘要： Detailed herein is a technology which, among other things, allows a search engine to utilize a user-defined relevance function. In one approach to the technology, a method of applying a user-defined relevance function is described. In this approach, a complex search query is decomposed into a simple operator. The simple operator is associated with the user-defined relevance function. A document which matches the search query is retrieved, and a rank is calculated for the document, using the user-defined relevance function.
摘要翻译： 本文详细描述了一种技术，其特征在于允许搜索引擎利用用户定义的相关性功能。 在技术的一种方法中，描述了应用用户定义的相关性功能的方法。 在这种方法中，复杂的搜索查询被分解成一个简单的运算符。 简单的运算符与用户定义的相关函数相关联。 检索与搜索查询匹配的文档，并且使用用户定义的相关性函数为文档计算等级。
-
公开(公告)号：US20050222975A1
公开(公告)日：2005-10-06
申请号：US10813312
申请日：2004-03-30
申请人： Tapas Nayak , Nimish Khanolkar
发明人： Tapas Nayak , Nimish Khanolkar
IPC分类号： G06F17/30
CPC分类号： G06F17/30613 , G06F17/30696 , G06F17/30864 , Y10S707/99933 , Y10S707/99935
摘要： The present invention relates to an integrated full-text search architecture that integrates full text search with database server applications in a tight manner so that it becomes part of the server in all aspects including storage, metadata, query processing, back/up restore and resource management. This provides improved performance with respect to queries as well as improved manageability. Furthermore, the subject architecture is open and schema directed unlike other conventional full-text search architectures. Accordingly, the full-text search architecture enables expert users (e.g., search providers) to define their own index structures as well as ranking algorithms.
摘要翻译： 本发明涉及一种集成的全文搜索架构，其以紧密的方式将全文搜索与数据库服务器应用集成，从而在包括存储，元数据，查询处理，备份/恢复和资源在内的所有方面成为服务器的一部分 管理。 这提供了关于查询的改进的性能以及改进的可管理性。 此外，与其他传统的全文搜索架构不同，主体架构是开放的和架构定向的。 因此，全文搜索架构使得专家用户（例如，搜索提供者）能够定义它们自己的索引结构以及排序算法。
-
公开(公告)号：US20050137856A1
公开(公告)日：2005-06-23
申请号：US10743153
申请日：2003-12-22
CPC分类号： G06F17/30336 , G06F17/2288 , G06F17/277
摘要： Consistency between the components used to generate and query a full-text index is determined and if a mismatch is detected, an error may be surfaced. A structure including information associated with each component used to build an index is programmatically compared with currently available components. The structure may be interrogated to enumerate the resources bound to a particular index. The enumeration of bound resources facilitates determination of what indexes (if any) must be regenerated for consistency as a result of a component upgrade or a move to another system.
摘要翻译： 确定用于生成和查询全文索引的组件之间的一致性，并且如果检测到不匹配，则可能会出现错误。 包括与用于构建索引的每个组件相关联的信息的结构以编程方式与当前可用的组件进行比较。 可以询问结构以枚举绑定到特定索引的资源。 绑定资源的枚举有助于确定由于组件升级或转移到另一个系统而必须重新生成哪些索引（如果有的话）。
-
-
-
-
-
-
-
-
-
搜索结果
10 条记录 (耗时 0.015 秒)