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

1. 发明授权

US07680789B2 Indexing and searching numeric ranges 有权
标题翻译：索引和搜索数字范围
公开(公告)号：US07680789B2
公开(公告)日：2010-03-16
申请号：US11334302
申请日：2006-01-18
申请人： Gaurav Sareen , Michael A. Isard
发明人： Gaurav Sareen , Michael A. Isard
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30613 , G06F17/30864 , Y10S707/99936
摘要： Index entries representing ranges of values are queried with a query value to determine if the query value is in one of the ranges. Numeric ranges are represented in an index and queries are constructed to match index entries. Search terms are constructed from the query value, such that a search term matches an index entry if and only if the queried for valued is in the range represented by the index entry. To facilitate querying the indexes, queries are constructed to contain search terms having a data structure format similar to that of the index entries.
摘要翻译：使用查询值查询表示值范围的索引条目，以确定查询值是否在其中一个范围内。数字范围在索引中表示，并且构造查询以匹配索引条目。搜索项是从查询值构造的，使得当且仅当被查询的值在索引条目表示的范围内时，搜索项与索引条目匹配。为了便于查询索引，构造查询以包含具有与索引条目类似的数据结构格式的搜索项。

2. 发明授权

US07730058B2 Searching for information utilizing a probabilistic detector 失效
标题翻译：使用概率检测器搜索信息
公开(公告)号：US07730058B2
公开(公告)日：2010-06-01
申请号：US11243924
申请日：2005-10-05
申请人： Gaurav Sareen , Mark Steven Manasse , Martin Abadi , Michael A. Isard
发明人： Gaurav Sareen , Mark Steven Manasse , Martin Abadi , Michael A. Isard
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30687
摘要： A probabilistic detector is utilized to query a database. Utilization of a probabilistic detector provides assurance with 100 per cent probability that a search expression in the query is not in the database index. The probabilistic detector is implemented in the form of a Bloom filter. The probabilistic detector is created by hashing expressions in the database index and mapping the resulting hash values into the probabilistic detector. Upon receiving a query, expressions of the query are hashed. The probabilistic detector is queried using these hash values. If the results of querying the probabilistic detector indicate that searched for information may be in the database, the database is not queried. If the results of querying the probabilistic detector indicate that the information may be in the database, the database is queried for the information using the original query. This technique is advantageous in mitigating detrimental effects of denial of service attacks.
摘要翻译：利用概率检测器查询数据库。概率检测器的利用率提供了100％的可能性，即查询中的搜索表达式不在数据库索引中。概率检测器以Bloom滤波器的形式实现。概率检测器是通过在数据库索引中散列表达式并将生成的散列值映射到概率检测器中创建的。在接收到查询后，查询的表达式将被哈希。使用这些散列值查询概率检测器。如果查询概率检测器的结果表明搜索到的信息可能在数据库中，则不会查询数据库。如果查询概率检测器的结果表明信息可能在数据库中，则使用原始查询查询数据库中的信息。这种技术有利于减轻拒绝服务攻击的有害影响。

3. 发明申请

US20100205160A1 UPDATING AN INVERTED INDEX IN A REAL TIME FASHION 有权
标题翻译：在实时更新反转索引
公开(公告)号：US20100205160A1
公开(公告)日：2010-08-12
申请号：US12368771
申请日：2009-02-10
申请人： ABHAS KUMAR , Pratibha Permandla , Gaurav Sareen , Anna Timasheva , Deepak Shankar
发明人： ABHAS KUMAR , Pratibha Permandla , Gaurav Sareen , Anna Timasheva , Deepak Shankar
IPC分类号： G06F17/30
CPC分类号： G06F17/30336 , G06F17/30613
摘要： Systems and methods for regularly updating portions of a merged index are provided. Initially, upon receiving an indication that modifications have occurred to content of web-based documents, dynamic update of index (DUI) objects that identify the documents and expose the modified content are composed by ascertaining relative positions of the modified content within the documents, and packaging identifiers of the documents, the relative positions, and metadata underlying the modified content into a message. The DUI objects are applied to an overloading index that maintains structured records of recent modifications. In particular, portions of the overloading index are targeted utilizing the document identifiers and the relative positions specified by the DUI object, thereby updating the targeted portions within the overloading index corresponding to the modified content without rewriting the entire overloading index. Periodically, an association process is invoked for grouping the merged index with the overloading index for search purposes.
摘要翻译：提供了用于定期更新合并索引的部分的系统和方法。最初，在接收到对基于web的文档的内容进行修改的指示时，通过确定文档中修改的内容的相对位置来构成标识文档和公开修改的内容的索引（DUI）对象的动态更新，以及将文档的标识符，相对位置和修改内容的元数据包装到消息中。 DUI对象应用于维护最近修改的结构化记录的重载索引。特别地，使用文档标识符和DUI对象指定的相对位置来定位重载索引的部分，从而更新与修改的内容相对应的超载索引内的目标部分，而无需重写整个重载索引。定期地，调用关联过程以将合并的索引与用于搜索目的的重载索引进行分组。

4. 发明申请

US20100121865A1 LEVERAGING LOW-LATENCY MEMORY ACCESS 有权
标题翻译：引导低延迟存储器访问
公开(公告)号：US20100121865A1
公开(公告)日：2010-05-13
申请号：US12269877
申请日：2008-11-12
申请人： Kushagra V. Vaid , Gaurav Sareen
发明人： Kushagra V. Vaid , Gaurav Sareen
IPC分类号： G06F17/30 , G06F9/46
CPC分类号： G06F17/30979 , G06F9/5066
摘要： Computational units of any task may run in different silos. In an embodiment, a search query may be evaluated efficiently on a non-uniform memory architecture (NUMA) machine, by assigning separate chunks of the index to separate memories. In a NUMA machine, each socket has an attached memory. The latency time is low or high, depending on whether a processor accesses data in its attached memory or a different memory. Copies of an index manager program, which compares a query to an index, run separately on different processors in a NUMA machine. Each instance of the index manager compares the query to the index chunk in the memory attached to the processor on which that instance is running. Thus, each instance of the index manager may compare a query to a particular portion of the index using low-latency accesses, thereby increasing the efficiency of the search.
摘要翻译：任何任务的计算单位都可以运行在不同的仓库中。在一个实施例中，可以在非均匀存储器架构（NUMA）机器上有效地评估搜索查询，通过将分离的分离的分块分配给分离的存储器。在NUMA机器中，每个插座都有一个附加的内存。延迟时间为低或高，这取决于处理器是否访问其附加存储器中的数据或不同的存储器。将查询与索引进行比较的索引管理器程序的副本在NUMA机器的不同处理器上单独运行。索引管理器的每个实例将查询与附加到该实例运行的处理器的内存中的索引块进行比较。因此，索引管理器的每个实例可以使用低延迟访问来将查询与索引的特定部分进行比较，从而提高搜索的效率。

5. 发明申请

US20080177717A1 SUPPORT FOR REVERSE AND STEMMED HIT-HIGHLIGHTING 失效
标题翻译：支持反向和STELEED HIT-LIGHTING
公开(公告)号：US20080177717A1
公开(公告)日：2008-07-24
申请号：US11625076
申请日：2007-01-19
申请人： Girish Kumar , Bhuvan Middha , Gaurav Sareen , Janine Crumb , Jason Douglas , Silviu Petru Cucerzan
发明人： Girish Kumar , Bhuvan Middha , Gaurav Sareen , Janine Crumb , Jason Douglas , Silviu Petru Cucerzan
IPC分类号： G06F7/00
CPC分类号： G06F17/3064 , Y10S707/99933
摘要： Computerized methods and systems for generating a suggested query list with suggested search terms displayed as highlighted text utilizing a user-defined query are provided. Query search terms are received by a user-interface display. Upon inputting query search terms, the user-interface automatically generates a suggested query list. The suggested query list is associated with the query search term and the suggested query list is comprised of at least one suggested search term. A query suggestion architecture determines if the query search term and the suggested search term are a match, and if so, highlights the suggested search term that is not a match. The user interface displays the highlighted terms to assist in refining a search. The present invention further provides a stemming algorithm that extracts the root form of the query search term.
摘要翻译：提供了用于生成建议的查询列表的计算机化方法和系统，其中建议的搜索项使用用户定义的查询显示为突出显示的文本。查询搜索项由用户界面显示接收。输入查询搜索项后，用户界面自动生成建议的查询列表。建议的查询列表与查询搜索项相关联，并且建议的查询列表由至少一个建议的搜索项组成。查询建议体系结构确定查询搜索词和建议的搜索词是否匹配，如果是，则突出显示不符合的建议搜索词。用户界面显示突出显示的术语，以帮助改进搜索。本发明还提供一种提取查询搜索项的根形式的词干化算法。

6. 发明申请

US20070203890A1 Serving cached query results based on a query portion 有权
标题翻译：根据查询部分提供缓存的查询结果
公开(公告)号：US20070203890A1
公开(公告)日：2007-08-30
申请号：US11363895
申请日：2006-02-28
申请人： Gaurav Sareen , Michael Isard , Yinzhe Yu , Girish Kumar
发明人： Gaurav Sareen , Michael Isard , Yinzhe Yu , Girish Kumar
IPC分类号： G06F17/30
CPC分类号： G06F17/30902
摘要： The embodiments contemplate a system and method for obtaining related results for a portion of a query and for generating an updated set of queries for a cache of a server. Other queries beginning with the portion of the query may be identified and obtained from a data structure that includes a server cache and a set of common queries. Once the other queries are identified, results for the other queries are obtained from the server cache or from a back-end database. A set of common queries, which may include deleted and additional queries, may be utilized to generate the updated set of queries for the server. Both missing queries and deleted queries that may belong to the server based on an assignment function are inserted into a queue, which is later delivered to the cache of the server. The transfer may occur during a low-activity or idle state.
摘要翻译：这些实施例考虑了用于获得查询的一部分的相关结果并且为服务器的高速缓存生成更新的一组查询的系统和方法。可以从包括服务器高速缓存和一组常见查询的数据结构中识别并获得从查询部分开始的其他查询。一旦识别出其他查询，则从服务器缓存或后端数据库获取其他查询的结果。可以使用一组常见查询（可以包括删除的和附加的查询）来生成针对服务器的更新的查询集合。基于分配功能可能属于服务器的丢失查询和已删除查询都将被插入到队列中，该队列稍后会传递到服务器的缓存。传输可能在低活动或空闲状态期间发生。

7. 发明授权

US08458207B2 Using anchor text to provide context 有权
标题翻译：使用锚文本提供上下文
公开(公告)号：US08458207B2
公开(公告)日：2013-06-04
申请号：US11522227
申请日：2006-09-15
申请人： Girish Kumar , Gaurav Sareen , Namita Gupta , Charles Lester Alexander Clark , Junhua Wang
发明人： Girish Kumar , Gaurav Sareen , Namita Gupta , Charles Lester Alexander Clark , Junhua Wang
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30528 , G06F17/30864
摘要： A search engine can provide referencing information as context for a particular search result when an excerpt from the search result, comprising at least some similar elements to the user's query, is not generated. Referencing information can include one or more anchor texts having similarity to at least some elements of the user's query, the anchor texts being used by referencing pages to link to the page returned as a search result. User selection of the anchor text can enable the user to visit a referencing page using that anchor text to link to the page returned as a search result, and having a high static rank.
摘要翻译：当搜索结果的摘录（包括至少一些与用户的查询相似的元素）不被生成时，搜索引擎可以提供作为特定搜索结果的上下文的引用信息。引用信息可以包括与用户的查询的至少一些元素具有相似性的一个或多个锚定文本，通过引用链接到页面返回的搜索结果来使用锚定文本。锚文本的用户选择可以使得用户能够使用该锚文本访问引用页面，以链接到作为搜索结果返回的页面，并具有高静态等级。

8. 发明授权

US08239391B2 Hierarchical merging for optimized index 有权
标题翻译：分层合并优化索引
公开(公告)号：US08239391B2
公开(公告)日：2012-08-07
申请号：US12835396
申请日：2010-07-13
申请人： Jay Kumar Goyal , Neil Sharman , Vibhaakar Sharma , Vinay Sudhir Deshpande , Utkarsh Jain , Gaurav Sareen , Yinzhe Yu , Daniel Yuan
发明人： Jay Kumar Goyal , Neil Sharman , Vibhaakar Sharma , Vinay Sudhir Deshpande , Utkarsh Jain , Gaurav Sareen , Yinzhe Yu , Daniel Yuan
IPC分类号： G06F7/00
CPC分类号： G06F17/30619
摘要： Methods, systems, and media are provided for an optimized search engine index. The optimized index is formed by merging small lower level indexes of fresh documents together into a hierarchical cluster of multiple higher level indexes. The optimized index of fresh documents is formed via a single threaded process, while a fresh index serving platform concurrently serves fresh queries. The hierarchy of higher level indexes is formed by merging lower and/or higher level indexes with similar expiration times together. Therefore, as some indexes expire, the remaining un-expired indexes can be re-used and merged with new incoming indexes. The single threaded process provides fast serving of fresh documents, while also providing time to integrate the fresh indexes into a long term primary search engine index, prior to expiring.
摘要翻译：为优化的搜索引擎索引提供了方法，系统和媒体。优化指标是通过将新鲜文件的小型较低级别索引合并成多个较高级别索引的分层集群形成的。新鲜文件的优化索引通过单线程过程形成，而新的索引服务平台同时提供新查询。通过将低级和/或高级索引与相似的过期时间合并在一起形成较高级索引的层次。因此，当某些索引到期时，剩余的未过期索引可以重新使用，并与新的传入索引合并。单线程进程提供快速提供的新鲜文档，同时还提供了将新鲜索引整合到长期主要搜索引擎索引中的时间，然后才能到期。

9. 发明授权

US08180790B2 Search macro suggestions relevant to search queries 有权
标题翻译：搜索与搜索查询相关的宏建议
公开(公告)号：US08180790B2
公开(公告)日：2012-05-15
申请号：US12716871
申请日：2010-03-03
申请人： Gaurav Sareen , Raghavendra Vinayak Prabhu , Yofay Kari Lee
发明人： Gaurav Sareen , Raghavendra Vinayak Prabhu , Yofay Kari Lee
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/3064 , G06F17/30864
摘要： Search macros suggestions are provided to refine a user's search. When a search query is received from an end user, one or more search macros are determined to be relevant to the search query. The search macros are then provided to the end user as suggestions for refining the user's search. In some instances, the end user may chose to select one of the suggested search macros. A search is then performed using the search query and the selected search macro to provide search results to the end user that may be more relevant to the user's search.
摘要翻译：提供搜索宏建议，以改善用户的搜索。当从最终用户接收到搜索查询时，一个或多个搜索宏被确定为与搜索查询相关。然后，将搜索宏提供给最终用户，作为改进用户搜索的建议。在某些情况下，最终用户可以选择选择一个建议的搜索宏。然后使用搜索查询和所选择的搜索宏来执行搜索，以向最终用户提供可能与用户搜索更相关的搜索结果。

10. 发明申请

US20120023093A1 EXTRACTION OF RICH SEARCH INFORMATION FROM INDEX SERVERS VIA AN ALTERNATIVE ASYNCHRONOUS DATA PATH 有权
标题翻译：通过替代异步数据路径从索引服务器提取丰富的搜索信息
公开(公告)号：US20120023093A1
公开(公告)日：2012-01-26
申请号：US12840281
申请日：2010-07-20
申请人： Yinzhe Yu , Qinghua Zou , Pei Pei , Gaurav Sareen , Wee Wah Alfian Tan
发明人： Yinzhe Yu , Qinghua Zou , Pei Pei , Gaurav Sareen , Wee Wah Alfian Tan
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： A search engine system is described herein that provides an alternative data path for collecting results provided by index servers. The alternative data path collects the results in a direct and asynchronous manner; this is in contrast to a synchronous path used to deliver search results to end users via one or more aggregator modules. An analysis system can use the alternative data path to collect a large amount of richly descriptive information regarding the performance of the search engine system, circumventing bottlenecks and other constraints that would otherwise be imposed by the synchronous data path. The analysis system can analyze the information collected from the index servers to improve the performance of the search engine system.
摘要翻译：本文描述的搜索引擎系统提供用于收集由索引服务器提供的结果的替代数据路径。替代数据路径以直接和异步的方式收集结果; 这与用于通过一个或多个聚合器模块向最终用户传递搜索结果的同步路径形成对比。分析系统可以使用替代数据路径来收集关于搜索引擎系统的性能的大量富描述性信息，以避免由同步数据路径施加的瓶颈和其他约束。分析系统可以分析从索引服务器收集的信息，提高搜索引擎系统的性能。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式