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

1. 发明授权

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.
摘要翻译：一种用于量化基于内聚的搜索引擎的搜索结果的质量的方法和系统。该方法和系统包括将一组搜索引擎搜索结果建模为群集并测量群集的内聚。在一个实施例中，聚类的内聚性是聚类元素与质心向量之间的平均相似度。质心矢量是聚类向量权重的平均值。质心向量与簇的元素之间的相似度是余弦相似性度量。搜索结果集中的每个文档由向量表示，其中向量的每个单元表示一个被干扰的单词。每个单元格具有一个单元格值，该单元格值是文档中相应词干词的频率乘以一个考虑到文档中的词干词的位置的权重。

2. 发明申请

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.
摘要翻译：一种用于量化基于内聚的搜索引擎的搜索结果的质量的方法和系统。该方法和系统包括将一组搜索引擎搜索结果建模为群集并测量群集的内聚。在一个实施例中，聚类的内聚性是聚类元素与质心向量之间的平均相似度。质心矢量是聚类向量权重的平均值。质心向量与簇的元素之间的相似度是余弦相似性度量。搜索结果集中的每个文档由向量表示，其中向量的每个单元表示一个被干扰的单词。每个单元格具有一个单元格值，该单元格值是文档中相应词干词的频率乘以一个考虑到文档中的词干词的位置的权重。

3. 发明授权

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.
摘要翻译：将发布列表缓存到搜索引擎高速缓存中的方法计算过去查询日志中查询词语的频率与每个术语的发布列表的大小之间的比率，并使用这些比率来确定哪些过帐列表应该被缓存按照降序对比率进行排序，并将与最高比值相对应的发布列表存储到高速缓存。此外，在搜索引擎高速缓存的两部分之间找到最佳分配的方法基于流的各种属性与高速缓存的总大小之间的关系来评估过去的查询流，并且使用该信息来确定缓存的两个部分。

4. 发明申请

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.
摘要翻译：将发布列表缓存到搜索引擎高速缓存中的方法计算过去查询日志中查询词语的频率与每个术语的发布列表的大小之间的比率，并使用这些比率来确定哪些过帐列表应该被缓存按照降序对比率进行排序，并将与最高比值相对应的发布列表存储到高速缓存。此外，在搜索引擎高速缓存的两部分之间找到最佳分配的方法基于流的各种属性与高速缓存的总大小之间的关系来评估过去的查询流，并且使用该信息来确定缓存的两个部分。

5. 发明申请

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.
摘要翻译：一种缓存搜索引擎查询结果的方法将搜索引擎缓存分为控制和不受控制的两个部分，并通过准入策略确定应该缓存查询结果的哪个部分。在一个实现中，准入策略通过分析查询的各种特征来估计查询是否可能在将来频繁或不频繁。

6. 发明授权

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.
摘要翻译：这里公开了一种查询的并行处理，其在发布列表交集中使用查询间并行性。通过多个处理单元（例如多核系统的多个处理核心）来并行处理多个任务，例如过帐列表交集任务。

7. 发明申请

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.
摘要翻译：这里公开了一种查询的并行处理，其在发布列表交集中使用查询间并行性。通过多个处理单元（例如多核系统的多个处理核心）来并行处理多个任务，例如过帐列表交集任务。

8. 发明授权

US08682842B2 System and method for logging operations 有权
标题翻译：用于记录操作的系统和方法
公开(公告)号：US08682842B2
公开(公告)日：2014-03-25
申请号：US12331326
申请日：2008-12-09
申请人： Benjamin Reed , Flavio Junqueira
发明人： Benjamin Reed , Flavio Junqueira
IPC分类号： G06F17/00 , G06F7/00
CPC分类号： G06F11/2097 , G06F11/1471
摘要： In a system for storing and retrieving a plurality of records, the plurality of records associated with a ledger, a client issues read and write requests associated with one of the plurality of records, a plurality of record servers responds to the requests received from the client, and a management server maintains and coordinates, between the client and the record servers, information associated with the ledger, records, and record servers.
摘要翻译：在用于存储和检索多个记录的系统中，与分类帐相关联的多个记录，客户端发出与多个记录之一相关联的读取和写入请求，多个记录服务器响应从客户端接收的请求，并且管理服务器在客户端和记录服务器之间维护和协调与分类帐，记录和记录服务器相关联的信息。

9. 发明授权

US08990177B2 Lock-free transactional support for large-scale storage systems 有权
标题翻译：无大规模存储系统的无锁交易支持
公开(公告)号：US08990177B2
公开(公告)日：2015-03-24
申请号：US13283543
申请日：2011-10-27
申请人： Flavio Junqueira , Benjamin Reed , Maysam Yabandeh
发明人： Flavio Junqueira , Benjamin Reed , Maysam Yabandeh
IPC分类号： G06F17/30
CPC分类号： G06F17/30353 , G06F17/30359
摘要： Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.
摘要翻译：描述了一种支持大型存储系统的事务状态oracle（“ReTSO”）的可靠和高效的设计。 ReTSO使用集中式方案并实现快照隔离，这是一种保证读操作读取数据存储一致快照的属性。 ReTSO的集中式方案实现了一种无锁提交算法，可防止未发送的锁定失败的事务阻止其他事务。每个事务将修改后的行的标识符提交给ReTSO，只有当并发事务不提交修改的行时，才会提交事务，并且缓存已提交的事务的日志。要从故障中恢复，在客户端通知更改之前，缓存的更改将首先保存在预写日志中，以便可以通过从预读日志中读取来完全重建内存状态。此外，ReTSO还实现了一种懒惰的自动垃圾收集器散列图，可以减少每个请求的内存访问次数。

10. 发明授权

US08671141B2 Social networking feed delivery system and method 有权
标题翻译：社交网络馈送系统和方法
公开(公告)号：US08671141B2
公开(公告)日：2014-03-11
申请号：US13539949
申请日：2012-07-02
申请人： Marco Serafini , Aristides Gionis , Ingmar Weber , Flavio Junqueira
发明人： Marco Serafini , Aristides Gionis , Ingmar Weber , Flavio Junqueira
IPC分类号： G06F15/16
CPC分类号： G06Q50/01 , G06F17/3089
摘要： Disclosed herein are a system, method and architecture for optimizing a manner in which queries and updates are issued to data stores servicing an application such as a social networking application. A social graph modeling a social network may be used to generate a data store request schedule that optimizes, e.g., minimizes, data store accesses, such as without limitation queries and updates to the data store.
摘要翻译：这里公开了一种系统，方法和架构，用于优化向服务诸如社交网络应用的应用的数据存储发出查询和更新的方式。可以使用建模社交网络的社交图来生成数据存储请求调度，该调度优化例如数据存储访问的最小化，诸如但不限于数据存储的查询和更新。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式