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

1. 发明申请

US20110307517A1 RELAXATION FOR STRUCTURED QUERIES 有权
标题翻译：结构性质疑的放松
公开(公告)号：US20110307517A1
公开(公告)日：2011-12-15
申请号：US12796678
申请日：2010-06-09
申请人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
发明人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30861 , G06F17/30864
摘要： A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要翻译：结构化查询可以指定属性的属性值。确定将结构化查询与应用于结构化数据库时匹配的项目数量的估计。如果估计的项目数量低于阈值，则可以放宽结构化查询以形成新的候选结构化查询。可以基于期望的运行时间来确定候选查询的数量。可以通过改变结构化查询的属性的一个或多个属性值来确定每个候选结构化查询。确定每个候选结构化查询将匹配的项目的数量的估计，并且使用具有最高匹配估计的候选结构化查询来查询数据库。可以输出匹配结果。

2. 发明授权

US09158813B2 Relaxation for structured queries 有权
标题翻译：结构化查询放松
公开(公告)号：US09158813B2
公开(公告)日：2015-10-13
申请号：US12796678
申请日：2010-06-09
申请人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
发明人： Alexandros Ntoulas , Sreenivas Gollapudi , Samuel Ieong , Stelios Paparizos , John Christopher Shafer
IPC分类号： G06F17/30
CPC分类号： G06F17/30451 , G06F17/30861 , G06F17/30864
摘要： A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.
摘要翻译：结构化查询可以指定属性的属性值。确定将结构化查询与应用于结构化数据库时匹配的项目数量的估计。如果估计的项目数量低于阈值，则可以放宽结构化查询以形成新的候选结构化查询。可以基于期望的运行时间来确定候选查询的数量。可以通过改变结构化查询的属性的一个或多个属性值来确定每个候选结构化查询。确定每个候选结构化查询将匹配的项目的数量的估计，并且使用具有最高匹配估计的候选结构化查询来查询数据库。可以输出匹配结果。

3. 发明授权

US08458130B2 Indexing for limited search server availability 有权
标题翻译：索引有限的搜索服务器可用性
公开(公告)号：US08458130B2
公开(公告)日：2013-06-04
申请号：US13040261
申请日：2011-03-03
申请人： Krishnaram N. G. Kenthapadi , Shuai Ding , Sreenivas Gollapudi , Samuel Ieong , Alexandros Ntoulas
发明人： Krishnaram N. G. Kenthapadi , Shuai Ding , Sreenivas Gollapudi , Samuel Ieong , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30017 , G06F17/30864
摘要： Documents are replicated among servers comprising a search engine based on the value of each document by approximating its value as one of the top search results for one or more exemplary queries. Documents are allocated among servers comprising a search engine by calculating a relevance value for each document and then distributing the documents evenly to the servers. A subset of servers are selected from among a plurality of servers comprising a search engine using term-based, server-specific histograms reflecting the number of instances of the term in each document allocated to each server, and then selecting servers to service a query based on the documents on those servers.
摘要翻译：文档在包含基于每个文档的值的搜索引擎的服务器之间通过将其值近似作为一个或多个示例性查询的顶部搜索结果之一来复制。通过计算每个文档的相关性值，然后将文档均匀地分发到服务器，在包含搜索引擎的服务器之间分配文档。从包括使用基于术语的服务器特定直方图的搜索引擎的多个服务器中选择服务器的子集，所述服务器特定的直方图反映分配给每个服务器的每个文档中的术语的实例的数量，然后选择服务于基于查询的服务器在这些服务器上的文档上。

4. 发明申请

US20120226661A1 INDEXING FOR LIMITED SEARCH SERVER AVAILABILITY 有权
标题翻译：指定有限的搜索服务器可用性
公开(公告)号：US20120226661A1
公开(公告)日：2012-09-06
申请号：US13040261
申请日：2011-03-03
申请人： Krishnaram N. G. Kenthapadi , Shuai Ding , Sreenivas Gollapudi , Samuel Ieong , Alexandros Ntoulas
发明人： Krishnaram N. G. Kenthapadi , Shuai Ding , Sreenivas Gollapudi , Samuel Ieong , Alexandros Ntoulas
IPC分类号： G06F17/30
CPC分类号： G06F17/30017 , G06F17/30864
摘要： Documents are replicated among servers comprising a search engine based on the value of each document by approximating its value as one of the top search results for one or more exemplary queries. Documents are allocated among servers comprising a search engine by calculating a relevance value for each document and then distributing the documents evenly to the servers. A subset of servers are selected from among a plurality of servers comprising a search engine using term-based, server-specific histograms reflecting the number of instances of the term in each document allocated to each server, and then selecting servers to service a query based on the documents on those servers.
摘要翻译：文档在包含基于每个文档的值的搜索引擎的服务器之间通过将其值近似作为一个或多个示例性查询的顶部搜索结果之一来复制。通过计算每个文档的相关性值，然后将文档均匀地分发到服务器，在包含搜索引擎的服务器之间分配文档。从包括使用基于术语的服务器特定直方图的搜索引擎的多个服务器中选择服务器的子集，所述服务器特定的直方图反映分配给每个服务器的每个文档中的术语的实例的数量，然后选择服务于基于查询的服务器在这些服务器上的文档上。

5. 发明授权

US08250092B2 Search result diversification 有权
标题翻译：搜索结果多样化
公开(公告)号：US08250092B2
公开(公告)日：2012-08-21
申请号：US13329574
申请日：2011-12-19
申请人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
发明人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/30864
摘要： Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.
摘要翻译：用于接收搜索查询，检索文档，计算给定查询呈现的类别数量的方法，装置和系统，计算在每个类别中显示的结果的数量，计算类别的顺序以及针对所有结果页面在第一页之外，使用用户界面元素，其可选地允许用户快速放大特定类别并获得属于该类别的更多结果。

6. 发明授权

US08086631B2 Search result diversification 有权
标题翻译：搜索结果多样化
公开(公告)号：US08086631B2
公开(公告)日：2011-12-27
申请号：US12334257
申请日：2008-12-12
申请人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
发明人： Sreenivas Gollapudi , Rakesh Agrawal , Samuel Ieong
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/30864
摘要： Methods, apparatus, and systems directed to receiving search queries, retrieving documents, computing the number of categories to present for a given query, computing the number of results to show in each category, computing an ordering of categories, and for all the result pages beyond the first page employing user interface elements that optionally allow the user to quickly zoom in on a specific category and get more results belonging to that category.
摘要翻译：用于接收搜索查询，检索文档，计算给定查询呈现的类别数量的方法，装置和系统，计算在每个类别中显示的结果的数量，计算类别的顺序以及针对所有结果页面在第一页之外，使用用户界面元素，其可选地允许用户快速放大特定类别并获得属于该类别的更多结果。

7. 发明申请

US20130159291A1 RANKING SEARCH RESULTS USING WEIGHTED TOPOLOGIES 审中-公开
标题翻译：使用加权拓扑来排列搜索结果
公开(公告)号：US20130159291A1
公开(公告)日：2013-06-20
申请号：US13325081
申请日：2011-12-14
申请人： Samuel Ieong , Nina Mishra , Or Sheffet
发明人： Samuel Ieong , Nina Mishra , Or Sheffet
IPC分类号： G06F17/30
CPC分类号： G06Q30/02 , G06F16/951
摘要： Identifiers of items generated in response to a query are each ranked in a way that considers the other identified items. Topologies are generated that correspond to features of the identified items. Each topology may be a Markov chain that includes a node for each identified item and directed edges between the nodes. Each directed edge between a node pair has an associated transition probability that represents the likelihood that a hypothetical user would change their preference from a first node in the pair to the second node in the pair when considering the feature associated with the topology. The topologies are weighted according to the relative importance of the features that correspond to the topologies. The weighted topologies are used to generate a stationary distribution of the identified items, and the identified items are ranked using the stationary distribution.
摘要翻译：响应于查询生成的项目的标识符都以考虑其他已识别项目的方式进行排名。生成与所识别项目的特征对应的拓扑。每个拓扑可以是马尔可夫链，其包括用于每个识别的项目的节点和节点之间的有向边。节点对之间的每个有向边具有相关联的转移概率，其表示当考虑与拓扑相关联的特征时，假设用户将其优选从该对中的第一节点改变成对中的第二节点的可能性。根据与拓扑对应的特征的相对重要性，对拓扑进行加权。加权拓扑用于产生所识别的项目的固定分布，并且使用固定分布对所识别的项目进行排名。

8. 发明授权

US08401927B2 Providing time-sensitive information for purchase determinations 有权
标题翻译：为购买确定提供时间敏感信息
公开(公告)号：US08401927B2
公开(公告)日：2013-03-19
申请号：US13296982
申请日：2011-11-15
申请人： Ariel Fuxman , Samuel Ieong , Raja Palani Velu , Rakesh Agrawal
发明人： Ariel Fuxman , Samuel Ieong , Raja Palani Velu , Rakesh Agrawal
IPC分类号： G06Q30/00 , G06Q20/00 , G06Q10/00 , G06G1/14
CPC分类号： G06Q30/0601 , G06Q30/02 , G06Q30/0623 , G06Q30/0625 , G06Q30/0627 , G06Q30/0631
摘要： A method, system, and medium are provided that are directed to providing a user with time-sensitive information that is usable to determine when to purchase a product. In accordance with embodiments of the technology, exemplary steps include using historical product information to generate time-sensitive information. Moreover, in response to receiving from a user a request to receive information describing a given product, time-sensitive information is caused to be presented. For example, time-sensitive information might be usable by the user to determine when to purchase the given product and an alternative product.
摘要翻译：提供了一种方法，系统和介质，其旨在向用户提供可用于确定何时购买产品的时间敏感信息。根据技术的实施例，示例性步骤包括使用历史产品信息来生成时间敏感信息。此外，响应于从用户接收到接收描述给定产品的信息的请求，引起时间敏感信息。例如，用户可以使用时间敏感信息来确定何时购买给定的产品和替代产品。

9. 发明申请

US20120271806A1 GENERATING DOMAIN-BASED TRAINING DATA FOR TAIL QUERIES 审中-公开
标题翻译：生成尾部查询的基于域的训练数据
公开(公告)号：US20120271806A1
公开(公告)日：2012-10-25
申请号：US13091145
申请日：2011-04-21
申请人： Samuel Ieong , Nina Mishra , Eldar Sadikov , Li Zhang
发明人： Samuel Ieong , Nina Mishra , Eldar Sadikov , Li Zhang
IPC分类号： G06F17/30
CPC分类号： G06F16/9535
摘要： Training data is provided for tail queries based on a phenomena in search engine user behavior—referred to herein as “domain trust”—as an indication of user preferences for individual URLs in search results returned by a search engine for tail queries. Also disclosed are methods for generating training data in a search engine by forming a collection of query+URL pairs, identifying domains in the collection, and labeling each domain. Other implementations are directed ranking search results generated by a search engine by measuring domain trust for each domain corresponding to each URL from among a plurality of URLs and then ranking each URL by its measured domain trust.
摘要翻译：根据搜索引擎用户行为（本文称为域信任）的现象，提供了针对尾部查询的训练数据，作为搜索引擎返回的用于尾部查询的搜索结果中的各个URL的用户偏好的指示。还公开了用于通过形成查询+ URL对的集合，识别集合中的域并且标记每个域来在搜索引擎中生成训练数据的方法。针对搜索引擎生成的搜索结果，通过测量来自多个URL中的每个URL的每个域的域信任，然后通过其测量的域信任对每个URL进行排序来定向其他实现。

10. 发明申请

US20110184802A1 AUCTION FORMAT SELECTION USING HISTORICAL DATA 审中-公开
标题翻译：使用历史数据拍卖格式选择
公开(公告)号：US20110184802A1
公开(公告)日：2011-07-28
申请号：US12692659
申请日：2010-01-25
申请人： Samuel Ieong , Jinsong Tan
发明人： Samuel Ieong , Jinsong Tan
IPC分类号： G06Q30/00 , G06Q10/00 , G06N5/02
CPC分类号： G06Q30/08 , G06Q30/0246 , G06Q30/0247 , G06Q30/0275
摘要： An auction format may be selected pursuant to analyzing and identifying certain statistical patterns in historical data. For example, the choice of auction format may be based on whether bids and quality exhibit correlation, which can be identified in the historical data. By identifying the statistical patterns in the data, one can choose an auction format that can achieve generation of higher revenue. Such techniques allow an auctioneer, such as a search engine, to generate higher revenue than using a fixed auction format. For example, in the context of sponsored search auction, if the value of a click and the probability of a click are positively correlated, the auctioneer generates higher revenue by ranking the advertisers by bids rather than by bids multiplied by quality.
摘要翻译：可以根据历史数据中的某些统计模式的分析和识别来选择拍卖格式。例如，拍卖格式的选择可以基于出价和质量是否表现出相关性，这可以在历史数据中被识别。通过识别数据中的统计模式，可以选择可以实现更高收入的拍卖格式。这样的技术允许诸如搜索引擎的拍卖者产生比使用固定拍卖格式更高的收入。例如，在赞助搜索拍卖的上下文中，如果点击的价值和点击的概率是正相关的，则拍卖者通过以出价而不是出价乘以质量来排列广告商而产生更高的收入。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式