公开(公告)号：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.

摘要翻译： 生成赞助搜索的投标价值的系统和方法包括以下步骤或动作：接收用于项目的广告的投标短语，其中所述投标短语指定应显示该广告的搜索查询; 在第一输入/输出界面处接收第一信息，所述第一信息与所述广告主的投标行为相关; 在第二输入/输出界面处接收第二信息，所述第二信息涉及其他广告商针对所述投标短语的出价历史; 以及基于所接收的信息，为针对搜索查询的广告提交的投标短语生成出价值。

公开(公告)号：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.

摘要翻译： 自动生成用于在线广告的投标短语，包括存储与语言模型和翻译模型（具有并行语料库）一起使用的着陆页的计算机代码表示，以产生概率地对应于着陆页的一组候选投标短语， 和/或网页搜索短语。 操作包括从着​​陆页提取一组原始候选投标短语，使用与原始候选投标短语结合的平行语料库生成一组翻译的候选投标短语。 为了得分和/或减少候选投标短语的数量，使用翻译表来捕获来自原始投标短语的出价短语从翻译的候选投标短语组中的出价短语产生的概率。 评分和排名操作将翻译的候选投标词组缩短到与着陆页输入最相关的候选词组。

公开(公告)号：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.

摘要翻译： 描述了用于确定事件发生率的系统和方法。 可以获得一组内容项目。 每个内容项可以与分层数据结构中的至少一个区域相关联。 可以根据针对与至少一个区域相关联的内容项登记的展示次数的函数来确定至少一个区域的第一印象量。 比例因子可以应用于第一印象量以产生第二印象量。 可以选择比例因子，使得第二印象量在第三印象体积的预定范围内。 点击率可以根据第二次展示次数和内容项目的点击次数进行估算。

公开(公告)号：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数据的系统目录统计数据; 然而，还提出了一组简单路径统计学的新颖使用。 使用称为变换回归的新的统计学习技术，而不是详细的分析模型来预测运营商的整体成本。 另外，数据库中的查询优化器可以自我调整，自动适应查询工作负载和系统环境中随时间的变化。

公开(公告)号：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.

摘要翻译： 提供了用于处理查询的技术。 接收到查询，其中查询由一个或多个路径形成，并且其中每个路径包括一个或多个步骤。 接收包括一个或多个文档节点的分层文档。 在处理查询并遍历分层文档时，构建一个或多个提取条目，其中每个提取条目包括标识文档节点的步骤实例匹配候选和文档节点的步骤实例祖先路径，并且构造一个或多个元组 通过将所述一个或多个提取条目中的一个提取条目的所述步骤实例匹配候选项与所述一个或多个其他提取条目中的至少一个提取条目与所述步骤实例匹配候选相关联来使用所述一个或多个提取条目。

公开(公告)号：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.

摘要翻译： 一种用于更新数据集的分区索引的系统，方法和计算机程序产品。 通过将文档分离成可索引的部分来索引文档，使得不同的可索引部分可能包含在分区索引的不同分区中。 使用文档的更新版本更新分区索引，只更新对应于已更新版本中已更新的文档部分的索引部分。

公开(公告)号：US20080016045A1

公开(公告)日：2008-01-17

申请号：US11837567

申请日：2007-08-13

申请人： Martin BREINING ,  Vanja Josifovski ,  Peter Schwarz

发明人： Martin BREINING ,  Vanja Josifovski ,  Peter Schwarz

IPC分类号： G06F17/30 ,  G06F7/10

CPC分类号： G06F17/30923 ,  G06F17/30914 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99945

摘要： An XML wrapper queries an XML document in an on-the-fly manner so that only parent nodes in the document that satisfy the query are extracted and then unnested. The parent nodes and associated descendent nodes are located using XPath expressions contained as options in data definition language (DDL) statements. The parent nodes satisfying the query and associated descendent nodes are extracted and stored outside of a database according to a relational schema. The wrapper facilitates applications that use convention SQL queries and views to operate on that information stored according to the relational schema. The wrapper also responds to query optimizer requests for costs associated with queries against external data sources associated with the wrapper.

摘要翻译： XML包装器以动态方式查询XML文档，从而仅提取满足查询的文档中的父节点，然后不需要。 使用包含在数据定义语言（DDL）语句中的选项的XPath表达式来定位父节点和关联的后代节点。 满足查询和相关后代节点的父节点根据关系模式提取存储在数据库外部。 包装器便于使用常规SQL查询和视图的应用程序对根据关系模式存储的信息进行操作。 包装器还响应查询优化程序请求与与包装器相关联的外部数据源的查询相关的成本。

公开(公告)号：US20050114316A1

公开(公告)日：2005-05-26

申请号：US10723391

申请日：2003-11-25

申请人： Marcus Fontoura ,  Vanja Josifovski ,  Pratik Mukhopadhyay

发明人： Marcus Fontoura ,  Vanja Josifovski ,  Pratik Mukhopadhyay

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30911

摘要： A system and method for parsing documents in query processing comprises producing at least one index of a document written in a mark-up language, corresponding the index to the document, scanning the document, and selectively skipping portions of the document based on instructions from the index. Furthermore, the mark-up language comprises any of HTML and XML; the skipped portions of the document comprise portions irrelevant to the query; the index comprises a plurality of elements representing textual categories of the query; and the instructions match the elements to the query. If the elements do not match the query, then the parser uses the index to skip the portions of the document corresponding to the unmatched elements. Moreover, each of the elements corresponds to a position in the document, wherein the position comprises an end position, which determines where to resume scanning the document upon skipping the portions of the document.

摘要翻译： 用于在查询处理中解析文档的系统和方法包括生成以标记语言书写的文档的至少一个索引，对应于该文档的索引，扫描该文档，以及基于来自该文档的指令来选择性地跳过文档的部分 指数。 此外，标记语言包括HTML和XML中的任何一种; 文档的跳过部分包括与查询无关的部分; 所述索引包括表示所述查询的文本类别的多个元素; 并且指令与查询的元素匹配。 如果元素与查询不匹配，则解析器使用索引来跳过对应于不匹配元素的文档部分。 此外，每个元素对应于文档中的位置，其中该位置包括结束位置，其确定在跳过文档的部分时恢复扫描文档的位置。

公开(公告)号：US08676827B2

公开(公告)日：2014-03-18

申请号：US12365551

申请日：2009-02-04

申请人： Donald Metzler ,  Lance Riedel ,  Evgeniy Gabrilovich ,  Vanja Josifovski

发明人： Donald Metzler ,  Lance Riedel ,  Evgeniy Gabrilovich ,  Vanja Josifovski

IPC分类号： G06F17/30 ,  G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0256

摘要： A method is disclosed for expansion of rare queries to improve advertisement results, including receiving a query from a user by a search engine; determining that the query does not match an entry in an ad query lookup table coupled with the search engine; retrieving one or more expanded queries located within a query feature index whose features relate to one or more features of the received query, wherein the query feature index includes a plurality of queries expanded based on at least corresponding search results; generating, in real time and by the search engine, an ad query including an expanded version of the received query based on features of the retrieved expanded queries; and selecting one or more advertisements based on the generated ad query, wherein the one or more advertisements are displayed to the user in response to the query received from the user.

摘要翻译： 公开了一种用于扩展罕见查询以改善广告结果的方法，包括由搜索引擎从用户接收查询; 确定所述查询与所述搜索引擎耦合的广告查询查找表中的条目不匹配; 检索位于查询特征索引内的一个或多个扩展查询，其特征涉及所接收的查询的一个或多个特征，其中所述查询特征索引包括基于至少相应搜索结果而扩展的多个查询; 基于检索到的扩展查询的特征，实时地和由搜索引擎生成包括所接收查询的扩展版本的广告查询; 以及基于所生成的广告查询来选择一个或多个广告，其中所述一个或多个广告响应于从所述用户接收到的查询显示给所述用户。

公开(公告)号：US20120166445A1

公开(公告)日：2012-06-28

申请号：US13414004

申请日：2012-03-07

申请人： Deepayan Chakrabarti ,  Deepak K. Agrawal ,  Vanja Josifovski

发明人： Deepayan Chakrabarti ,  Deepak K. Agrawal ,  Vanja Josifovski

IPC分类号： G06F17/30

CPC分类号： G06F17/3053 ,  G06F17/30864 ,  G06Q30/02

摘要： A method and apparatus are provided for better web ad matching by combining relevance with consumer click feedback. In one example, the method includes receiving a query page, extracting features from the query page, re-weighting the query page, evaluating the query page in light of each ad in order to score each ad and pick substantially best ad matches of the indexed ads, and returning the substantially best ad matches to the consumer computer.

摘要翻译： 通过将消费者点击反馈的相关性相结合，提供了一种更好的网络广告匹配的方法和装置。 在一个示例中，该方法包括接收查询页面，从查询页面提取特征，重新加权查询页面，根据每个广告评估查询页面，以便对每个广告进行评分，并选择基本上最佳的索引的广告匹配 广告，并将基本上最好的广告匹配返回给消费者计算机。