-
21.发明授权Methods of dynamically creating personalized Internet advertisements based on advertiser input 有权基于广告客户输入动态创建个性化互联网广告的方法公开(公告)号：US08650265B2
公开(公告)日：2014-02-11
申请号：US11708396
申请日：2007-02-20
CPC分类号： G06Q30/0258 , G06Q30/02 , G06Q30/0264
摘要： The World Wide Web portion of the Internet is largely supported by advertising. To deliver the most effective advertising, a system for dynamically creating customized advertisements is introduced. The behavior and any demographic information known about web viewers is used to select an advertising template that will be used to create an advertisement. The advertisement template comprises an incomplete advertisement with certain missing information along with identifiers for functions that may be used to complete the advertisement. In one embodiment, the functions may specify how the advertiser associated with the advertisement template may be contacted with the demographic information known about the user in order to fill in the missing portions of advertisement template. For example, the advertisement may concern flights to Hawaii and the advertiser may fill in the price of a flight to Hawaii based upon being provided with the user's location. The complete advertisement may then be displayed to the user.
摘要翻译： 互联网的万维网部分在很大程度上得到了广告的支持。 为了提供最有效的广告，介绍了一种用于动态创建自定义广告的系统。 已知的关于网络浏览者的行为和任何人口统计信息用于选择将用于创建广告的广告模板。 广告模板包括具有某些缺失信息的不完整广告以及可用于完成广告的功能的标识符。 在一个实施例中，功能可以指定如何将与广告模板相关联的广告商与关于用户已知的人口统计信息联系起来，以便填充广告模板的缺失部分。 例如，广告可能涉及到夏威夷的航班，并且广告商可以根据被提供用户的位置来填写飞往夏威夷的航班的价格。 然后可以向用户显示完整的广告。
-
公开(公告)号：US20110264640A1
公开(公告)日：2011-10-27
申请号：US12764469
申请日：2010-04-21
申请人： Marcus Fontoura , Vanja Josifovski , Evgeniy Gabrilovich , Bo Pang , Yejin Choi , Mauricio Riguette Mediano
发明人： Marcus Fontoura , Vanja Josifovski , Evgeniy Gabrilovich , Bo Pang , Yejin Choi , Mauricio Riguette Mediano
IPC分类号： G06F17/30
CPC分类号： G06Q30/0241 , G06F17/30312 , G06Q30/0277
摘要： A system and a system are provided for using external sources (e.g., landing pages) for sponsored search ad selection. In one example, the system identifies one or more regions of an external source. The one or more regions are relevant to a query. The external source includes a source that includes relevant data that is usable for augmenting an ad selection process. The system extracts one or more features from the one or more regions. The system determines which of the one or more features are relevant for item indexing. The system then augments an item selection process by using the one or more features that are relevant for item indexing.
摘要翻译： 提供了一种系统和系统，用于使用外部来源（例如登陆页面）来进行赞助搜索广告选择。 在一个示例中，系统识别外部源的一个或多个区域。 一个或多个区域与查询相关。 外部来源包括一个源，其中包含可用于扩展广告选择过程的相关数据。 系统从一个或多个区域提取一个或多个特征。 系统确定一个或多个特征中的哪一个与项目索引相关。 然后，系统通过使用与项目索引相关的一个或多个特征来增加项目选择过程。
-
公开(公告)号：US07979423B2
公开(公告)日：2011-07-12
申请号：US12537983
申请日：2009-08-07
申请人： Vanja Josifovski , Edison L. Ting
发明人： Vanja Josifovski , Edison L. Ting
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.
摘要翻译： 提供了用于处理查询的技术。 接收到查询，其中查询由一个或多个路径形成，并且其中每个路径包括一个或多个步骤。 接收包括一个或多个文档节点的分层文档。 在处理查询并遍历分层文档时，构建一个或多个提取条目，其中每个提取条目包括标识文档节点的步骤实例匹配候选和文档节点的步骤实例祖先路径，并且构造一个或多个元组 通过将所述一个或多个提取条目中的一个提取条目的所述步骤实例匹配候选项与所述一个或多个其他提取条目中的至少一个提取条目与所述步骤实例匹配候选相关联来使用所述一个或多个提取条目。
-
24.发明授权公开(公告)号：US07925668B2
公开(公告)日：2011-04-12
申请号：US11769323
申请日：2007-06-27
IPC分类号： G06F17/30
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查询和视图的应用程序对根据关系模式存储的信息进行操作。 包装器还响应查询优化程序请求与与包装器相关联的外部数据源的查询相关的成本。
-
公开(公告)号：US20100205213A1
公开(公告)日：2010-08-12
申请号：US12370306
申请日：2009-02-12
申请人： Andrei Broder , Vanja Josifovski , Shanmugasundaram Ravikumar , Sandeep Pandey , Serguei Vassilvitskii , Flavio Chierichetti
发明人： Andrei Broder , Vanja Josifovski , Shanmugasundaram Ravikumar , Sandeep Pandey , Serguei Vassilvitskii , Flavio Chierichetti
CPC分类号： G06Q30/0251 , G06F16/24539 , G06Q10/06
摘要： The subject matter disclosed herein relates to returning cached object results based at least in part on a non-exact comparison with a query key.
摘要翻译： 本文公开的主题涉及至少部分地基于与查询密钥的非精确比较来返回缓存的对象结果。
-
公开(公告)号：US20100198857A1
公开(公告)日：2010-08-05
申请号：US12365551
申请日：2009-02-04
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.
摘要翻译： 公开了一种用于扩展罕见查询以改善广告结果的方法，包括由搜索引擎从用户接收查询; 确定所述查询与所述搜索引擎耦合的广告查询查找表中的条目不匹配; 检索位于查询特征索引内的一个或多个扩展查询，其特征涉及所接收的查询的一个或多个特征，其中所述查询特征索引包括基于至少相应搜索结果而扩展的多个查询; 基于检索到的扩展查询的特征，实时地和由搜索引擎生成包括所接收查询的扩展版本的广告查询; 以及基于所生成的广告查询来选择一个或多个广告，其中所述一个或多个广告响应于从所述用户接收到的查询显示给所述用户。
-
27.发明申请Systems and Methods for Predicting a Degree of Relevance Between Digital Ads and Webpage Content 审中-公开用于预测数字广告与网页内容之间相关程度的系统和方法公开(公告)号：US20090282015A1
公开(公告)日：2009-11-12
申请号：US12116737
申请日：2008-05-07
申请人： Evgeniy Gabrilovich , Vassillis Plachouras , Andrei Broder , Vanessa Murdock , Donald Metzler , Vanja Josifovski , Massimiliano Ciaramita , Marcus Fontoura
发明人： Evgeniy Gabrilovich , Vassillis Plachouras , Andrei Broder , Vanessa Murdock , Donald Metzler , Vanja Josifovski , Massimiliano Ciaramita , Marcus Fontoura
IPC分类号： G06F17/30
CPC分类号： G06Q30/02
摘要： Systems and methods for predicting a degree of relevance between a set of candidate digital ads and webpage content are disclosed. Generally, an ad provider receives a digital ad request associated with webpage content. The ad provider identifies a set of candidate digital ads that may be served in response to the digital ad request. A relevance module extracts a set of features from the set of candidate digital ads and the webpage content, and determines a degree of relevance between the set of candidate digital ads and the webpage content based on a prediction model and the extracted set of features. If the relevance module determines the set of candidate digital ads is relevant to the webpage content, the ad provider may serve one or more digital ads from the set of candidate digital ads in response to the received digital ad request.
摘要翻译： 公开了用于预测一组候选数字广告和网页内容之间的相关程度的系统和方法。 通常，广告提供商接收与网页内容相关联的数字广告请求。 广告提供商确定可以针对数字广告请求提供的一组候选数字广告。 相关性模块从一组候选数字广告和网页内容中提取一组特征，并且基于预测模型和所提取的特征集合确定候选数字广告集合和网页内容之间的相关程度。 如果相关性模块确定候选数字广告的集合与网页内容相关，则广告提供者可以响应于所接收的数字广告请求，从一组候选数字广告服务一个或多个数字广告。
-
公开(公告)号：US07577644B2
公开(公告)日：2009-08-18
申请号：US11548548
申请日：2006-10-11
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/30637 , Y10S707/99933 , Y10S707/99935
摘要： In an example embodiment, the present invention provides methods and logic for enhancing augmented search, including contextual search, conducted by a search engine. In some instances, a contextual search might return a set of results that are less relevant than the set of results returned by algorithmic search. This might occur when the quantity of contextual information is very large or when the contextual information includes misspellings. An embodiment of the present invention detects such occurrences and corrects the set of results provided to the user by merging a ranked set of results from the contextual search with a ranked set of results from an algorithmic search. During this merge process, an embodiment of the present invention replaces irrelevant results from the contextual search with results from the algorithmic search if the latter results fall within the context used for the contextual search. Embodiments of the present invention might also be used to enhance, in a similar fashion, personalized search and other forms of augmented search.
摘要翻译： 在示例实施例中，本发明提供了用于增强由搜索引擎执行的增强搜索（包括上下文搜索）的方法和逻辑。 在某些情况下，上下文搜索可能会返回一组与算法搜索返回的结果集相关的结果。 当上下文信息量非常大或上下文信息包含拼写错误时，可能会发生这种情况。 本发明的一个实施例通过将来自上下文搜索的排名的一组结果与来自算法搜索的排名的结果集合合并来检测这样的事件并且校正提供给用户的结果集合。 在该合并过程中，如果后一结果落在用于上下文搜索的上下文中，则本发明的实施例将来自上下文搜索的不相关结果替换为来自算法搜索的结果。 本发明的实施例也可以用于以类似的方式增强个性化搜索和增强搜索的其他形式。
-
公开(公告)号：US20080010302A1
公开(公告)日：2008-01-10
申请号：US11475807
申请日：2006-06-27
IPC分类号： G06F7/00
CPC分类号： G06F17/30442 , Y10S707/99942
摘要： A holistic twig join method with optimal cursor movement is disclosed. The method in one aspect minimizes the number of cursor moves by looking more globally at the query's state to determine which cursor to move next and making virtual moves where a physical move is not needed. The method in another aspect reduces the number of cursor moves by skipping over nodes that do not need to be output.
摘要翻译： 公开了一种具有最佳光标移动的整体树枝连接方法。 一方面的方法通过在查询的状态下更全面地查看光标移动的数量来最小化以确定哪个光标移动到下一个并且进行不需要物理移动的虚拟移动。 另一方面的方法通过跳过不需要输出的节点来减少光标移动的数量。
-
30.发明申请QUERYING MARKUP LANGUAGE DATA SOURCES USING A RELATIONAL QUERY PROCESSOR 失效查询使用相关查询处理程序的MARKUP语言数据源公开(公告)号：US20070250503A1
公开(公告)日：2007-10-25
申请号：US11769323
申请日：2007-06-27
申请人： Martin BREINING , Vanja Josifovski , Peter Schwarz
发明人： Martin BREINING , Vanja Josifovski , Peter Schwarz
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查询和视图的应用程序对根据关系模式存储的信息进行操作。 包装器还响应查询优化程序请求与与包装器相关联的外部数据源的查询相关的成本。
-
-
-
-
-
-
-
-
-
搜索结果
93 条记录 (耗时 0.023 秒)
