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

1. 发明申请

US20070174241A1 Match graphs for query evaluation 审中-公开
标题翻译：匹配图表进行查询评估
公开(公告)号：US20070174241A1
公开(公告)日：2007-07-26
申请号：US11336022
申请日：2006-01-20
申请人： Kevin Beyer , Vanja Josifovski , Edison Ting
发明人： Kevin Beyer , Vanja Josifovski , Edison Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/2247 , G06F16/8365 , G06F17/2241
摘要： Provided are techniques for processing a query. The query is received, and the query is formed by one or more paths, where each path includes one or more steps. A hierarchical document is received that includes one or more document nodes. While processing the query and traversing the hierarchical document to find document nodes described by at least one of the one or more steps of the query, a match graph is constructed that includes one or more match nodes. Each of the match nodes identifies a step instance and is associated with step instances that are ancestors and descendants of the identified step instance. Also, each of the match nodes is associated with a level. In addition, the match graph includes zero or more edges between the match nodes indicating relationships between the match nodes. The match nodes in the match graph are traversed from lower levels to higher levels to construct results for the query.
摘要翻译：提供了用于处理查询的技术。接收到查询，并且查询由一个或多个路径形成，其中每个路径包括一个或多个步骤。收到包含一个或多个文档节点的分层文档。在处理查询并遍历分层文档以查找由查询的一个或多个步骤中的至少一个描述的文档节点时，构建包括一个或多个匹配节点的匹配图。每个匹配节点标识步骤实例，并且与作为所识别的步骤实例的祖先和后代的步骤实例相关联。此外，每个匹配节点与一个级别相关联。此外，匹配图包括指示匹配节点之间的关系的匹配节点之间的零个或多个边缘。匹配图中的匹配节点从较低级别遍历到更高级别，以构造查询的结果。

2. 发明申请

US20070174242A1 Query evaluation using ancestor information 失效
标题翻译：使用祖先信息进行查询评估
公开(公告)号：US20070174242A1
公开(公告)日：2007-07-26
申请号：US11336140
申请日：2006-01-20
申请人： Vanja Josifovski , Edison Ting
发明人： Vanja Josifovski , Edison Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/272 , G06F17/30424 , G06F17/30433 , G06F17/30929 , G06F17/30938 , Y10S707/99933
摘要： Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries.
摘要翻译：提供了用于处理查询的技术。接收到查询，其中查询由一个或多个路径形成，并且其中每个路径包括一个或多个步骤。接收包括一个或多个文档节点的分层文档。在处理查询并遍历分层文档时，构建一个或多个提取条目，其中每个提取条目包括标识文档节点的步骤实例匹配候选和文档节点的步骤实例祖先路径，并且构造一个或多个元组通过将所述一个或多个提取条目中的一个提取条目的所述步骤实例匹配候选与所述一个或多个其他提取条目中的至少一个提取条目与所述步骤实例匹配候选相关联来使用所述一个或多个提取条目。

3. 发明授权

US08666819B2 System and method to facilitate classification and storage of events in a network 有权
标题翻译：促进网络中事件分类和存储的系统和方法
公开(公告)号：US08666819B2
公开(公告)日：2014-03-04
申请号：US11781170
申请日：2007-07-20
申请人： Andrei Zary Broder , Marcus Felipe Fontoura , Vanja Josifovski , Lance Alan Riedel
发明人： Andrei Zary Broder , Marcus Felipe Fontoura , Vanja Josifovski , Lance Alan Riedel
IPC分类号： G06Q30/00 , G06F7/00 , G06F17/30
CPC分类号： G06Q30/02 , G06Q30/0277
摘要： A system and method to facilitate classification and storage of events in a network are described. An event and associated content information are received from an entity over a network. The content information is further analyzed to determine one or more themes representing subject matter related to the content information. The event is further classified according to the themes into one or more corresponding categories. Finally, the event is stored into one or more corresponding databases of a data storage module according to the one or more corresponding categories.
摘要翻译：描述了促进网络中的事件的分类和存储的系统和方法。通过网络从实体接收事件和相关内容信息。进一步分析内容信息以确定表示与内容信息相关的主题的一个或多个主题。该事件根据主题进一步分类为一个或多个相应的类别。最后，根据一个或多个相应的类别将事件存储到数据存储模块的一个或多个相应的数据库中。

4. 发明申请

US20120166291A1 BID GENERATION FOR SPONSORED SEARCH 审中-公开
标题翻译：赞助搜索的生成
公开(公告)号：US20120166291A1
公开(公告)日：2012-06-28
申请号：US12977313
申请日：2010-12-23
申请人： Andrei Broder , Evgeniy Gabrilovich , Vanja Josifovski , George Mavromatis , Benjamin Rey
发明人： Andrei Broder , Evgeniy Gabrilovich , Vanja Josifovski , George Mavromatis , Benjamin Rey
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0256 , G06Q30/0273 , G06Q30/0275
摘要： A system and method of generating bid values for sponsored search includes steps or acts of: receiving a bid phrase for an advertisement for an item, wherein the bid phrase specifies a search query for which the advertisement should be displayed; receiving first information at a first input/output interface, the first information related to a bidding behavior of the advertiser; receiving second information at a second input/output interface, the second information relating to a history of bids by other advertisers for the bid phrase; and generating a bid value for the bid phrase submitted for the advertisement for the search query, based on the information received.
摘要翻译：生成赞助搜索的投标价值的系统和方法包括以下步骤或动作：接收用于项目的广告的投标短语，其中所述投标短语指定应显示该广告的搜索查询; 在第一输入/输出界面处接收第一信息，所述第一信息与所述广告主的投标行为相关; 在第二输入/输出界面处接收第二信息，所述第二信息涉及其他广告商针对所述投标短语的出价历史; 以及基于所接收的信息，为针对搜索查询的广告提交的投标短语生成出价值。

5. 发明申请

US20110258054A1 Automatic Generation of Bid Phrases for Online Advertising 审中-公开
标题翻译：自动生成在线广告投标短语
公开(公告)号：US20110258054A1
公开(公告)日：2011-10-20
申请号：US12693371
申请日：2010-04-19
申请人： Sandeep Pandey , Vanja Josifovski , Bo Pang , Andrei Zary Broder , Evgeniy Gabrilovich , Sujith Ravi
发明人： Sandeep Pandey , Vanja Josifovski , Bo Pang , Andrei Zary Broder , Evgeniy Gabrilovich , Sujith Ravi
IPC分类号： G06Q30/00 , G06F17/28
CPC分类号： G06Q30/02 , G06F17/2795 , G06F17/2818 , G06Q30/0276
摘要： Automatic generation of bid phrases for online advertising comprising storing a computer code representation of a landing page for use with a language model and a translation model (with a parallel corpus) to produce a set of candidate bid phrases that probabilistically correspond to the landing page, and/or to web search phrases. Operations include extracting a set of raw candidate bid phrases from a landing page, generating a set of translated candidate bid phrases using a parallel corpus in conjunction with the raw candidate bid phrases. In order to score and/or reduce the number of candidate bid phrases, a translation table is used to capture the probability that a bid phrase from the raw bid phrases is generated from a bid phrase from the set of translated candidate bid phrases. Scoring and ranking operations reduce the translated candidate bid phrases to just those most relevant to the landing page inputs.
摘要翻译：自动生成用于在线广告的投标短语，包括存储与语言模型和翻译模型（具有并行语料库）一起使用的着陆页的计算机代码表示，以产生概率地对应于着陆页的一组候选投标短语，和/或网页搜索短语。操作包括从着陆页提取一组原始候选投标短语，使用与原始候选投标短语结合的平行语料库生成一组翻译的候选投标短语。为了得分和/或减少候选投标短语的数量，使用翻译表来捕获来自原始投标短语的出价短语从翻译的候选投标短语组中的出价短语产生的概率。评分和排名操作将翻译的候选投标词组缩短到与着陆页输入最相关的候选词组。

6. 发明授权

US07921073B2 System and method for determining impression volumes of content items in a taxonomy hierarchy 有权
标题翻译：用于确定分类层次结构中内容项的展示量的系统和方法
公开(公告)号：US07921073B2
公开(公告)日：2011-04-05
申请号：US11696944
申请日：2007-04-05
申请人： Deepak Agarwal , Dejan Diklic , Deepayan Chakrabarti , Andrei Zary Broder , Vanja Josifovski
发明人： Deepak Agarwal , Dejan Diklic , Deepayan Chakrabarti , Andrei Zary Broder , Vanja Josifovski
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06Q30/02
摘要： Described are a system and method for determining an event occurrence rate. A sample set of content items may be obtained. Each of the content items may be associated with at least one region in a hierarchical data structure. A first impression volume may be determined for the at least one region as a function of a number of impressions registered for the content items associated with the at least one region. A scale factor may be applied to the first impression volume to generate a second impression volume. The scale factor may be selected so that the second impression volume is within a predefined range of a third impression volume. A click-through-rate (CTR) may be estimated as a function of the second impression volume and a number of clicks on the content item.
摘要翻译：描述了用于确定事件发生率的系统和方法。可以获得一组内容项目。每个内容项可以与分层数据结构中的至少一个区域相关联。可以根据针对与至少一个区域相关联的内容项登记的展示次数的函数来确定至少一个区域的第一印象量。比例因子可以应用于第一印象量以产生第二印象量。可以选择比例因子，使得第二印象量在第三印象体积的预定范围内。点击率可以根据第二次展示次数和内容项目的点击次数进行估算。

7. 发明授权

US07636735B2 Method for estimating the cost of query processing 失效
标题翻译：估算查询处理成本的方法
公开(公告)号：US07636735B2
公开(公告)日：2009-12-22
申请号：US11206978
申请日：2005-08-19
申请人： Peter Jay Haas , Vanja Josifovski , Guy Maring Lohman , Chun Zhang
发明人： Peter Jay Haas , Vanja Josifovski , Guy Maring Lohman , Chun Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30935 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935 , Y10S707/99945 , Y10S707/99948
摘要： Provided is a method for modeling the cost of XML as well as relational operators. As with traditional relational cost estimation, a set of system catalog statistics that summarizes the XML data is exploited; however, the novel use of a set of simple path statistics is also proposed. A new statistical learning technique called transform regression is utilized instead of detailed analytical models to predict the overall cost of an operator. Additionally, a query optimizer in a database is enabled to be self-tuning, automatically adapting to changes over time in the query workload and in the system environment.
摘要翻译：提供了一种用于建模XML成本以及关系运算符的方法。与传统的关系成本估算一样，利用了一套总结XML数据的系统目录统计数据; 然而，还提出了一组简单路径统计学的新颖使用。使用称为变换回归的新的统计学习技术，而不是详细的分析模型来预测运营商的整体成本。另外，数据库中的查询优化器可以自我调整，自动适应查询工作负载和系统环境中随时间的变化。

8. 发明申请

US20090287700A1 QUERY EVALUATION USING ANCESTOR INFORMATION 失效
标题翻译：查询评估使用ANCESTOR信息
公开(公告)号：US20090287700A1
公开(公告)日：2009-11-19
申请号：US12537983
申请日：2009-08-07
申请人： Vanja Josifovski , Edison L. Ting
发明人： Vanja Josifovski , Edison L. Ting
IPC分类号： G06F17/30
CPC分类号： G06F17/272 , G06F17/30424 , G06F17/30433 , G06F17/30929 , G06F17/30938 , Y10S707/99933
摘要： Provided are techniques for processing a query. A query is received, wherein the query is formed by one or more paths, and wherein each path includes one or more steps. A hierarchical document including one or more document nodes is received. While processing the query and traversing the hierarchical document, one or more extraction entries are constructed, wherein each extraction entry includes a step instance match candidate identifying a document node and a step instance ancestor path for the document node, and one or more tuples are constructed using the one or more extraction entries by associating the step instance match candidate from one of the one or more extraction entries with the step instance match candidate from at least one of the one or more other extraction entries.
摘要翻译：提供了用于处理查询的技术。接收到查询，其中查询由一个或多个路径形成，并且其中每个路径包括一个或多个步骤。接收包括一个或多个文档节点的分层文档。在处理查询并遍历分层文档时，构建一个或多个提取条目，其中每个提取条目包括标识文档节点的步骤实例匹配候选和文档节点的步骤实例祖先路径，并且构造一个或多个元组通过将所述一个或多个提取条目中的一个提取条目的所述步骤实例匹配候选项与所述一个或多个其他提取条目中的至少一个提取条目与所述步骤实例匹配候选相关联来使用所述一个或多个提取条目。

9. 发明申请

US20090228528A1 SUPPORTING SUB-DOCUMENT UPDATES AND QUERIES IN AN INVERTED INDEX 审中-公开
标题翻译：支持反向索引中的子文档更新和查询
公开(公告)号：US20090228528A1
公开(公告)日：2009-09-10
申请号：US12043858
申请日：2008-03-06
申请人： Vuk Ercegovac , Vanja Josifovski , Ning Li , Mauricio Mediano , Eugene J. Shekita
发明人： Vuk Ercegovac , Vanja Josifovski , Ning Li , Mauricio Mediano , Eugene J. Shekita
IPC分类号： G06F17/30
CPC分类号： G06F16/319
摘要： A system, method, and computer program product for updating a partitioned index of a dataset. A document is indexed by separating it into indexable sections, such that different ones of the indexable sections may be contained in different partitions of the partitioned index. The partitioned index is updated using an updated version of the document by updating only those sections of the index corresponding to sections of the document that have been updated in the updated version.
摘要翻译：一种用于更新数据集的分区索引的系统，方法和计算机程序产品。通过将文档分离成可索引的部分来索引文档，使得不同的可索引部分可能包含在分区索引的不同分区中。使用文档的更新版本更新分区索引，只更新对应于已更新版本中已更新的文档部分的索引部分。

10. 发明申请

US20090024623A1 System and Method to Facilitate Mapping and Storage of Data Within One or More Data Taxonomies 审中-公开
标题翻译：在一个或多个数据分类中促进数据映射和存储的系统和方法
公开(公告)号：US20090024623A1
公开(公告)日：2009-01-22
申请号：US11781176
申请日：2007-07-20
申请人： Andrei Zary Broder , Vanja Josifovski , Marcus Felipe Fontoura , Lance Alan Riedel
发明人： Andrei Zary Broder , Vanja Josifovski , Marcus Felipe Fontoura , Lance Alan Riedel
IPC分类号： G06F7/00 , G06Q30/00
CPC分类号： G06Q30/02 , G06F16/951
摘要： A system and method to facilitate mapping and storage of data within one or more data taxonomies are described. Content information is received over a network. The content information is further analyzed to determine at least one theme representing subject matter related to the content information. Finally, the content information is stored within respective predetermined categories organized within at least one taxonomy, the predetermined categories being associated with the at least one theme.
摘要翻译：描述了一种有助于在一个或多个数据分类中映射和存储数据的系统和方法。通过网络接收内容信息。进一步分析内容信息以确定表示与内容信息相关的主题的至少一个主题。最后，将内容信息存储在组织在至少一个分类法内的各个预定类别内，预定类别与至少一个主题相关联。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式