专利快速检索-快速检索全球专利，免费商用专利数据库-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. 发明授权

US09529908B2 Tiering of posting lists in search engine index 有权
标题翻译：搜索引擎索引中的发布列表分层
公开(公告)号：US09529908B2
公开(公告)日：2016-12-27
申请号：US12951799
申请日：2010-11-22
申请人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi
发明人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30321 , G06F17/30011 , G06F17/3053 , G06F17/30864
摘要： A search index includes tiered posting lists. Each posting list in the search index corresponds with a different atom and includes a list of documents containing the particular document. Additionally, a rank is stored with each document listed in a posting list for a given atom representing the relevance of the atom to the context of each document. At least some of the posting lists in the search index are tiered. A tiered posting list is divided into a number of tiers with the tiers being ordered by document while each tier is internally ordered by document. Employing tiered posting lists within the search index allows a search engine to evaluate search queries in a manner that allows for a number of efficiencies and precise stopping.
摘要翻译：搜索索引包括分层发布列表。搜索索引中的每个发布列表对应于不同的原子，并且包括包含特定文档的文档的列表。另外，存储一个等级，每个文档列在一个给定原子的发布列表中，表示原子与每个文档上下文的相关性。搜索索引中的至少一些发布列表是分层的。分层发布列表分为多个层级，层级由文档排序，而每层都由文档内部排序。在搜索索引中使用分层发布列表允许搜索引擎以允许多种效率和精确停止的方式来评估搜索查询。

3. 发明授权

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.
摘要翻译：搜索结果通过多个阶段评估和修剪候选文件来识别和返回以响应搜索查询。该过程使用搜索索引来索引文档中找到的原子，并为文档/原子对预先计算分数。当接收到搜索查询时，从搜索查询中识别原子，并根据所识别的原子生成重新排列的查询。重新配置的查询用于识别匹配文档，并使用简单的评分函数和搜索索引中的预先计算的分数生成匹配文档的初步分数。基于初步分数修剪文档，并且使用最终排序算法评估剩余文档，该最终排名算法提供最终的排名文档集合，其用于生成搜索结果以响应于搜索查询而返回。

4. 发明授权

US08626781B2 Priority hash index 有权
标题翻译：优先哈希索引
公开(公告)号：US08626781B2
公开(公告)日：2014-01-07
申请号：US12980582
申请日：2010-12-29
申请人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Hui Shen
发明人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Hui Shen
IPC分类号： G06F7/00
CPC分类号： G06F17/30628
摘要： A priority hash index provides efficient lookup of posting lists for search query terms. The priority hash index is a data structure in which hash values for terms are distributed across multiple storage devices based on importance of the terms and access speeds of the storage devices. Terms are grouped into search lists with each search list including a storage location on each storage device. When a search query is received, a term is identified and hashed to a location on the first storage device and to generate a unique hash value for the term. The locations on the storage device for the term's search list are sequentially read until the hash value for the term is located to access the posting list for the term.
摘要翻译：优先哈希索引提供了有效查找搜索查询条款的发布列表。优先散列索引是一种数据结构，其中术语的哈希值基于存储设备的术语和访问速度的重要性在多个存储设备上分布。术语被分组到搜索列表中，每个搜索列表包括每个存储设备上的存储位置。当接收到搜索查询时，将对术语进行识别并将其散列到第一存储设备上的位置，并为该术语生成唯一的哈希值。顺序读取术语搜索列表的存储设备上的位置，直到该术语的哈希值位于访问该术语的发布列表。

5. 发明授权

US08478704B2 Decomposable ranking for efficient precomputing that selects preliminary ranking features comprising static ranking features and dynamic atom-isolated components 有权
标题翻译：选择具有静态排序特征和动态原子隔离组件的初步排名特征的有效预计算的可分级排名
公开(公告)号：US08478704B2
公开(公告)日：2013-07-02
申请号：US12951659
申请日：2010-11-22
申请人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Vishesh Parikh
发明人： Knut Magne Risvik , Michael Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi , Vishesh Parikh
IPC分类号： G06F17/00
CPC分类号： G06F17/3053 , G06F17/30864
摘要： Methods and computer storage media are provided for generating an algorithm used to provide preliminary rankings to candidate documents. A final ranking function that provides final rankings for documents is analyzed to identify potential preliminary ranking features, such as static ranking features that are query independent and dynamic atom-isolated components that are related to a single atom. Preliminary ranking features are selected from the potential preliminary ranking features based on many factors. Using these selected features, an algorithm is generated to provide a preliminary ranking to the candidate documents before the most relevant documents are passed to the final ranking stage.
摘要翻译：提供了方法和计算机存储介质，用于生成用于向候选文档提供初步排名的算法。分析提供文档最终排名的最终排名功能，以识别潜在的初步排名特征，例如与单个原子相关的独立查询和动态原子分离组件的静态排名特征。初步排名特征是从潜在的初步排名特征中选出的，基于很多因素。使用这些选择的特征，生成算法以在最相关文档被传递到最终排名阶段之前为候选文档提供初步排名。

6. 发明授权

US09195745B2 Dynamic query master agent for query execution 有权
标题翻译：动态查询主代理进行查询执行
公开(公告)号：US09195745B2
公开(公告)日：2015-11-24
申请号：US13072419
申请日：2011-03-25
申请人： Knut Magne Risvik , Michael Hopcroft , Karthik Kalyanaraman , Trishul Chilimbi , Henry Setiawan , Christopher W. Anderson
发明人： Knut Magne Risvik , Michael Hopcroft , Karthik Kalyanaraman , Trishul Chilimbi , Henry Setiawan , Christopher W. Anderson
IPC分类号： G06F7/00 , G06F17/30 , G06F17/00
CPC分类号： G06F17/30864 , G06F17/30194 , G06F17/30442 , G06F17/30463 , G06F17/30619
摘要： A preliminary segment root and a final segment root are selected for each segment. Each time a search query is received, a set of nodes in each segment that will be used to resolve the search query is identified. A preliminary segment root is selected from the set of nodes. Based on statistical data from each node in the set of nodes indicating each node's capability to act as a final segment root that assembles query-execution data, the preliminary segment root algorithmically selects the final segment root. The other nodes in the set of nodes are notified regarding the identity of the final segment root.
摘要翻译：为每个段选择初始段根和最终段根。每次接收到搜索查询时，都会识别将用于解析搜索查询的每个段中的一组节点。从该组节点中选择初始段根。基于节点集合中每个节点的统计数据，指示每个节点作为组合查询执行数据的最终段根的能力，初始段根算法选择最终段根。通知关于最终段根的身份的节点集合中的其他节点。

7. 发明授权

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.
摘要翻译：提供了使用混合分发系统来基于搜索查询来识别相关文档的方法和系统。一组文档被分配给特定的段。文档组由原子和文档索引，以形成反向索引和前向索引。这两个索引在该段中的每个节点之间划分，使得每个节点负责存储和访问反向索引和前向索引的不同部分。在第一组节点中的每一个上访问反向索引部分，以标识与特定搜索查询相关的第一组文档。与第一组文档相关联的文档标识用于标识访问其前向索引部分的第二组节点，以将相关文档的数量限制为第二组文档。

8. 发明授权

US09342582B2 Selection of atoms for search engine retrieval 有权
标题翻译：搜索引擎检索原子的选择
公开(公告)号：US09342582B2
公开(公告)日：2016-05-17
申请号：US13045278
申请日：2011-03-10
申请人： Knut Magne Risvik , Mike Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi
发明人： Knut Magne Risvik , Mike Hopcroft , John G. Bennett , Karthik Kalyanaraman , Trishul Chilimbi
IPC分类号： G06F17/30 , G06F7/00 , G06F17/00
CPC分类号： G06F17/30616 , G06F17/3002 , G06F17/30312
摘要： Methods are provided for populating search indexes with atoms identified in documents. Documents that are to be indexed are identified, and for each document, atoms are identified and are categorized as unigrams, n-grams, and n-tuples. A list of atom/document pairs is generated such that an information metric can be computed for each pair. An information metric represents a ranking of the atom in relation to the particular document. Based on the information metric, some atom/document pairs are discarded and others are indexed.
摘要翻译：提供了使用文档中标识的原子填充搜索索引的方法。识别要索引的文档，并且对于每个文档，原子被识别并被分类为单字组，n-gram和n元组。生成原子/文档对的列表，以便可以为每对计算信息度量。信息度量表示与特定文档相关的原子的排名。基于信息度量，一些原子/文档对被丢弃，其他的被索引。

9. 发明授权

US07926043B2 Data structure path profiling 有权
标题翻译：数据结构路径分析
公开(公告)号：US07926043B2
公开(公告)日：2011-04-12
申请号：US11425354
申请日：2006-06-20
申请人： Kapil Vaswani , Trishul Chilimbi
发明人： Kapil Vaswani , Trishul Chilimbi
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F11/3466 , G06F2201/865
摘要： The described technology provides data structure path profiling. An instrumented version of a program is created that calls a profiler runtime when pointer based data structures are allocated or accessed via pointers. A model of the heap is created and nodes in the model data structures are assigned unique identifiers. Paths traversed through the model data structures are assigned unique identifiers. The paths are counted in order to identify paths through the data structure model that are traversed frequently. The model is useful for providing information about high frequency data paths to the program developer and for various optimization purposes, such as prefetching and or increasing data locality during garbage collection.
摘要翻译：所描述的技术提供了数据结构路径分析。创建了一个程序的检测版本，当通过指针分配或访问基于指针的数据结构时，调用分析器运行时。创建堆的模型，并为模型数据结构中的节点分配唯一的标识符。遍历模型数据结构的路径被分配唯一的标识符。对路径进行计数，以便识别经过数据结构模型的路径。该模型对于向程序开发人员提供关于高频数据路径的信息以及各种优化目的是有用的，例如在垃圾收集期间预取和/或增加数据局部性。

10. 发明授权

US07587709B2 Adaptive instrumentation runtime monitoring and analysis 有权
标题翻译：自适应仪表运行时监控和分析
公开(公告)号：US07587709B2
公开(公告)日：2009-09-08
申请号：US10693834
申请日：2003-10-24
申请人： Trishul Chilimbi , Matthias Hauswirth
发明人： Trishul Chilimbi , Matthias Hauswirth
IPC分类号： G06F9/44
CPC分类号： G06F11/366 , G06F11/3636 , G06F11/3644
摘要： Techniques described herein provide low-overhead adaptive instrumentation runtime monitoring and analysis of software. A method of instrumenting a program to provide instrumentation data creates instrumentation versions comprising duplicate versions of original procedures in the program with instrumentation code for capturing instrumentation data, and adaptively decreases the sampling rate of the instrumented version of a procedure as the frequency of execution of the procedure increases. Additionally, the instrumentation methods can be used to build runtime tools that monitor the correctness of a program with very little overhead.
摘要翻译：本文描述的技术提供了低开销自适应仪器运行时间监控和软件分析。提供仪器仪表数据的程序的一种方法是创建仪器版本，包括程序中的原始程序的重复版本，其中包含用于捕获仪器数据的仪器代码，并自适应地将程序的检测版本的采样率降低为执行频率程序增加。此外，仪器方法可用于构建运行时工具，以极少的开销监视程序的正确性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式