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

21. 发明授权

US07720870B2 Method and system for quantifying the quality of search results based on cohesion 有权
标题翻译：基于凝聚力量化搜索结果质量的方法和系统
公开(公告)号：US07720870B2
公开(公告)日：2010-05-18
申请号：US11959182
申请日：2007-12-18
申请人： Luciano Barbosa , Flavio Junqueira , Vassilis Plachouras , Ricardo Baeza-Yates
发明人： Luciano Barbosa , Flavio Junqueira , Vassilis Plachouras , Ricardo Baeza-Yates
IPC分类号： G06F17/30
CPC分类号： G06F17/3069 , G06F17/30864
摘要： A method and system for quantifying the quality of search results from a search engine based on cohesion. The method and system include modeling a set of search engine search results as a cluster and measuring the cohesion of the cluster. In an embodiment, the cohesion of the cluster is the average similarity between the cluster elements to a centroid vector. The centroid vector is the average of the weights of the vectors of the cluster. The similarity between the centroid vector and the cluster's elements is the cosine similarity measure. Each document in the set of search results is represented by a vector where each cell of the vector represents a stemmed word. Each cell has a cell value which is the frequency of the corresponding stemmed word in a document multiplied by a weight that takes into account the location of the stemmed word within the document.
摘要翻译：一种用于量化基于内聚的搜索引擎的搜索结果的质量的方法和系统。该方法和系统包括将一组搜索引擎搜索结果建模为群集并测量群集的内聚。在一个实施例中，聚类的内聚性是聚类元素与质心向量之间的平均相似度。质心矢量是聚类向量权重的平均值。质心向量与簇的元素之间的相似度是余弦相似性度量。搜索结果集中的每个文档由向量表示，其中向量的每个单元表示一个被干扰的单词。每个单元格具有一个单元格值，该单元格值是文档中相应词干词的频率乘以一个考虑到文档中的词干词的位置的权重。

22. 发明授权

US08838576B2 Posting list intersection parallelism in query processing 有权
标题翻译：在查询处理中发布列表交集并行
公开(公告)号：US08838576B2
公开(公告)日：2014-09-16
申请号：US12577534
申请日：2009-10-12
申请人： Flavio Junqueira , Berkant Barla Cambazoglu , Vassilis Plachouras , Shirish Tatikonda
发明人： Flavio Junqueira , Berkant Barla Cambazoglu , Vassilis Plachouras , Shirish Tatikonda
IPC分类号： G06F17/30 , G06F7/00
CPC分类号： G06F17/30445
摘要： Disclosed herein is parallel processing of a query, which uses inter-query parallelism in posting list intersections. A plurality of tasks, e.g., posting list intersection tasks, are identified for processing in parallel by a plurality of processing units, e.g., a plurality of processing cores of a multi-core system.
摘要翻译：这里公开了一种查询的并行处理，其在发布列表交集中使用查询间并行性。通过多个处理单元（例如多核系统的多个处理核心）来并行处理多个任务，例如过帐列表交集任务。

23. 发明申请

US20100094853A1 SYSTEM AND METHODOLOGY FOR A MULTI-SITE SEARCH ENGINE 有权
标题翻译：多站点搜索引擎的系统和方法
公开(公告)号：US20100094853A1
公开(公告)日：2010-04-15
申请号：US12250929
申请日：2008-10-14
申请人： LUCA TELLOLI , Flavio Junqueria , Aristides Gionis , Vassilis Plachouras , Ricardo Baeza-Yates
发明人： LUCA TELLOLI , Flavio Junqueria , Aristides Gionis , Vassilis Plachouras , Ricardo Baeza-Yates
IPC分类号： G06F7/06 , G06F17/30
CPC分类号： G06F17/30864
摘要： Techniques for query processing in a multi-site search engine are described. During an indexing phase, each site of a multi-site search engine indexes a set of assigned web resources and each site calculates, for each term in the set of assigned web resources, a site-specific upper bound ranking score on the contribution of the term to the search engine ranking function for a query containing the term. During a propagation phase, all sites exchange their site-specific upper bound ranking scores with each other. In response to a site receiving a query, the site determines the set of locally matching resources and compares the ranking score of a locally matching resource with the site-specific upper bound ranking scores for the terms of the query that were received during the propagation phase and determines whether to communicate the query to other sites. By exchanging appropriately defined site-specific upper bound ranking scores, the site initially receiving the query can determine whether the locally matching resources would be identical to the resources obtained from a single-site search system without having to communicate the query to each of the other sites.
摘要翻译：描述了在多站点搜索引擎中查询处理的技术。在索引阶段期间，多站点搜索引擎的每个站点对一组分配的web资源进行索引，并且每个站点针对所分配的web资源集合中的每个术语来计算一个站点特定的上限排名分数用于包含该术语的查询的搜索引擎排名函数。在传播阶段，所有的站点彼此交换其站点特定的上限排名得分。响应于接收到查询的站点，站点确定本地匹配资源的集合，并将本地匹配资源的排名得分与在传播阶段期间接收到的查询的项的站点特定上限排名得分进行比较并确定是否将查询传递给其他站点。通过交换适当定义的站点特定上限排名得分，最初接收查询的站点可以确定本地匹配资源是否与从单站点搜索系统获得的资源相同，而不必将查询传递给其他每个网站。

24. 发明申请

US20170228377A1 System for Natural Language Interaction with Financial Data 审中-公开
公开(公告)号：US20170228377A1
公开(公告)日：2017-08-10
申请号：US15429483
申请日：2017-02-10
申请人： Vassilis Plachouras , Jochen Lothar Leidner , Charese Smiley , Hiroko Bretz
发明人： Vassilis Plachouras , Jochen Lothar Leidner , Charese Smiley , Hiroko Bretz
IPC分类号： G06F17/30 , G06F17/28 , G06F17/24
摘要： The present invention is directed toward a system for database querying using natural language generation, which comprises identifying a first set of entities corresponding to an indexed data set in response to a user query, generating a ranked list of query intents using the first set of entities, wherein each item of the list of query intents represents a second set of entities associated with the user query and iterating over the ranked list of query intents to identify a top ranked intent associated to one of a set of predefined query plans. The predefined query plan associated with the top rank intent is executed using the set of entities corresponding to the top ranked intent, the predefined query plan comprising one or more search actions against the indexed data set. A first set of results is then received and a description is generated and transmitted.

25. 发明授权

US07890488B2 System and method for caching posting lists 有权
标题翻译：用于缓存发布列表的系统和方法
公开(公告)号：US07890488B2
公开(公告)日：2011-02-15
申请号：US11868383
申请日：2007-10-05
申请人： Ricardo Baeza-Yates , Aristides Gionis , Flavio Junqueira , Vassilis Plachouras
发明人： Ricardo Baeza-Yates , Aristides Gionis , Flavio Junqueira , Vassilis Plachouras
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/3089
摘要： A method of caching posting lists to a search engine cache calculates the ratios between the frequencies of the query terms in a past query log and the sizes of the posting lists for each term, and uses these ratios to determine which posting lists should be cached by sorting the ratios in decreasing order and storing to the cache those posting lists corresponding to the highest ratio values. Further, a method of finding an optimal allocation between two parts of a search engine cache evaluates a past query stream based on a relationship between various properties of the stream and the total size of the cache, and uses this information to determine the respective sizes of both parts of the cache.
摘要翻译：将发布列表缓存到搜索引擎高速缓存中的方法计算过去查询日志中查询词语的频率与每个术语的发布列表的大小之间的比率，并使用这些比率来确定哪些过帐列表应该被缓存按照降序对比率进行排序，并将与最高比值相对应的发布列表存储到高速缓存。此外，在搜索引擎高速缓存的两部分之间找到最佳分配的方法基于流的各种属性与高速缓存的总大小之间的关系来评估过去的查询流，并且使用该信息来确定缓存的两个部分。

26. 发明申请

US20110087684A1 POSTING LIST INTERSECTION PARALLELISM IN QUERY PROCESSING 有权
标题翻译：查询处理中的列表列表交互并行列表
公开(公告)号：US20110087684A1
公开(公告)日：2011-04-14
申请号：US12577534
申请日：2009-10-12
申请人： Flavio Junqueira , Berkant Barla Cambazoglu , Vassilis Plachouras , Shirish Tatikonda
发明人： Flavio Junqueira , Berkant Barla Cambazoglu , Vassilis Plachouras , Shirish Tatikonda
IPC分类号： G06F17/30
CPC分类号： G06F17/30445
摘要： Disclosed herein is parallel processing of a query, which uses inter-query parallelism in posting list intersections. A plurality of tasks, e.g., posting list intersection tasks, are identified for processing in parallel by a plurality of processing units, e.g., a plurality of processing cores of a multi-core system.
摘要翻译：这里公开了一种查询的并行处理，其在发布列表交集中使用查询间并行性。通过多个处理单元（例如多核系统的多个处理核心）来并行处理多个任务，例如过帐列表交集任务。

27. 发明申请

US20090204753A1 SYSTEM FOR REFRESHING CACHE RESULTS 审中-公开
标题翻译：刷新缓存结果的系统
公开(公告)号：US20090204753A1
公开(公告)日：2009-08-13
申请号：US12028373
申请日：2008-02-08
申请人： William Havinden Bridge, JR. , Flavio P. Junqueira , Vassilis Plachouras
发明人： William Havinden Bridge, JR. , Flavio P. Junqueira , Vassilis Plachouras
IPC分类号： G06F12/00
CPC分类号： G06F12/123 , G06F12/122
摘要： A system and method for refreshing a cache based on query responses provided by a searching system in response to queries, includes providing a cache entry for each unique query, if space is available in the cache, and assigning a temperature value to each cache entry based on a frequency of occurrence of the corresponding query An age value is assigned to each cache entry based on a time of last refresh or creation of the corresponding query response. The age of the cache entries is periodically updated, and the temperature of a cache entry is updated when a corresponding query reoccurs. If system resources are available, the query response of a cache entry is refreshed based on the temperature and age of the cache entry. If resources are not available, the refreshing is limited.
摘要翻译：一种用于基于由搜索系统响应于查询而提供的查询响应来刷新高速缓存的系统和方法，包括为每个唯一查询提供高速缓存条目，如果高速缓存中有可用的空间，以及为每个高速缓存条目分配温度值在相应查询的发生频率上根据上次刷新的时间或相应的查询响应的创建将年龄值分配给每个高速缓存条目。周期性地更新缓存条目的时代，并且当对应的查询重新出现时，缓存条目的温度被更新。如果系统资源可用，则缓存条目的查询响应将根据缓存条目的温度和年龄进行刷新。如果资源不可用，刷新是有限的。

28. 发明申请

US20090157652A1 METHOD AND SYSTEM FOR QUANTIFYING THE QUALITY OF SEARCH RESULTS BASED ON COHESION 有权
标题翻译：基于联合搜索结果质量的方法和系统
公开(公告)号：US20090157652A1
公开(公告)日：2009-06-18
申请号：US11959182
申请日：2007-12-18
申请人： Luciano Barbosa , Flavio Junqueira , Vassilis Plachouras , Ricardo Baeza-Yates
发明人： Luciano Barbosa , Flavio Junqueira , Vassilis Plachouras , Ricardo Baeza-Yates
IPC分类号： G06F7/00
CPC分类号： G06F17/3069 , G06F17/30864
摘要： A method and system for quantifying the quality of search results from a search engine based on cohesion. The method and system include modeling a set of search engine search results as a cluster and measuring the cohesion of the cluster. In an embodiment, the cohesion of the cluster is the average similarity between the cluster elements to a centroid vector. The centroid vector is the average of the weights of the vectors of the cluster. The similarity between the centroid vector and the cluster's elements is the cosine similarity measure. Each document in the set of search results is represented by a vector where each cell of the vector represents a stemmed word. Each cell has a cell value which is the frequency of the corresponding stemmed word in a document multiplied by a weight that takes into account the location of the stemmed word within the document.
摘要翻译：一种用于量化基于内聚的搜索引擎的搜索结果的质量的方法和系统。该方法和系统包括将一组搜索引擎搜索结果建模为群集并测量群集的内聚。在一个实施例中，聚类的内聚性是聚类元素与质心向量之间的平均相似度。质心矢量是聚类向量权重的平均值。质心向量与簇的元素之间的相似度是余弦相似性度量。搜索结果集中的每个文档由向量表示，其中向量的每个单元表示一个被干扰的单词。每个单元格具有一个单元格值，该单元格值是文档中相应词干词的频率乘以一个考虑到文档中的词干词的位置的权重。

29. 发明申请

US20090094416A1 SYSTEM AND METHOD FOR CACHING POSTING LISTS 有权
标题翻译：用于登录位置的系统和方法
公开(公告)号：US20090094416A1
公开(公告)日：2009-04-09
申请号：US11868383
申请日：2007-10-05
申请人： Ricardo Baeza-Yates , Aristides Gionis , Flavio Junqueira , Vassilis Plachouras
发明人： Ricardo Baeza-Yates , Aristides Gionis , Flavio Junqueira , Vassilis Plachouras
IPC分类号： G06F12/00
CPC分类号： G06F17/3089
摘要： A method of caching posting lists to a search engine cache calculates the ratios between the frequencies of the query terms in a past query log and the sizes of the posting lists for each term, and uses these ratios to determine which posting lists should be cached by sorting the ratios in decreasing order and storing to the cache those posting lists corresponding to the highest ratio values. Further, a method of finding an optimal allocation between two parts of a search engine cache evaluates a past query stream based on a relationship between various properties of the stream and the total size of the cache, and uses this information to determine the respective sizes of both parts of the cache.
摘要翻译：将发布列表缓存到搜索引擎高速缓存中的方法计算过去查询日志中查询词语的频率与每个术语的发布列表的大小之间的比率，并使用这些比率来确定哪些过帐列表应该被缓存按照降序对比率进行排序，并将与最高比值相对应的发布列表存储到高速缓存。此外，在搜索引擎高速缓存的两部分之间找到最佳分配的方法基于流的各种属性与高速缓存的总大小之间的关系来评估过去的查询流，并且使用该信息来确定缓存的两个部分。

30. 发明申请

US20090094200A1 Method for Admission-controlled Caching 审中-公开
标题翻译：入门控制缓存的方法
公开(公告)号：US20090094200A1
公开(公告)日：2009-04-09
申请号：US11868396
申请日：2007-10-05
申请人： Ricardo Baeza-Yates , Flavio Junqueira , Vassilis Plachouras , Hans Friedrich Witschel
发明人： Ricardo Baeza-Yates , Flavio Junqueira , Vassilis Plachouras , Hans Friedrich Witschel
IPC分类号： G06F17/30
CPC分类号： G06F16/9574
摘要： A method of caching the results of a search engine query divides a search engine cache into two parts, controlled and uncontrolled, and determines, through an admission policy, to which part the query results should be cached. In one implementation, the admission policy estimates whether a query is likely to be frequent or infrequent in the future by analyzing various features of the query.
摘要翻译：一种缓存搜索引擎查询结果的方法将搜索引擎缓存分为控制和不受控制的两个部分，并通过准入策略确定应该缓存查询结果的哪个部分。在一个实现中，准入策略通过分析查询的各种特征来估计查询是否可能在将来频繁或不频繁。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式