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

1. 发明授权

US08713024B2 Efficient forward ranking in a search engine 有权
标题翻译：在搜索引擎中有效的前进排名
公开(公告)号：US08713024B2
公开(公告)日：2014-04-29
申请号：US12951747
申请日：2010-11-22
申请人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Chad P. Walters , Vishesh Parikh , Jan Otto Pedersen
发明人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Chad P. Walters , Vishesh Parikh , Jan Otto Pedersen
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30864 , G06F17/30613
摘要： Methods and computer storage media are provided for generating entries for documents in a forward index. A document and its document identification are received, in addition to static features that are query-independent. The document is parsed into tokens to form a token stream corresponding to the document. Relevant data used to calculate rankings of document is identified and a position of the data is determined. The entry is then generated from the document identification, the token stream of the document, the static features, and the positional information of the relevant data. The entry is stored in the forward index.
摘要翻译：提供方法和计算机存储介质，用于为前向索引中的文档生成条目。除了与查询无关的静态特征之外，还收到文档及其文档标识。该文档被解析为令牌以形成与文档相对应的令牌流。识别用于计算文档排名的相关数据，并确定数据的位置。然后从文档标识，文档的令牌流，静态特征和相关数据的位置信息生成条目。条目存储在转发索引中。

2. 发明授权

US08620907B2 Matching funnel for large document index 有权
标题翻译：匹配漏斗用于大型文件索引
公开(公告)号：US08620907B2
公开(公告)日：2013-12-31
申请号：US12951528
申请日：2010-11-22
申请人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Chad P. Walters , Jan Otto Pedersen
发明人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Chad P. Walters , Jan Otto Pedersen
IPC分类号： G06F7/00
CPC分类号： G06F17/30864
摘要： Search results are identified and returned in response to search queries by evaluating and pruning candidate documents in multiple stages. The process employs a search index that indexes atoms found in documents and pre-computed scores for document/atom pairs. When a search query is received, atoms are identified from the search query and a reformulated query is generated based on the identified atoms. The reformulated query is used to identify matching documents, and a preliminary score is generated for matching documents using a simplified scoring function and pre-computed scores in the search index. Documents are pruned based on preliminary scores, and the remaining documents are evaluated using a final ranking algorithm that provides a final set of ranked documents, which is used to generate search results to return in response to the search query.
摘要翻译：搜索结果通过多个阶段评估和修剪候选文件来识别和返回以响应搜索查询。该过程使用搜索索引来索引文档中找到的原子，并为文档/原子对预先计算分数。当接收到搜索查询时，从搜索查询中识别原子，并根据所识别的原子生成重新排列的查询。重新配置的查询用于识别匹配文档，并使用简单的评分函数和搜索索引中的预先计算的分数生成匹配文档的初步分数。基于初步分数修剪文档，并且使用最终排序算法评估剩余文档，该最终排名算法提供最终的排名文档集合，其用于生成搜索结果以响应于搜索查询而返回。

3. 发明授权

US09424351B2 Hybrid-distribution model for search engine indexes 有权
标题翻译：搜索引擎索引的混合分布模型
公开(公告)号：US09424351B2
公开(公告)日：2016-08-23
申请号：US12951815
申请日：2010-11-22
申请人： Knut Magne Risvik , Michael Hopcroft , John Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Chad P. Walters , Vishesh Parikh , Jan Otto Pedersen
发明人： Knut Magne Risvik , Michael Hopcroft , John Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Chad P. Walters , Vishesh Parikh , Jan Otto Pedersen
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864 , G06F17/30194 , G06F17/30442 , G06F17/3053
摘要： Methods and systems are provided for using a hybrid-distribution system to identify relevant documents based on a search query. A group of documents is assigned to a particular segment. The group of documents is indexed both by atom and by document to form a reverse index and a forward index. Both indexes are divided amongst each node in that segment so that each node is responsible for storing and accessing a different portion of both the reverse and forward indexes. The reverse index portion is accessed on each of a first set of nodes to identify a first set of documents that is relevant to a particular search query. Document identifications associated with the first set of documents are used to identify a second set of nodes that access their forward index portions to limit the number of relevant documents to a second set of documents.
摘要翻译：提供了使用混合分发系统来基于搜索查询来识别相关文档的方法和系统。一组文档被分配给特定的段。文档组由原子和文档索引，以形成反向索引和前向索引。这两个索引在该段中的每个节点之间划分，使得每个节点负责存储和访问反向索引和前向索引的不同部分。在第一组节点中的每一个上访问反向索引部分，以标识与特定搜索查询相关的第一组文档。与第一组文档相关联的文档标识用于标识访问其前向索引部分的第二组节点，以将相关文档的数量限制为第二组文档。

4. 发明授权

US07827523B2 Query serving infrastructure providing flexible and expandable support and compiling instructions 有权
标题翻译：查询服务基础设施，提供灵活和可扩展的支持和编译说明
公开(公告)号：US07827523B2
公开(公告)日：2010-11-02
申请号：US11360793
申请日：2006-02-22
申请人： Nawaaz Ahmed , Robert L. Travis, Jr. , Chad P. Walters
发明人： Nawaaz Ahmed , Robert L. Travis, Jr. , Chad P. Walters
IPC分类号： G06F9/44 , G06F9/445
CPC分类号： G06F17/30587
摘要： A system and method for dynamically composing a class is provided. A query is parsed and a compiler object tree is generated that corresponds to the operators in the query. A set of feature requests and responses are initiated and a set of feature objects are generated that are executed at runtime. The language of the query may be extended by registering a new operator, and optionally a new feature for a query language, with a search engine without modifying the source code of the search engine. The new operator may be specified in a plug-in and provided to the search engine via the plug-in. An application converts an end user query into an application query that conforms to the query language supported by the search engine and includes the new operator. The application query may also include references to traditional programming constructs and search engine primitives.
摘要翻译：提供了一种用于动态组合类的系统和方法。解析查询，并生成与查询中的运算符相对应的编译器对象树。启动一组功能请求和响应，并生成一组在运行时执行的功能对象。可以通过向搜索引擎注册新的运算符以及可选的用于查询语言的新特征而不修改搜索引擎的源代码来扩展查询的语言。新的操作员可以在插件中指定并通过插件提供给搜索引擎。应用程序将最终用户查询转换为符合搜索引擎支持的查询语言的应用程序查询，并包含新的运算符。应用程序查询还可以包括对传统编程结构和搜索引擎原语的引用。

5. 发明授权

US5617552A Lossless data compression system and method 失效
标题翻译：无损数据压缩系统和方法
公开(公告)号：US5617552A
公开(公告)日：1997-04-01
申请号：US613433
申请日：1996-02-29
申请人： Jonathan F. Garber , Jorg A. Brown , Chad P. Walters
发明人： Jonathan F. Garber , Jorg A. Brown , Chad P. Walters
IPC分类号： G06F12/02 , G06T9/00 , H03M7/30 , H03M7/46 , G06F9/26 , G06F9/34 , G06F12/00
CPC分类号： G06T9/005 , G06F12/023 , H03M7/3084 , H03M7/46 , G06F2212/401
摘要： A lossless data compression system and method compresses a set of M data words stored in a computer memory. A first table stores data representing last occurrence positions among those of the M data words already processed for all distinct word values. A second table stores for each data word an entry indicating the position, if any, of a most recent prior occurrence of another data word with the same word value. A dictionary index indicates how many distinct data word values have been encountered during processing of M data words. The M data words are processed in in said M data words previously processed, identifying a longest sequence of data words starting with said each data word referencing said second table to identify data words earlier in said M data words than said each data word that match said each data word's value, identifying a longest sequence of data words earlier in said M data words than said data word which match an equal number of data words starting with said each data word, (B1) when said longest sequence's length is greater than one data word, outputting a run length code that indicates said longest sequence's length and position, and updating said first and second tables for the equal number of data words starting said each data word, and (B2) when said longest sequence's length is equal to one data word, outputting a code that indicates the position of said identified longest sequence, and updating said first and second tables for said each data word.
摘要翻译：无损数据压缩系统和方法压缩存储在计算机存储器中的一组M个数据字。第一表存储表示已针对所有不同字值处理的M个数据字的数据中的最后出现位置的数据。第二表存储每个数据字指示具有相同字值的另一数据字的最近先前出现的位置（如果有的话）的条目。词典索引表示在处理M个数据字期间遇到了多少不同的数据字值。在先前处理的所述M个数据字中处理M个数据字，识别从参考所述第二表的所述每个数据字开始的数据字的最长序列，以识别所述M个数据字之前的数据字，每个数据字的值，当所述最长序列的长度大于一个数据时，识别在所述M个数据字中较早的数据字的最长序列比所述数据字匹配从所述每个数据字开始的相等数目的数据字（B1）字，输出指示所述最长序列的长度和位置的游程长度码，以及对于所述每个数据字开始的相等数量的数据字，更新所述第一和第二表，以及（B2）当所述最长序列的长度等于一个数据时字，输出指示所述识别的最长序列的位置的代码，以及更新所述每个数据字的所述第一和第二表。

6. 发明授权

US08229730B2 Indexing role hierarchies for words in a search index 有权
标题翻译：索引搜索索引中单词的角色层次结构
公开(公告)号：US08229730B2
公开(公告)日：2012-07-24
申请号：US12201721
申请日：2008-08-29
申请人： Martin H. Van Den Berg , Giovanni L. Thione , Chad P. Walters , Richard S. Crouch
发明人： Martin H. Van Den Berg , Giovanni L. Thione , Chad P. Walters , Richard S. Crouch
IPC分类号： G06F17/30
CPC分类号： G06F17/2785 , G06F17/30684
摘要： Methods, systems and computer readable media for finding documents in a data store that match a natural language query submitted by a user are provided. The documents and queries are matched by determining that words within the query have the same relationship to each other as the same words in the document. Documents are semantically analyzed and words in the document are indexed along with the role the word plays in a sentence. The initial semantic role may be generalized using a role hierarchy and stored in the index along with the original role. A similar analysis may be used with the search query to find words used in the same role in both the query and the document.
摘要翻译：提供了用于在数据存储中查找与用户提交的自然语言查询匹配的文档的方法，系统和计算机可读介质。通过确定查询中的单词与文档中相同的单词之间具有相同的关系来匹配文档和查询。对文档进行语义分析，文档中的单词与该单词在一个句子中的作用一起编入索引。初始语义角色可以使用角色层次结构进行推广，并与原始角色一起存储在索引中。搜索查询可以使用类似的分析来查找在查询和文档中使用相同角色的单词。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式