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

US20120130997A1 HYBRID-DISTRIBUTION MODEL FOR SEARCH ENGINE INDEXES 有权
标题翻译：用于搜索引擎索引的混合分布模型
公开(公告)号：US20120130997A1
公开(公告)日：2012-05-24
申请号：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分类号： 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.
摘要翻译：提供了使用混合分发系统来基于搜索查询来识别相关文档的方法和系统。一组文档被分配给特定的段。文档组由原子和文档索引，以形成反向索引和前向索引。这两个索引在该段中的每个节点之间划分，使得每个节点负责存储和访问反向索引和前向索引的不同部分。在第一组节点中的每一个上访问反向索引部分，以标识与特定搜索查询相关的第一组文档。与第一组文档相关联的文档标识用于标识访问其前向索引部分的第二组节点，以将相关文档的数量限制为第二组文档。

3. 发明授权

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.
摘要翻译：为每个段选择初始段根和最终段根。每次接收到搜索查询时，都会识别将用于解析搜索查询的每个段中的一组节点。从该组节点中选择初始段根。基于节点集合中每个节点的统计数据，指示每个节点作为组合查询执行数据的最终段根的能力，初始段根算法选择最终段根。通知关于最终段根的身份的节点集合中的其他节点。

4. 发明申请

US20120130995A1 EFFICIENT FORWARD RANKING IN A SEARCH ENGINE 有权
标题翻译：在搜索引擎中有效的前进排名
公开(公告)号：US20120130995A1
公开(公告)日：2012-05-24
申请号：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分类号： G06F17/30
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.
摘要翻译：提供方法和计算机存储介质，用于为前向索引中的文档生成条目。除了与查询无关的静态特征之外，还收到文档及其文档标识。该文档被解析为令牌以形成与文档相对应的令牌流。识别用于计算文档排名的相关数据，并确定数据的位置。然后从文档标识，文档的令牌流，静态特征和相关数据的位置信息生成条目。条目存储在转发索引中。

5. 发明授权

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.
摘要翻译：搜索索引包括分层发布列表。搜索索引中的每个发布列表对应于不同的原子，并且包括包含特定文档的文档的列表。另外，存储一个等级，每个文档列在一个给定原子的发布列表中，表示原子与每个文档上下文的相关性。搜索索引中的至少一些发布列表是分层的。分层发布列表分为多个层级，层级由文档排序，而每层都由文档内部排序。在搜索索引中使用分层发布列表允许搜索引擎以允许多种效率和精确停止的方式来评估搜索查询。

6. 发明授权

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

7. 发明授权

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

8. 发明申请

US20120130996A1 TIERING OF POSTING LISTS IN SEARCH ENGINE INDEX 有权
标题翻译：搜索引擎索引中的定位列表
公开(公告)号：US20120130996A1
公开(公告)日：2012-05-24
申请号：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分类号： 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.
摘要翻译：搜索索引包括分层发布列表。搜索索引中的每个发布列表对应于不同的原子，并且包括包含特定文档的文档的列表。另外，存储一个等级，每个文档列在一个给定原子的发布列表中，表示原子与每个文档上下文的相关性。搜索索引中的至少一些发布列表是分层的。分层发布列表分为多个层级，层级由文档排序，而每层都由文档内部排序。在搜索索引中使用分层发布列表允许搜索引擎以允许多种效率和精确停止的方式来评估搜索查询。

9. 发明申请

US20050044524A1 Architectures for and methods of providing network-based software extensions 有权
标题翻译：提供基于网络的软件扩展的架构和方法
公开(公告)号：US20050044524A1
公开(公告)日：2005-02-24
申请号：US10953933
申请日：2004-09-29
申请人： Michael Murray , Paul Erickson , Oliver Fisher , Michael Hopcroft , Suryanarayanan Raman
发明人： Michael Murray , Paul Erickson , Oliver Fisher , Michael Hopcroft , Suryanarayanan Raman
IPC分类号： G06F3/00 , G06F9/44 , G06F9/445
CPC分类号： G06F9/44526
摘要： Methods and systems for network-based or Internet-based software delivery are described. In one embodiment, an application program or software platform resides on a client. The program or platform is configured so that it is extensible based on software extensions that are deliverable over a network such as the Internet. Various extensions can be developed by third party developers for incorporation into the program or platform. In the described embodiment, extension files that comprise a software extension are hosted on an Internet server. Additional files are also hosted on the Internet server and describe aspects of the software extension. These additional files include files that describe a logical attachment of the extension to the program or platform, as well as files that describe the location of the extension files. Extensions are incorporated on a client by navigating to a particular Internet site through which the extensions can be accessed. The files describing the extension files are downloaded on the client. These files tell the client where the particular extension is to be plugged in, as well as where to find the appropriate extension files and how to download them. The extension files are then downloaded and incorporated into the program or platform.
摘要翻译：描述了基于网络或基于互联网的软件交付的方法和系统。在一个实施例中，应用程序或软件平台驻留在客户机上。该程序或平台被配置为使得它可以基于可通过诸如因特网的网络传递的软件扩展来扩展。第三方开发人员可以开发各种扩展程序，以将其纳入程序或平台。在所描述的实施例中，包括软件扩展的扩展文件被托管在因特网服务器上。附加文件也托管在Internet服务器上，并描述了软件扩展的各个方面。这些附加文件包括描述扩展程序到程序或平台的逻辑附件的文件以及描述扩展文件位置的文件。扩展程序通过导航到可以访问扩展名的特定Internet站点而并入客户端。描述扩展文件的文件在客户端上下载。这些文件告诉客户端要插入特定扩展名的位置，以及在哪里找到相应的扩展文件以及如何下载它们。然后将扩展文件下载并并入程序或平台。

10. 发明授权

US6154215A Method and apparatus for maintaining multiple representations of a same scene in computer generated graphics 失效
标题翻译：用于在计算机生成的图形中维护相同场景的多个表示的方法和装置
公开(公告)号：US6154215A
公开(公告)日：2000-11-28
申请号：US910571
申请日：1997-08-01
申请人： Michael Hopcroft , Brian Cabral
发明人： Michael Hopcroft , Brian Cabral
IPC分类号： G06T11/20 , G06T15/00 , G06F17/00
CPC分类号： G06T11/206 , G06T15/00 , G06T2210/61
摘要： A method for creating and maintaining a dual scene graph for the display of a computer generated object. The user creates a user scene graph which has a number of node in a hierarchical organization which represents an object. This user scene graph is organized according to the dictates of the user for ease of human comprehension. The computer system automatically converts this user scene graph into a separate scene graph. The organization of this second scene graph is optimized so that the object can be rendered faster and more efficiently. Thereby, the first scene graph is displayed to the user so that the user can add, delete, or otherwise modify the object. Any changes made to the user scene graph are automatically made to the second scene graph, transparent to the user. The object is rendered for display according to the second scene graph.
摘要翻译：一种用于创建和维护用于显示计算机生成对象的双场景图的方法。用户创建一个用户场景图，它在分层组织中具有代表一个对象的多个节点。该用户场景图根据用户的要求进行组织以便于人的理解。计算机系统自动将该用户场景图转换为单独的场景图。优化了第二个场景图的组织，使得对象可以更快更有效地呈现。由此，向使用者显示第一场景图，使得用户能够添加，删除或以其他方式修改对象。对用户场景图形进行的任何更改都将自动进行到对用户透明的第二个场景图形。根据第二场景图形渲染对象进行显示。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式