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

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

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. 发明授权

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元组。生成原子/文档对的列表，以便可以为每对计算信息度量。信息度量表示与特定文档相关的原子的排名。基于信息度量，一些原子/文档对被丢弃，其他的被索引。

7. 发明申请

US20130286053A1 DIRECT VIEW AUGMENTED REALITY EYEGLASS-TYPE DISPLAY 审中-公开
标题翻译：直接查看已实现的眼镜型显示
公开(公告)号：US20130286053A1
公开(公告)日：2013-10-31
申请号：US13720905
申请日：2012-12-19
申请人： Rod G. Fleck , Andreas G. Nowatzyk , John G. Bennett
发明人： Rod G. Fleck , Andreas G. Nowatzyk , John G. Bennett
IPC分类号： G09G5/377 , G09G3/32 , G09G5/10
CPC分类号： G09G5/377 , G02B27/0176 , G02B2027/0163 , G03B21/20 , G09G3/3208 , G09G5/10
摘要： A low-power, high-resolution, see-through (i.e., “transparent”) augmented reality (AR) display without projectors with relay optics separate from the display surface but instead feature a small size, low power consumption, and/or high quality images (high contrast ratio). The AR display comprises sparse integrated light-emitting diode (iLED) array configurations, transparent drive solutions, and polarizing optics or time multiplexed lenses to combine virtual iLED projection images with a user's real world view. The AR display may also feature full eye-tracking support in order to selectively utilize only the portions of the display(s) that will produce only projection light that will enter the user's eye(s) (based on the position of the user's eyes at any given moment of time) in order to achieve power conservation.
摘要翻译：低功率，高分辨率，透视（即“透明”）增强现实（AR）显示，而不具有与显示表面分离的中继光学器件的投影仪，而是具有小尺寸，低功耗和/或高优质图像（高对比度）。 AR显示器包括稀疏集成发光二极管（iLED）阵列配置，透明驱动解决方案和偏振光学器件或时间复用镜头，以将虚拟iLED投影图像与用户的真实世界视图相结合。 AR显示器还可以具有完全的眼睛跟踪支持，以便仅选择性地仅利用将仅产生将进入用户眼睛的投影光的显示器的部分（基于用户的眼睛的位置）任何给定的时刻），以实现节电。

8. 发明授权

US5913217A Generating and compressing universally unique identifiers (UUIDs) using counter having high-order bit to low-order bit 失效
标题翻译：使用具有高位到低位的计数器生成和压缩普遍唯一的标识符（UUID）
公开(公告)号：US5913217A
公开(公告)日：1999-06-15
申请号：US885115
申请日：1997-06-30
申请人： Jeffrey H. Alger , John G. Bennett , David A. Marshall , David R. Shutt
发明人： Jeffrey H. Alger , John G. Bennett , David A. Marshall , David R. Shutt
IPC分类号： G06F17/30
CPC分类号： G06F17/30949 , Y10S707/99931 , Y10S707/99942
摘要： A computer-based method and system for generating and compressing a plurality of universally unique identifiers (UUIDs). The bits of the UUIDs are ordered from left to right. The system maintains a counter with bits ordered from a high-order bit to a low-order bit. To generate a UUID, the system increments the counter. The system then sets the right-most bits of the UUID to a node identifier, sets the next right-most bits of the UUID to a clock sequential/variant value, and sets the left-most bits of the UUID to the bits of the counter wherein the left-most bit of the UUID is set to the lowest-order bit of the counter so that sequentially generated UUIDs tend to have the same values in their right-most bits. The system then compresses these UUIDs using a suffix compression technique.
摘要翻译：一种用于生成和压缩多个通用唯一标识符（UUID）的基于计算机的方法和系统。 UUID的位从左到右排列。系统维护一个计数器，其中从高位到低位的顺序排列。要生成UUID，系统会增加计数器。然后，系统将UUID的最右侧的位设置为节点标识符，将UUID的下一个最右位设置为时钟顺序/变量值，并将UUID的最左位设置为计数器，其中UUID的最左位被设置为计数器的最低位，使得顺序生成的UUID在其最右位中倾向于具有相同的值。然后，系统使用后缀压缩技术来压缩这些UUID。

9. 发明授权

US08850103B2 Interruptible NAND flash memory 有权
标题翻译：中断NAND闪存
公开(公告)号：US08850103B2
公开(公告)日：2014-09-30
申请号：US12549897
申请日：2009-08-28
申请人： John G. Bennett
发明人： John G. Bennett
IPC分类号： G06F12/00 , G06F13/00 , G06F13/28 , G11C16/32 , G11C16/26 , G11C7/22 , G11C16/16 , G11C16/10 , G11C11/56 , G11C16/04
CPC分类号： G11C16/10 , G11C7/22 , G11C11/5621 , G11C16/0483 , G11C16/16 , G11C16/26 , G11C16/32 , G11C2216/20
摘要： A NAND flash memory logical unit. The NAND flash memory logical unit includes a control circuit that responds to commands and permits program and/or erase commands to be interruptible by read commands. The control circuit includes a set of internal registers for performing the current command, and a set of external registers for receiving commands. The control circuit also includes a set of supplemental registers that allow the NAND flash memory logical unit to have redundancy to properly hold state of an interrupted program or erase command. When the interrupted program or erase command is to resume, the NAND flash memory logical unit thus can quickly resume the paused program or erase operation. This provides significant improvement to read response times in the context of a NAND flash memory logical unit.
摘要翻译： NAND闪存逻辑单元。 NAND闪速存储器逻辑单元包括控制电路，其响应命令并允许通过读取命令中断的程序和/或擦除命令。该控制电路包括用于执行电流指令的一组内部寄存器和用于接收命令的一组外部寄存器。控制电路还包括一组补充寄存器，其允许NAND闪存逻辑单元具有冗余以适当地保持中断的程序或擦除命令的状态。当中断的程序或擦除命令恢复时，NAND闪速存储器逻辑单元可以快速恢复暂停的程序或擦除操作。这在NAND闪速存储器逻辑单元的上下文中对读取响应时间提供了显着的改进。

10. 发明授权

US06219675B1 Distribution of a centralized database 失效
标题翻译：分发中央数据库
公开(公告)号：US06219675B1
公开(公告)日：2001-04-17
申请号：US08869588
申请日：1997-06-05
申请人： Shankar Pal , John G. Bennett
发明人： Shankar Pal , John G. Bennett
IPC分类号： G06F1730
CPC分类号： G06F17/30362 , Y10S707/99931 , Y10S707/99933 , Y10S707/99938 , Y10S707/99952 , Y10S707/99953
摘要： A system that improves performance of a centralized DBMS is provided. The improved performance is realized by distributing part of the DBMS's functionality across multiple computers in a client/server environment. The distribution of the DBMS's functionality is performed by a mechanism known as the navigational agent, which is detached from the DBMS. The navigational agent integrates the centralized DBMS into a client/server environment so that performance improvements can be achieved by distributing a portion of the functionality of the centralized DBMS and some of its database objects to client computers. A database object is a unit of data in the database such as one or more fields of a record, one or more records, or one or more tables. By distributing part of the DBMS's functionality and some of the database objects to client computers, transactions can be performed on the client computers without having to access the server computer on which the database resides. Since these transactions are performed by the client computer instead of the server computer, the bottleneck created by the DBMS on the server computer is reduced, which improves performance of both the DBMS and programs interacting with the DBMS.
摘要翻译：提供了一种提高集中DBMS性能的系统。通过在客户机/服务器环境中的多个计算机上分发部分DBMS的功能来实现改进的性能。 DBMS的功能的分发由称为导航代理的机制执行，该机制与DBMS分离。导航代理将集中式DBMS集成到客户端/服务器环境中，以便通过将集中式DBMS及其部分数据库对象的功能部分分发到客户端计算机来实现性能改进。数据库对象是数据库中的数据单元，例如记录，一个或多个记录或一个或多个表的一个或多个字段。通过将DBMS的一部分功能和一些数据库对象分发到客户端计算机，可以在客户端计算机上执行事务，而无需访问数据库所在的服务器计算机。由于这些事务是由客户端计算机而不是服务器计算机执行的，因此减少了DBMS在服务器计算机上创建的瓶颈，从而提高DBMS和与DBMS交互的程序的性能。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式