-
公开(公告)号：US08838576B2
公开(公告)日：2014-09-16
申请号：US12577534
申请日：2009-10-12
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.
摘要翻译： 这里公开了一种查询的并行处理，其在发布列表交集中使用查询间并行性。 通过多个处理单元（例如多核系统的多个处理核心）来并行处理多个任务，例如过帐列表交集任务。
-
公开(公告)号：US20110087684A1
公开(公告)日：2011-04-14
申请号：US12577534
申请日：2009-10-12
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.
摘要翻译： 这里公开了一种查询的并行处理，其在发布列表交集中使用查询间并行性。 通过多个处理单元（例如多核系统的多个处理核心）来并行处理多个任务，例如过帐列表交集任务。
-
3.发明授权公开(公告)号：US09805122B2
公开(公告)日：2017-10-31
申请号：US14238487
申请日：2011-08-12
申请人： Jan Seedorf , Saverio Niccolini , Martin Stiemerling , Flavio Junqueira , Marco Serafini , Ivan Kelly , Vincent Leroy , Berkant Barla Cambazoglu
发明人： Jan Seedorf , Saverio Niccolini , Martin Stiemerling , Flavio Junqueira , Marco Serafini , Ivan Kelly , Vincent Leroy , Berkant Barla Cambazoglu
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： A search engine for finding objects that correspond to a search request, including an input module for receiving a keyword query from a user, and a search module being configured to map the keyword query to the identifiers of objects that semantically match the keyword or the plurality of keywords contained in the keyword query, and to generate a search result that contains a listing of matching object identifiers, is characterized in that the search module is further configured to generate the search result by considering network layer information about the user within the process of mapping the keyword query to identifiers of matching objects, wherein the network layer information include sophisticated information the search module receives from a dedicated entity.
-
4.发明申请公开(公告)号：US20140201184A1
公开(公告)日：2014-07-17
申请号：US14238487
申请日：2011-08-12
申请人： Jan Seedorf , Saverio Niccolini , Martin Stiemerling , Flavio Junqueira , Marco Serafini , Ivan Kelly , Vincent Leroy , Berkant Barla Cambazoglu
发明人： Jan Seedorf , Saverio Niccolini , Martin Stiemerling , Flavio Junqueira , Marco Serafini , Ivan Kelly , Vincent Leroy , Berkant Barla Cambazoglu
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： A search engine for finding objects that correspond to a search request, including an input module for receiving a keyword query from a user, and a search module being configured to map the keyword query to the identifiers of objects that semantically match the keyword or the plurality of keywords contained in the keyword query, and to generate a search result that contains a listing of matching object identifiers, is characterized in that the search module is further configured to generate the search result by considering network layer information about the user within the process of mapping the keyword query to identifiers of matching objects, wherein the network layer information include sophisticated information the search module receives from a dedicated entity.
摘要翻译： 一种用于查找对应于搜索请求的对象的搜索引擎，包括用于从用户接收关键字查询的输入模块，以及搜索模块，其被配置为将关键字查询映射到语义上匹配关键字或多个对象的对象标识符 的关键字查询中包含的关键字，以及生成包含匹配对象标识符的列表的搜索结果，其特征在于，所述搜索模块还被配置为通过在所述关键字查询的过程中考虑关于所述用户的网络层信息来生成所述搜索结果 将关键字查询映射到匹配对象的标识符，其中网络层信息包括搜索模块从专用实体接收的复杂信息。
-
5.发明授权Method and system for quantifying the quality of search results based on cohesion 有权基于凝聚力量化搜索结果质量的方法和系统公开(公告)号：US07720870B2
公开(公告)日：2010-05-18
申请号：US11959182
申请日：2007-12-18
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.
摘要翻译： 一种用于量化基于内聚的搜索引擎的搜索结果的质量的方法和系统。 该方法和系统包括将一组搜索引擎搜索结果建模为群集并测量群集的内聚。 在一个实施例中，聚类的内聚性是聚类元素与质心向量之间的平均相似度。 质心矢量是聚类向量权重的平均值。 质心向量与簇的元素之间的相似度是余弦相似性度量。 搜索结果集中的每个文档由向量表示，其中向量的每个单元表示一个被干扰的单词。 每个单元格具有一个单元格值，该单元格值是文档中相应词干词的频率乘以一个考虑到文档中的词干词的位置的权重。
-
公开(公告)号：US07890488B2
公开(公告)日：2011-02-15
申请号：US11868383
申请日：2007-10-05
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.
摘要翻译： 将发布列表缓存到搜索引擎高速缓存中的方法计算过去查询日志中查询词语的频率与每个术语的发布列表的大小之间的比率，并使用这些比率来确定哪些过帐列表应该被缓存 按照降序对比率进行排序，并将与最高比值相对应的发布列表存储到高速缓存。 此外，在搜索引擎高速缓存的两部分之间找到最佳分配的方法基于流的各种属性与高速缓存的总大小之间的关系来评估过去的查询流，并且使用该信息来确定 缓存的两个部分。
-
7.发明申请公开(公告)号：US20090157652A1
公开(公告)日：2009-06-18
申请号：US11959182
申请日：2007-12-18
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.
摘要翻译： 一种用于量化基于内聚的搜索引擎的搜索结果的质量的方法和系统。 该方法和系统包括将一组搜索引擎搜索结果建模为群集并测量群集的内聚。 在一个实施例中，聚类的内聚性是聚类元素与质心向量之间的平均相似度。 质心矢量是聚类向量权重的平均值。 质心向量与簇的元素之间的相似度是余弦相似性度量。 搜索结果集中的每个文档由向量表示，其中向量的每个单元表示一个被干扰的单词。 每个单元格具有一个单元格值，该单元格值是文档中相应词干词的频率乘以一个考虑到文档中的词干词的位置的权重。
-
公开(公告)号：US20090094416A1
公开(公告)日：2009-04-09
申请号：US11868383
申请日：2007-10-05
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.
摘要翻译： 将发布列表缓存到搜索引擎高速缓存中的方法计算过去查询日志中查询词语的频率与每个术语的发布列表的大小之间的比率，并使用这些比率来确定哪些过帐列表应该被缓存 按照降序对比率进行排序，并将与最高比值相对应的发布列表存储到高速缓存。 此外，在搜索引擎高速缓存的两部分之间找到最佳分配的方法基于流的各种属性与高速缓存的总大小之间的关系来评估过去的查询流，并且使用该信息来确定 缓存的两个部分。
-
公开(公告)号：US20090094200A1
公开(公告)日：2009-04-09
申请号：US11868396
申请日：2007-10-05
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.
摘要翻译： 一种缓存搜索引擎查询结果的方法将搜索引擎缓存分为控制和不受控制的两个部分，并通过准入策略确定应该缓存查询结果的哪个部分。 在一个实现中，准入策略通过分析查询的各种特征来估计查询是否可能在将来频繁或不频繁。
-
公开(公告)号：US08682842B2
公开(公告)日：2014-03-25
申请号：US12331326
申请日：2008-12-09
申请人： Benjamin Reed , Flavio Junqueira
发明人： Benjamin Reed , Flavio Junqueira
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.
摘要翻译： 在用于存储和检索多个记录的系统中，与分类帐相关联的多个记录，客户端发出与多个记录之一相关联的读取和写入请求，多个记录服务器响应从客户端接收的请求 ，并且管理服务器在客户端和记录服务器之间维护和协调与分类帐，记录和记录服务器相关联的信息。
-
-
-
-
-
-
-
-
-
搜索结果
17 条记录 (耗时 0.021 秒)
