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

1. 发明申请

US20110179017A1 DETECTING SPIKING QUERIES 有权
标题翻译：检测SPIKING QUERIES
公开(公告)号：US20110179017A1
公开(公告)日：2011-07-21
申请号：US12690184
申请日：2010-01-20
申请人： CHRISTOPHER AVERY MEYERS , GOPI PRASHANTH GOPAL , ANDREW PETER OAKLEY , NITIN AGRAWAL , NICHOLAS ERIC CRASWELL , MILAD SHOKOUHI , DERRICK LESLIE CONNELL , SANAZ AHARI , NEIL BRUCE SHARMAN , GAURAV SAREEN , HUGH EVAN WILLIAMS , JAY KUMAR GOYAL
发明人： CHRISTOPHER AVERY MEYERS , GOPI PRASHANTH GOPAL , ANDREW PETER OAKLEY , NITIN AGRAWAL , NICHOLAS ERIC CRASWELL , MILAD SHOKOUHI , DERRICK LESLIE CONNELL , SANAZ AHARI , NEIL BRUCE SHARMAN , GAURAV SAREEN , HUGH EVAN WILLIAMS , JAY KUMAR GOYAL
IPC分类号： G06F17/30 , G06F21/00 , G06Q30/00
CPC分类号： G06F17/30448 , G06Q30/0254
摘要： Methods, systems, and media are provided for identifying and clustering queries that are rising in popularity. Resultant clustered queries can be compared to other stored queries using textual and temporal correlations. Fresh indices containing information and results from recently crawled content sources are searched to obtain the most recent query activity. Historical indices are also searched to obtain temporally correlated information and results that match the clustered query stream. A weighted average acceleration of a spike can be calculated to distinguish between a legitimate spike and a non-legitimate spike. Legitimate clusters are combined with other stored clusters and presented as grouped content results to a user output device.
摘要翻译：提供了方法，系统和媒体，用于识别和聚集正在日益普及的查询。可以使用文本和时间相关性将所产生的聚类查询与其他存储的查询进行比较。搜索包含最近爬取的内容源的信息和结果的新索引以获取最近的查询活动。还搜索历史索引以获得与聚集查询流匹配的时间相关信息和结果。可以计算穗的加权平均加速度，以区分合法穗和非合法穗。合法集群与其他存储的集群组合，并以分组的内容结果呈现给用户输出设备。

2. 发明申请

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对象指定的相对位置来定位重载索引的部分，从而更新与修改的内容相对应的超载索引内的目标部分，而无需重写整个重载索引。定期地，调用关联过程以将合并的索引与用于搜索目的的重载索引进行分组。

3. 发明申请

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机器的不同处理器上单独运行。索引管理器的每个实例将查询与附加到该实例运行的处理器的内存中的索引块进行比较。因此，索引管理器的每个实例可以使用低延迟访问来将查询与索引的特定部分进行比较，从而提高搜索的效率。

4. 发明申请

US20090299962A1 DYNAMIC UPDATE OF A WEB INDEX 有权
标题翻译： WEB索引的动态更新
公开(公告)号：US20090299962A1
公开(公告)日：2009-12-03
申请号：US12127949
申请日：2008-05-28
申请人： PRATIBHA PERMANDLA , GAURAV SAREEN
发明人： PRATIBHA PERMANDLA , GAURAV SAREEN
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： Systems and methods are provided for regularly updating a web index with new or updated content, such as meta words or meta streams, for a particular web page address, such as a URL. Web page addresses and associated updated information, such as meta words, meta streams, values, and locations in the web index for those meta words are received. In order to update a web index, which is used by search engines to search web documents, a document identification is retrieved and associated with the updated information. As information in the web index is stored by document identification and not by web page addresses, the document identification may replace the web page address. Each meta word received is matched with corresponding document identifications and associated updated information, which creates an inverted format of the information. The web index may now be updated and stored by the system.
摘要翻译：提供了系统和方法，用于针对诸如URL的特定网页地址，定期更新具有新的或更新的内容（例如元字元或元流）的网络索引。接收网页地址和相关联的更新信息，例如元词，元流，值和这些元词的web索引中的位置。为了更新由搜索引擎用于搜索web文档的web索引，检索文档标识并与更新的信息相关联。由于web索引中的信息是通过文档标识而不是通过网页地址来存储的，所以文档标识可以替换网页地址。接收的每个元字符与相应的文档标识和相关联的更新信息匹配，这创建了信息的反向格式。网络索引现在可以被系统更新和存储。

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

US08306964B2 Extraction of rich search information from index servers via an alternative asynchronous data path 有权
标题翻译：通过备用异步数据路径从索引服务器提取丰富的搜索信息
公开(公告)号：US08306964B2
公开(公告)日：2012-11-06
申请号：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.
摘要翻译：本文描述的搜索引擎系统提供用于收集由索引服务器提供的结果的替代数据路径。替代数据路径以直接和异步的方式收集结果; 这与用于通过一个或多个聚合器模块向最终用户传递搜索结果的同步路径形成对比。分析系统可以使用替代数据路径来收集关于搜索引擎系统的性能的大量富描述性信息，以避免由同步数据路径施加的瓶颈和其他约束。分析系统可以分析从索引服务器收集的信息，提高搜索引擎系统的性能。

8. 发明授权

US08135723B2 Leveraging low-latency memory access 有权
标题翻译：利用低延迟内存访问
公开(公告)号：US08135723B2
公开(公告)日：2012-03-13
申请号：US12269877
申请日：2008-11-12
申请人： Kushagra V. Vaid , Gaurav Sareen
发明人： Kushagra V. Vaid , Gaurav Sareen
IPC分类号： G06F7/00
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机器的不同处理器上单独运行。索引管理器的每个实例将查询与附加到该实例运行的处理器的内存中的索引块进行比较。因此，索引管理器的每个实例可以使用低延迟访问来将查询与索引的特定部分进行比较，从而提高搜索的效率。

9. 发明申请

US20120059806A1 UPDATING AN INVERTED INDEX IN A REAL TIME FASHION 有权
标题翻译：在实时更新反转索引
公开(公告)号：US20120059806A1
公开(公告)日：2012-03-08
申请号：US13292793
申请日：2011-11-09
申请人： 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对象指定的相对位置来定位重载索引的部分，从而更新与修改的内容相对应的超载索引内的目标部分，而无需重写整个重载索引。定期地，调用关联过程以将合并的索引与用于搜索目的的重载索引进行分组。

10. 发明授权

US07797298B2 Serving cached query results based on a query portion 有权
标题翻译：根据查询部分提供缓存的查询结果
公开(公告)号：US07797298B2
公开(公告)日：2010-09-14
申请号：US11363895
申请日：2006-02-28
申请人： Gaurav Sareen , Michael Acheson Isard , Yinzhe Yu , Girish Kumar
发明人： Gaurav Sareen , Michael Acheson Isard , Yinzhe Yu , Girish Kumar
IPC分类号： G06F17/30 , G06F15/16
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.
摘要翻译：这些实施例考虑了用于获得查询的一部分的相关结果以及用于为服务器的高速缓存生成更新的一组查询的系统和方法。可以从包括服务器高速缓存和一组常见查询的数据结构中识别并获得从查询部分开始的其他查询。一旦识别出其他查询，则从服务器缓存或后端数据库获取其他查询的结果。可以使用一组常见查询（可以包括删除的和附加的查询）来生成针对服务器的更新的查询集合。基于分配功能可能属于服务器的丢失查询和已删除查询都将被插入到队列中，该队列稍后会传递到服务器的缓存。传输可能在低活动或空闲状态期间发生。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式